Johan M. M. van Rooij

34 papers A* 1A 3B 7C 2Misc 1Journal 15Unranked 5
YearRankTypeTitle / Venue / Authors
2025 J jnl
Optimizing Mobility for Elderly and Disabled Dutch Citizens Using Taxis.
INFORMS J. Appl. Anal.
Frans J. C. T. de Ruiter, Johan M. M. van Rooij, Peter Hulsen, Bart Post, Jeroen Goes, Geert Teeuwen, Matthijs Tijink, Bart Verberne, Niels Bourgonjen, Roelf Nienhuis, Tjeerd van der Poel, Laurens van Remortele
2022 J jnl
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.
ACM Trans. Algorithms
Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
2021 Misc conf
A Generic Convolution Algorithm for Join Operations on Tree Decompositions.
CSR
Johan M. M. van Rooij
2020 — conf
Fast Algorithms for Join Operations on Tree Decompositions.
Treewidth, Kernels, and Algorithms
Johan M. M. van Rooij
2020 J jnl
Fast Algorithms for Join Operations on Tree Decompositions.
CoRR
Johan M. M. van Rooij
2019 B conf
Algorithms and Complexity Results for the Capacitated Vertex Cover Problem.
SOFSEM
Sebastiaan B. van Rooij, Johan M. M. van Rooij
2018 J jnl
Fast Dynamic Programming on Graph Decompositions.
CoRR
Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle
2016 B conf
Cut and Count and Representative Sets on Branch Decompositions.
IPEC
Willem J. A. Pino, Hans L. Bodlaender, Johan M. M. van Rooij
2016 J jnl
Exact Algorithms for Intervalizing Coloured Graphs.
Theory Comput. Syst.
Hans L. Bodlaender, Johan M. M. van Rooij
2014 J jnl
Inclusion/Exclusion Meets Measure and Conquer.
Algorithmica
Jesper Nederlof, Johan M. M. van Rooij, Thomas C. van Dijk
2013 J jnl
Partition Into Triangles on Bounded Degree Graphs.
Theory Comput. Syst.
Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender
2012 J jnl
Exact Algorithms for Edge Domination.
Algorithmica
Johan M. M. van Rooij, Hans L. Bodlaender
2012 J jnl
Fast Algorithms for max independent set.
Algorithmica
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2011 — conf
Exact Algorithms for Intervalizing Colored Graphs.
TAPAS
Hans L. Bodlaender, Johan M. M. van Rooij
2011 J jnl
Exact algorithms for dominating set.
Discret. Appl. Math.
Johan M. M. van Rooij, Hans L. Bodlaender
2011 J jnl
On partitioning a graph into two connected subgraphs.
Theor. Comput. Sci.
Daniël Paulusma, Johan M. M. van Rooij
2011 B conf
Partition into Triangles on Bounded Degree Graphs.
SOFSEM
Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender
2011 A* conf
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.
FOCS
Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
2011 J jnl
Solving connectivity problems parameterized by treewidth in single exponential time
CoRR
Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
2010 — conf
A Bottom-Up Method and Fast Algorithms for max independent set.
SWAT
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2010 J jnl
Computing role assignments of chordal graphs.
Theor. Comput. Sci.
Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij
2010 B conf
Faster Algorithms on Branch and Clique Decompositions.
MFCS
Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle
2010 B conf
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting.
IPEC
Jesper Nederlof, Johan M. M. van Rooij
2010 C conf
Maximum Independent Set in Graphs of Average Degree at Most Three in
TAMC
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2010 C conf
Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number.
CIAC
Johan M. M. van Rooij
2009 B conf
Computing Role Assignments of Chordal Graphs.
FCT
Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij
2009 A conf
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution.
ESA
Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith
2009 J jnl
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree
CoRR
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2009 A conf
Inclusion/Exclusion Meets Measure and Conquer.
ESA
Johan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk
2009 B conf
On Partitioning a Graph into Two Connected Subgraphs.
ISAAC
Daniël Paulusma, Johan M. M. van Rooij
2008 — conf
08431 Open Problems - Moderately Exponential Time Algorithms.
Moderately Exponential Time Algorithms
Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan M. M. van Rooij, Ryan Williams
2008 J jnl
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
CoRR
Johan M. M. van Rooij, Hans L. Bodlaender
2008 A conf
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set.
STACS
Johan M. M. van Rooij, Hans L. Bodlaender
2008 — conf
Exact Algorithms for Edge Domination.
IWPEC
Johan M. M. van Rooij, Hans L. Bodlaender