Johan M. M. van Rooij

Laurens van Remortele

INFORMS J. Appl. Anal., 2025

2021

A Generic Convolution Algorithm for Join Operations on Tree Decompositions.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2021

2020

Fast Algorithms for Join Operations on Tree Decompositions.

[BibT_eX]

[DOI]

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

Algorithms and Complexity Results for the Capacitated Vertex Cover Problem.

[BibT_eX]

[DOI]

Sebastiaan B. van Rooij

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

2018

Fast Dynamic Programming on Graph Decompositions.

[BibT_eX]

[DOI]

CoRR, 2018

2016

Exact Algorithms for Intervalizing Coloured Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

Cut and Count and Representative Sets on Branch Decompositions.

[BibT_eX]

[DOI]

Willem J. A. Pino

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2012

Fast Algorithms for max independent set.

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

Exact algorithms for dominating set.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Exact Algorithms for Intervalizing Colored Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Partition into Triangles on Bounded Degree Graphs.

[BibT_eX]

[DOI]

Marcel E. van Kooten Niekerk

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.

[BibT_eX]

[DOI]

Jakub Onufry Wojtaszczyk

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n).

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

A Bottom-Up Method and Fast Algorithms for max independent set.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Faster Algorithms on Branch and Clique Decompositions.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

Martin Vatshelle

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting.

[BibT_eX]

[DOI]

Jesper Nederlof

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Fast Algorithms for Max Independent Set in Graphs of Small Average Degree

[BibT_eX]

[DOI]

CoRR, 2009

On Partitioning a Graph into Two Connected Subgraphs.

[BibT_eX]

[DOI]

Daniël Paulusma

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Computing Role Assignments of Chordal Graphs.

[BibT_eX]

[DOI]

Pim van 't Hof

Daniël Paulusma

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Inclusion/Exclusion Meets Measure and Conquer.

[BibT_eX]

[DOI]

Jesper Nederlof

Thomas C. van Dijk

Proceedings of the Algorithms, 2009

Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution.

[BibT_eX]

[DOI]

Peter Rossmanith

Proceedings of the Algorithms, 2009

2008

Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, 2008

Exact Algorithms for Edge Domination.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

08431 Open Problems - Moderately Exponential Time Algorithms.

[BibT_eX]

[DOI]