home	education	contact	library	calendar	search
	about us	research	people	archive	services	jobs

publications by dr. J.M.M. van Rooij

• Metis is a dutch, academic research information database
• see also: Metis for Departement Informatica
• please send notifications, questions, remarks etc to metis@cs.uu.nl
• see also : research -> Metis overviews

dr. J.M.M. van Rooij

• contact information
• my technical reports
• former member of group algorithmic systems

some publications

Rooij, J.M.M. van & Bodlaender, H.L. (2012). Exact Algorithms for Edge Domination. Algorithmica, 64(4), 535-564.

Bourgeois, N., Escoffier, B., Paschos, V.Th. & Rooij, J.M.M. van (2012). Fast Algorithms for max independent set. Algorithmica, 62(1-2), 382-415.

Rooij, J.M.M. van (2011, June 24). Exact Exponential-Time Algorithms for Domination Problems in Graphs. UU Universiteit Utrecht (384 pag.) (Oisterwijk: BOXPress). Prom./coprom.: prof. dr. J. van Leeuwen & dr. H.L. Bodlaender.

Rooij, J.M.M. van & Bodlaender, H.L. (2011). Exact algorithms for dominating set. Discrete Applied Mathematics, 159, 2147-2164.

Bodlaender, H.L. & Rooij, J.M.M. van (2011). Exact algorithms for intervalizing colored graphs. In A Marchetti-Spaccamela & M Segal (Eds.), Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems TAPAS 2011 Vol. 6595. Lecture Notes in Computer Science (pp. 45-56). Springer.

Paulusma, D. & Rooij, J.M.M. van (2011). On partitioning a graph into two connected subgraphs. Theoretical Computer Science, 412(48), 6761-6769.

Rooij, J.M.M. van, Kooten Niekerk, M.E. van & Bodlaender, H.L. (2011). Partition into Triangles on Bounded Degree Graphs. In I. Cerná, T. Gyimóthy, J. Hromkovic, K. Jeffery, R. Královic, M. Vukolic, S. Wolf & S. Wolf (Eds.), SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science Vol. 6543. Lecture Notes in Computer Science (pp. 558-569). Springer.

Cygan, M., Nederlof, J., Pilipczuk, M., Rooij, J.M.M. van & Wojtaszczyk, J.O. (2011). Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. In R. Ostrovsky (Ed.), Proceedings, 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011 (pp. 150-159). IEEE.

Bourgeois, N., Escoffier, B., Paschos, V.Th. & Rooij, J.M.M. van (2010). A Bottom-Up Method and Fast Algorithms for max independent set. In H. Kaplan (Ed.), 12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010 (pp. 62-73). Springer.

Hof, P. van, Paulusma, D. & Rooij, J.M.M. van (2010). Computing Role Assignments of Chordal Graphs. Theoretical Computer Science, 411(40-42), 3601-3613.

Bodlaender, H.L. & Rooij, J.M.M. van (2010). Exact algorithms for Intervalizing Colored Graphs. : Department of Information and Computing Sciences, Utrecht University.

Bodlaender, H.L., Leeuwen, E.J. van & Rooij, J.M.M. van (2010). Faster algorithms on branch and clique decompositions. In P. Hlineny & A. Kucera (Eds.), Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010 Vol. 6281. Lecture Notes in Computer Science (pp. 174-185). Berlin: Springer.

Nederlof, J. & Rooij, J.M.M. van (2010). Inclusion/Exclusion Branching For Partial Dominating Set and Set Splitting. In V. Raman & Saurabh S. (Eds.), 5th International Symposium on Parameterized and Exact Computation, IPEC 2010 (pp. 204-215). Springer.

Bourgeois, N., Escoffier, B., Paschos, V.Th. & Rooij, J.M.M. van (2010). Maximum Independent Set in Graphs of Average Degree at Most Three in $O(1.08537^n)$. In J. Kratochvíl, A. Li, J. Fiala & P. Kolman (Eds.), 7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010 (pp. 373-384). Springer.

Rooij, J.M.M. van, Kooten Niekerk, M.E. van & Bodlaender, H.L. (2010). Partitioning Sparse Graphs Into Triangles: Relations to exact satisfiability and very fast exponential time algorithms. : Department of Information and Computing Sciences, Utrecht University.

Rooij, J.M.M. van (2010). Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number. In T. Calamoneri & J. Díaz (Eds.), 7th International Conference on Algorithms and Complexity, CIAC 2010 (pp. 73-84). Springer.

Hof, P. van, Paulusma, D. & Rooij, J.M.M. van (2009). Computing Role Assignments of Chordal Graphs. In M. Kutylowski, W. Charatonik & M. G\c{e}bala (Eds.), Fundamentals of Computation Theory (pp. 193-204). Springer Berlin / Heidelberg.

Rooij, J.M.M. van & Bodlaender, H.L. (2009). Design by Measure and Conquer: A faster exact algorithm for dominating set. onbekend: UU BETA ICS Departement Informatica.

Rooij, J.M.M. van & Bodlaender, H.L. (2009). Dynamic programming on tree decompositions using generalised fast subset convolution. In A Fiat & P Sanders (Eds.), Proceedings of the 17th Annual European Symposium on Algorithms, ESA 2009 Vol. 5757. Lecture Notes in Computer Science (pp. 566-577). Berlin: Springer.

Rooij, J.M.M. van, Nederlof, J. & Dijk, T.C. van (2009). Inclusion/Exclusion Meets Measure and Conquer: Exact algorithms for counting dominating sets. In A. Fiat & P. Sanders (Eds.), Algorithms - ESA 2009 (pp. 554-565). Springer Berlin / Heidelberg.

Paulusma, D. & Rooij, J.M.M. van (2009). On Partitioning a Graph into Two Connected Subgraphs. In Y. Dong, D.-Z. Du & O.H. Ibarra (Eds.), Algorithms and Computation (pp. 1215-1224). Springer Berlin / Heidelberg.

Rooij, J.M.M. van & Bodlaender, H.L. (2008). Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. In S Albers & P. Weil (Eds.), Proceedings STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science Vol. 08001. Dagblad De Limburger (pp. 657-668). Schloss Dagstuhl, Germany: Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI).

Rooij, J.M.M. van & Bodlaender, H.L. (2008). Exact Algorithms for Edge Domination. In M Grohe & R. Niedermeier (Eds.), Proceedings Third International Workshop on Parameterized and Exact Computation, IWPEC 2008 (pp. 214-255). Berlin: Springer.

Bourgeois, N., Escoffier, B., Paschos, V.Th. & Rooij, J.M.M. van (2008). Fast Algorithms for Max Independent Set in Graphs of Small Average Degree. Paris: Université Paris- Dauphine.

Rooij, J.M.M. van, Nederhof, A.J. & Dijk, T.C. van (2008). Inclusion/Exclusion Meets Measure and Conquer: Exact algorithms for counting dominating sets. (UU-CS2008-43 ). onbekend: UU WINFI Informatica en Informatiekunde.

Rooij, J.M.M. van & Bodlaender, H.L. (2007). Exact algorithms for Edge Domination. (CS-UU2007-051 ). onbekend: UU WINFI Informatica en Informatiekunde.