default search action
Jelle J. Oostveen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Jelle J. Oostveen
, Erik Jan van Leeuwen:
Parameterized Complexity of Streaming Diameter and Connectivity Problems. Algorithmica 86(9): 2885-2928 (2024) - [c7]Hans L. Bodlaender
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA 2024: 206-217 - [i9]Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen:
The Complexity of Diameter on H-free graphs. CoRR abs/2402.16678 (2024) - 2023
- [j1]Jelle J. Oostveen
Streaming deletion problems parameterized by vertex cover. Theor. Comput. Sci. 979: 114178 (2023) - [c6]Nick Brettell
Computing Subset Vertex Covers in H-Free Graphs. FCT 2023: 88-102 - [c5]Hans L. Bodlaender
The Parameterised Complexity Of Integer Multicommodity Flow. IPEC 2023: 6:1-6:19 - [i8]Hans L. Bodlaender
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR abs/2305.01613 (2023) - [i7]Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen:
Computing Subset Vertex Covers in H-Free Graphs. CoRR abs/2307.05701 (2023) - [i6]Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen:
The Parameterised Complexity of Integer Multicommodity Flow. CoRR abs/2310.05784 (2023) - 2022
- [c4]Jelle J. Oostveen
Parameterized Complexity of Streaming Diameter and Connectivity Problems. IPEC 2022: 24:1-24:16 - [c3]Sujoy Bhore
On Streaming Algorithms for Geometric Independent Set and Clique. WAOA 2022: 211-224 - [i5]Sujoy Bhore, Fabian Klute, Jelle J. Oostveen:
On Streaming Algorithms for Geometric Independent Set and Clique. CoRR abs/2207.01108 (2022) - [i4]Jelle J. Oostveen, Erik Jan van Leeuwen:
Parameterized Complexity of Streaming Diameter and Connectivity Problems. CoRR abs/2207.04872 (2022) - [i3]Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey
Complexity Framework For Forbidden Subgraphs. CoRR abs/2211.12887 (2022) - 2021
- [c2]Jelle J. Oostveen, Erik Jan van Leeuwen:
Streaming Deletion Problems Parameterized by Vertex Cover. FCT 2021: 413-426 - [i2]Jelle J. Oostveen, Erik Jan van Leeuwen:
Streaming Deletion Problems Parameterized by Vertex Cover. CoRR abs/2111.10184 (2021)
2010 – 2019
- 2019
- [c1]I. S. W. B. Prasetya
Having fun in learning formal specifications. ICSE (SEET) 2019: 192-196 - [i1]I. S. W. B. Prasetya, Craig Q. H. D. Leek, Orestis Melkonian, Joris ten Tusscher, Jan van Bergen, J. M. Everink, Thomas van der Klis, Petar Kostic, Rick Meijerink, Roan Oosenbrug, Jelle J. Oostveen, Tijmen van den Pol, Mike de Vries, Wink M. van Zon:
Having Fun in Learning Formal Specifications. CoRR abs/1903.00334 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: