Highlighted publications
van Rooij, J. M. M., & 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 (pp. 566-577). Springer.
van Rooij, J. M. M., & Bodlaender, H. L. (2011). Exact algorithms for dominating set. Discrete Applied Mathematics, 159, 2147-2164.
Cygan, M., Nederlof, J., Pilipczuk, M., van Rooij, J. M. M., & 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.
Nederlof, J., van Rooij, J. M. M., & van Dijk, T. C. (2014). Inclusion/Exclusion Meets Measure and Conquer. Algorithmica, 1-56. https://doi.org/10.1007/s00453-013-9759-2
Publications
2021
Scholarly publications
van Rooij, J. (2021). A Generic Convolution Algorithm for Join Operations on Tree Decompositions. In R. Santhanam, & D. Musatov (Eds.), CSR 2021: Computer Science – Theory and Applications (pp. 435-459). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12730 LNCS). Springer. https://doi.org/10.1007/978-3-030-79416-3_27
2020
Scholarly publications
van Rooij, J. M. M. (2020). Fast Algorithms for Join Operations on Tree Decompositions. In F. V. Fomin, S. Kratsch, & E. J. van Leeuwen (Eds.), Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday (pp. 262-297 ). (LNCS; Vol. 12160). Springer. https://doi.org/10.1007/978-3-030-42071-0_18
2019
Scholarly publications
van Rooij, J. M. M., & van Rooij, S. B. (2019). Algorithms and Complexity Results for the Capacitated Vertex Cover Problem. In SOFSEM 2019: Theory and Practice of Computer Science (pp. 473-289). (LNCS; Vol. 11376). SPRING. https://doi.org/10.1007/978-3-030-10801-4_37
2018
Professional publications
van Rooij, J. M. M., & van den Broek, H. (2018). Veilige en efficiënte inspectie van het spoor. STAtOR, 3, 8. [2].
https://dspace.library.uu.nl/bitstream/handle/1874/374333/STAtOR_2018_3_8_11_vRooijvdBroek.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/374333/STAtOR_2018_3_8_11_vRooijvdBroek.pdf?sequence=1
2017
Scholarly publications
Pino, W. J. A., Bodlaender, H. L., & Van Rooij, J. M. M. (2017). Cut and Count and representative sets on branch decompositions. In 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 (Vol. 63). [27] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.IPEC.2016.27
2016
Scholarly publications
Bodlaender, H. L., & van Rooij, J. M. M. (2016). Exact Algorithms for Intervalizing Coloured Graphs. Theory of Computing Systems, 58(2), 273-286. https://doi.org/10.1007/s00224-015-9616-6
2014
Scholarly publications
Nederlof, J., van Rooij, J. M. M., & van Dijk, T. C. (2014). Inclusion/Exclusion Meets Measure and Conquer. Algorithmica, 1-56. https://doi.org/10.1007/s00453-013-9759-2
2013
Scholarly publications
van Rooij, J. M. M., Bodlaender, H. L., & van Kooten Niekerk, M. E. (2013). Partition Into Triangles on Bounded Degree Graphs. Theory of Computing Systems, 52(4), 687-718. https://doi.org/10.1007/s00224-012-9412-5
2012
Scholarly publications
van Rooij, J. M. M., & Bodlaender, H. L. (2012). Exact Algorithms for Edge Domination. Algorithmica, 64(4), 535-564. https://doi.org/10.1007/s00453-011-9546-x
Bourgeois, N., Escoffier, B., Paschos, V. T., & van Rooij, J. M. M. (2012). Fast Algorithms for max independent set. Algorithmica, 62(1-2), 382-415.
2011
Scholarly publications
Cygan, M., Nederlof, J., Pilipczuk, M., van Rooij, J. M. M., & 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.
van Rooij, J. M. M., van Kooten Niekerk, M. E., & 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 (Eds.), SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science (pp. 558-569). Springer.
Bodlaender, H. L., & van Rooij, J. M. M. (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 (pp. 45-56). Springer.
van Rooij, J. M. M. (2011). Exact Exponential-Time Algorithms for Domination Problems in Graphs. [Doctoral thesis 1 (Research UU / Graduation UU), Utrecht University]. BOXpress.
https://dspace.library.uu.nl/bitstream/handle/1874/205442/rooij.pdf?sequence=2
https://dspace.library.uu.nl/bitstream/handle/1874/205442/rooij.pdf?sequence=2
van Rooij, J. M. M., & Bodlaender, H. L. (2011). Exact algorithms for dominating set. Discrete Applied Mathematics, 159, 2147-2164.
Paulusma, D., & van Rooij, J. M. M. (2011). On partitioning a graph into two connected subgraphs. Theoretical Computer Science, 412(48), 6761-6769.
2010
Scholarly publications
van Hof, P., Paulusma, D., & van Rooij, J. M. M. (2010). Computing Role Assignments of Chordal Graphs. Theoretical Computer Science, 411(40-42), 3601-3613.
van Rooij, J. M. M. (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.
Bodlaender, H. L., & van Rooij, J. M. M. (2010). Exact algorithms for Intervalizing Colored Graphs. Department of Information and Computing Sciences, Utrecht University.
Bodlaender, H. L., van Leeuwen, E. J., & van Rooij, J. M. M. (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 (pp. 174-185). Springer.
Nederlof, J., & van Rooij, J. M. M. (2010). Inclusion/Exclusion Branching For Partial Dominating Set and Set Splitting. In V. Raman, & S. S. (Eds.), 5th International Symposium on Parameterized and Exact Computation, IPEC 2010 (pp. 204-215). Springer.
Bourgeois, N., Escoffier, B., Paschos, V. T., & van Rooij, J. M. M. (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.
Bourgeois, N., Escoffier, B., Paschos, V. T., & van Rooij, J. M. M. (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.
van Rooij, J. M. M., van Kooten Niekerk, M. E., & 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.
2009
Scholarly publications
van Rooij, J. M. M., Nederlof, J., & van Dijk, T. C. (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. http://www.springerlink.com/content/x1034424j70m3036/?p=d16fc08e351c44c68c06e7d41c148ada&pi=49
Paulusma, D., & van Rooij, J. M. M. (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. http://www.springerlink.com/content/u8740k7046427403/?p=235f667c08634c6b819d753f2b323d23&pi=121
van Hof, P., Paulusma, D., & van Rooij, J. M. M. (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. http://www.springerlink.com/content/t27748520v12tl44/?p=918b2288d34c48779e53f54613a0ec44&pi=17
van Rooij, J. M. M., & 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 (pp. 566-577). Springer.
van Rooij, J. M. M., & Bodlaender, H. L. (2009). Design by Measure and Conquer: A faster exact algorithm for dominating set. UU BETA ICS Departement Informatica.
2008
Scholarly publications
van Rooij, J. M. M., & 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). Springer.
van Rooij, J. M. M., & 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 (pp. 657-668). Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI).
Bourgeois, N., Escoffier, B., Paschos, V. T., & van Rooij, J. M. M. (2008). Fast Algorithms for Max Independent Set in Graphs of Small Average Degree. Université Paris- Dauphine. http://www.lamsade.dauphine.fr/FILES/publi967.pdf
van Rooij, J. M. M., Nederhof, A. J., & van Dijk, T. C. (2008). Inclusion/Exclusion Meets Measure and Conquer: Exact algorithms for counting dominating sets. (UU-CS ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2008-043.html
2007
Scholarly publications
van Rooij, J. M. M., & Bodlaender, H. L. (2007). Exact algorithms for Edge Domination. (CS-UU ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2007-051.html