| 2021 | CSR | A Generic Convolution Algorithm for Join Operations on Tree Decompositions. | Johan M. M. van Rooij |
| 2019 | SOFSEM | Algorithms and Complexity Results for the Capacitated Vertex Cover Problem. | Sebastiaan B. van Rooij, Johan M. M. van Rooij |
| 2011 | FOCS | Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. | Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk |
| 2011 | SOFSEM | Partition into Triangles on Bounded Degree Graphs. | Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender |
| 2010 | CIAC | Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number. | Johan M. M. van Rooij |
| 2010 | MFCS | Faster Algorithms on Branch and Clique Decompositions. | Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle |
| 2010 | TAMC | Maximum Independent Set in Graphs of Average Degree at Most Three in | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
| 2009 | ESA | Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. | Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith |
| 2009 | ESA | Inclusion/Exclusion Meets Measure and Conquer. | Johan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk |
| 2009 | FCT | Computing Role Assignments of Chordal Graphs. | Pim van 't Hof, Danil Paulusma, Johan M. M. van Rooij |
| 2009 | ISAAC | On Partitioning a Graph into Two Connected Subgraphs. | Danil Paulusma, Johan M. M. van Rooij |
| 2008 | STACS | Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. | Johan M. M. van Rooij, Hans L. Bodlaender |