default search action
Johan M. M. van Rooij
Person information
- affiliation: Universiteit Utrecht, Department of Information and Computing Sciences
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j9]Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk:
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. ACM Trans. Algorithms 18(2): 17:1-17:31 (2022) - 2021
- [c18]Johan M. M. van Rooij:
A Generic Convolution Algorithm for Join Operations on Tree Decompositions. CSR 2021: 435-459 - 2020
- [c17]Johan M. M. van Rooij:
Fast Algorithms for Join Operations on Tree Decompositions. Treewidth, Kernels, and Algorithms 2020: 262-297 - [i6]Johan M. M. van Rooij:
Fast Algorithms for Join Operations on Tree Decompositions. CoRR abs/2006.01588 (2020)
2010 – 2019
- 2019
- [c16]Sebastiaan B. van Rooij, Johan M. M. van Rooij:
Algorithms and Complexity Results for the Capacitated Vertex Cover Problem. SOFSEM 2019: 473-489 - 2018
- [i5]Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle:
Fast Dynamic Programming on Graph Decompositions. CoRR abs/1806.01667 (2018) - 2016
- [j8]Hans L. Bodlaender, Johan M. M. van Rooij:
Exact Algorithms for Intervalizing Coloured Graphs. Theory Comput. Syst. 58(2): 273-286 (2016) - [c15]Willem J. A. Pino, Hans L. Bodlaender, Johan M. M. van Rooij:
Cut and Count and Representative Sets on Branch Decompositions. IPEC 2016: 27:1-27:12 - 2014
- [j7]Jesper Nederlof, Johan M. M. van Rooij, Thomas C. van Dijk:
Inclusion/Exclusion Meets Measure and Conquer. Algorithmica 69(3): 685-740 (2014) - 2013
- [j6]Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender:
Partition Into Triangles on Bounded Degree Graphs. Theory Comput. Syst. 52(4): 687-718 (2013) - 2012
- [j5]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Fast Algorithms for max independent set. Algorithmica 62(1-2): 382-415 (2012) - [j4]Johan M. M. van Rooij, Hans L. Bodlaender:
Exact Algorithms for Edge Domination. Algorithmica 64(4): 535-563 (2012) - 2011
- [j3]Johan M. M. van Rooij, Hans L. Bodlaender:
Exact algorithms for dominating set. Discret. Appl. Math. 159(17): 2147-2164 (2011) - [j2]Daniël Paulusma, Johan M. M. van Rooij:
On partitioning a graph into two connected subgraphs. Theor. Comput. Sci. 412(48): 6761-6769 (2011) - [c14]Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk:
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. FOCS 2011: 150-159 - [c13]Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender:
Partition into Triangles on Bounded Degree Graphs. SOFSEM 2011: 558-569 - [c12]Hans L. Bodlaender, Johan M. M. van Rooij:
Exact Algorithms for Intervalizing Colored Graphs. TAPAS 2011: 45-56 - [i4]Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk:
Solving connectivity problems parameterized by treewidth in single exponential time. CoRR abs/1103.0534 (2011) - 2010
- [j1]Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij:
Computing role assignments of chordal graphs. Theor. Comput. Sci. 411(40-42): 3601-3613 (2010) - [c11]Johan M. M. van Rooij:
Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number. CIAC 2010: 73-84 - [c10]Jesper Nederlof, Johan M. M. van Rooij:
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting. IPEC 2010: 204-215 - [c9]Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle:
Faster Algorithms on Branch and Clique Decompositions. MFCS 2010: 174-185 - [c8]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
A Bottom-Up Method and Fast Algorithms for max independent set. SWAT 2010: 62-73 - [c7]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n). TAMC 2010: 373-384
2000 – 2009
- 2009
- [c6]Johan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk:
Inclusion/Exclusion Meets Measure and Conquer. ESA 2009: 554-565 - [c5]Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith:
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. ESA 2009: 566-577 - [c4]Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij:
Computing Role Assignments of Chordal Graphs. FCT 2009: 193-204 - [c3]Daniël Paulusma, Johan M. M. van Rooij:
On Partitioning a Graph into Two Connected Subgraphs. ISAAC 2009: 1215-1224 - [i3]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree. CoRR abs/0901.1563 (2009) - 2008
- [c2]Johan M. M. van Rooij, Hans L. Bodlaender:
Exact Algorithms for Edge Domination. IWPEC 2008: 214-225 - [c1]Johan M. M. van Rooij, Hans L. Bodlaender:
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. STACS 2008: 657-668 - [i2]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan M. M. van Rooij, Ryan Williams:
08431 Open Problems - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms 2008 - [i1]Johan M. M. van Rooij, Hans L. Bodlaender:
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. CoRR abs/0802.2827 (2008)
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-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint