Johan M. M. van Rooij

Publication Activity (10 Years)

Years Active: 2008-2022
Publications (10 Years): 8

Top Topics

Join Operations

Tree Decompositions

Computational Complexity

Top Venues

Theory Comput. Syst.

Publications

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) (2022)
Johan M. M. van Rooij
A Generic Convolution Algorithm for Join Operations on Tree Decompositions. CSR (2021)
Johan M. M. van Rooij
Fast Algorithms for Join Operations on Tree Decompositions. Treewidth, Kernels, and Algorithms (2020)
Johan M. M. van Rooij
Fast Algorithms for Join Operations on Tree Decompositions. CoRR (2020)
Sebastiaan B. van Rooij, Johan M. M. van Rooij
Algorithms and Complexity Results for the Capacitated Vertex Cover Problem. SOFSEM (2019)
Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle
Fast Dynamic Programming on Graph Decompositions. CoRR (2018)
Hans L. Bodlaender, Johan M. M. van Rooij
Exact Algorithms for Intervalizing Coloured Graphs. Theory Comput. Syst. 58 (2) (2016)
Willem J. A. Pino, Hans L. Bodlaender, Johan M. M. van Rooij
Cut and Count and Representative Sets on Branch Decompositions. IPEC (2016)
Jesper Nederlof, Johan M. M. van Rooij, Thomas C. van Dijk
Inclusion/Exclusion Meets Measure and Conquer. Algorithmica 69 (3) (2014)
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) (2013)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
Fast Algorithms for max independent set. Algorithmica 62 (1-2) (2012)
Johan M. M. van Rooij, Hans L. Bodlaender
Exact Algorithms for Edge Domination. Algorithmica 64 (4) (2012)
Johan M. M. van Rooij, Hans L. Bodlaender
Exact algorithms for dominating set. Discret. Appl. Math. 159 (17) (2011)
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)
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 (2011)
Daniël Paulusma, Johan M. M. van Rooij
On partitioning a graph into two connected subgraphs. Theor. Comput. Sci. 412 (48) (2011)
Hans L. Bodlaender, Johan M. M. van Rooij
Exact Algorithms for Intervalizing Colored Graphs. TAPAS (2011)
Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender
Partition into Triangles on Bounded Degree Graphs. SOFSEM (2011)
Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle
Faster Algorithms on Branch and Clique Decompositions. MFCS (2010)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
){\mathcal O}(1.08537^n). TAMC (2010)
Johan M. M. van Rooij
Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number. CIAC (2010)
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)
Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij
Computing role assignments of chordal graphs. Theor. Comput. Sci. 411 (40-42) (2010)
Jesper Nederlof, Johan M. M. van Rooij
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting. IPEC (2010)
Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. ESA (2009)
Johan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk
Inclusion/Exclusion Meets Measure and Conquer. ESA (2009)
Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij
Computing Role Assignments of Chordal Graphs. FCT (2009)
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 (2009)
Daniël Paulusma, Johan M. M. van Rooij
On Partitioning a Graph into Two Connected Subgraphs. ISAAC (2009)
Johan M. M. van Rooij, Hans L. Bodlaender
Exact Algorithms for Edge Domination. IWPEC (2008)
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)
Johan M. M. van Rooij, Hans L. Bodlaender
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set CoRR (2008)
Johan M. M. van Rooij, Hans L. Bodlaender
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. STACS (2008)