Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM Van Rooij, ...
ACM Transactions on Algorithms (TALG) 18 (2), 1-31, 2022
343 * 2022 Dynamic programming on tree decompositions using generalised fast subset convolution JMM Van Rooij, HL Bodlaender, P Rossmanith
European Symposium on Algorithms, 566-577, 2009
163 2009 Exact algorithms for dominating set JMM Van Rooij, HL Bodlaender
Discrete Applied Mathematics 159 (17), 2147-2164, 2011
146 * 2011 Fast algorithms for max independent set N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij
Algorithmica 62 (1), 382-415, 2012
106 * 2012 Inclusion/exclusion meets measure and conquer J Nederlof, JMM van Rooij, TC van Dijk
Algorithmica 69 (3), 685-740, 2014
100 * 2014 Exact algorithms for edge domination JMM van Rooij, HL Bodlaender
Algorithmica 64 (4), 535-563, 2012
48 * 2012 Partition into triangles on bounded degree graphs JMM van Rooij, ME van Kooten Niekerk, HL Bodlaender
Theory of Computing Systems 52 (4), 687-718, 2013
46 2013 Open Problems in Parameterized and Exact Computation - IWPEC 2008 HL Bodlaender, ED Demaine, MR Fellows, J Guo, D Hermelin, ...
Utrecht University Technical Reports, 2008
36 2008 Exact exponential-time algorithms for domination problems in graphs JMM van Rooij
BOXpress, 2011
29 2011 Faster algorithms on branch and clique decompositions HL Bodlaender, EJ Leeuwen, JMM Van Rooij, M Vatshelle
International Symposium on Mathematical Foundations of Computer Science, 174-185, 2010
28 2010 Inclusion/exclusion branching for partial dominating set and set splitting J Nederlof, JMM van Rooij
International Symposium on Parameterized and Exact Computation, 204-215, 2010
17 2010 Maximum Independent Set in Graphs of Average Degree at Most Three in N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij
International Conference on Theory and Applications of Models of Computation …, 2010
16 2010 Computing role assignments of chordal graphs P van’t Hof, D Paulusma, JMM van Rooij
Theoretical computer science 411 (40-42), 3601-3613, 2010
14 2010 08431 Open Problems--Moderately Exponential Time Algorithms FV Fomin, K Iwama, D Kratsch, P Kaski, M Koivisto, L Kowalik, Y Okamoto, ...
Dagstuhl Seminar Proceedings, 2008
13 2008 Exact algorithms for intervalizing coloured graphs HL Bodlaender, JMM van Rooij
Theory of Computing Systems 58 (2), 273-286, 2016
11 * 2016 On partitioning a graph into two connected subgraphs D Paulusma, JMM van Rooij
Theoretical computer science 412 (48), 6761-6769, 2011
11 2011 Polynomial space algorithms for counting dominating sets and the domatic number JMM van Rooij
International Conference on Algorithms and Complexity, 73-84, 2010
10 2010 Cut and Count and Representative Sets on Branch Decompositions WJA Pino, HL Bodlaender, JMM van Rooij
11th International Symposium on Parameterized and Exact Computation (IPEC …, 2017
6 2017 Moderately exponential time algorithms FV Fomin, K Iwama, D Kratsch, P Kaski, M Koivisto, L Kowalik, Y Okamoto, ...
Dagstuhl seminar, 2008
5 2008 A Generic Convolution Algorithm for Join Operations on Tree Decompositions JMM van Rooij
International Computer Science Symposium in Russia, 435-459, 2021
4 * 2021 
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityAdresse e-mail validée de uu.nl
