Volgen
Johan M. M. van Rooij
Johan M. M. van Rooij
Utrecht University (20%) and Valcon (80%)
Geverifieerd e-mailadres voor uu.nl
Titel
Geciteerd door
Geciteerd door
Jaar
Solving connectivity problems parameterized by treewidth in single exponential time
M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM van Rooij, ...
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 150-159, 2011
3632011
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution.
JMM Van Rooij, HL Bodlaender, P Rossmanith
ESA 5757, 566-577, 2009
1722009
Exact algorithms for dominating set
JMM Van Rooij, HL Bodlaender
Discrete Applied Mathematics 159 (17), 2147-2164, 2011
156*2011
Fast Algorithms for max independent set
N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij
Algorithmica 62, 382-415, 2012
111*2012
Inclusion/exclusion meets measure and conquer
J Nederlof, JMM van Rooij, TC van Dijk
Algorithmica 69, 685-740, 2014
104*2014
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
492013
Exact algorithms for edge domination
JMM van Rooij, HL Bodlaender
Algorithmica 64 (4), 535-563, 2012
48*2012
Open Problems in Parameterized and Exact Computation - IWPEC 2008
HL Bodlaender, ED Demaine, MR Fellows, J Guo, D Hermelin, ...
Utrecht University Technical Reports, 2008
382008
Exact exponential-time algorithms for domination problems in graphs
JMM van Rooij
BOXpress, 2011
322011
Faster algorithms on branch and clique decompositions
HL Bodlaender, EJ Van Leeuwen, JMM Van Rooij, M Vatshelle
Mathematical Foundations of Computer Science 2010: 35th International …, 2010
292010
Computing role assignments of chordal graphs
P van’t Hof, D Paulusma, JMM van Rooij
Theoretical computer science 411 (40-42), 3601-3613, 2010
162010
Inclusion/exclusion branching for partial dominating set and set splitting
J Nederlof, JMM van Rooij
Parameterized and Exact Computation: 5th International Symposium, IPEC 2010 …, 2010
162010
Maximum Independent Set in Graphs of Average Degree at Most Three in
N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij
Theory and Applications of Models of Computation: 7th Annual Conference …, 2010
162010
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
122008
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
112011
Polynomial space algorithms for counting dominating sets and the domatic number
JMM van Rooij
Algorithms and Complexity: 7th International Conference, CIAC 2010, Rome …, 2010
102010
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
92017
A generic convolution algorithm for join operations on tree decompositions
JMM van Rooij
Computer Science–Theory and Applications: 16th International Computer …, 2021
8*2021
Moderately exponential time algorithms
FV Fomin, K Iwama, D Kratsch, P Kaski, M Koivisto, L Kowalik, Y Okamoto, ...
Dagstuhl seminar, 2008
52008
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20