Dit overzicht toont een aantal van mijn publicaties sinds 2017. Voor een volledig overzicht van al mijn publicaties verwijs ik naar mijn homepage, naar DBLP, of naar Google Scholar.
Publicaties
2025
Wetenschappelijke publicaties
Johnson, M., Martin, B., Oostveen, J. J., Pandey, S., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2025). Complexity Framework for Forbidden Subgraphs I: The Framework. Algorithmica, Article 106121. Advance online publication. https://doi.org/10.1007/s00453-024-01289-2
2024
Wetenschappelijke publicaties
Lozin, V., Martin, B., Pandey, S., Paulusma, D., Siggers, M., Smith, S., & van Leeuwen, E. J. (2024). Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. In 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Vol. 322, pp. 47:1-47:18). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.ISAAC.2024.47 https://research-portal.uu.nl/ws/files/247855872/LIPIcs.ISAAC.2024.47.pdf
Feldmann, A. E., Mukherjee, A., & van Leeuwen, E. J. (2025). The parameterized complexity of the survivable network design problem. Journal of Computer and System Sciences, 148, Article 103604. Advance online publication. https://doi.org/10.1016/j.jcss.2024.103604
Bodlaender, H. L., Johnson, M. S., Martin, B., Oostveen, J., Pandey, S., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2024). Complexity Framework for Forbidden Subgraphs {IV:} The Steiner Forest Problem. In Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings (pp. 206-217). (Lecture Notes in Computer Science; Vol. 14764). Springer. https://doi.org/10.1007/978-3-031-63021-7_16 https://research-portal.uu.nl/ws/files/232196795/978-3-031-63021-7_16.pdf
Kisfaludi-Bak, S., Masarìkovà, J., van Leeuwen, E. J., Walczak, B., & Wegrzycki, K. (2024). Separator Theorem and Algorithms for Planar Hyperbolic Graphs. In W. Mulzer, & J. M. Phillips (Eds.), 40th International Symposium on Computational Geometry, SoCG 2024 (pp. 67:1-67:17). Article 67 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 293). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.SOCG.2024.67 https://research-portal.uu.nl/ws/files/232197029/LIPIcs.SoCG.2024.67.pdf
Johnson, M., Martin, B., Pandey, S., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2024). Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. In H. L. Bodlaender (Ed.), 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024 (pp. 29:1-29:17). Article 29 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 294). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.SWAT.2024.29 https://research-portal.uu.nl/ws/files/232195634/LIPIcs.SWAT.2024.29.pdf
Bergougnoux, B., Chekan, V., Ganian, R., Kanté, M. M., Mnich, M., Oum, S., Pilipczuk, M., & van Leeuwen, E. J. (2023). Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. In 31st Annual European Symposium on Algorithms, {ESA} 2023, September 4-6, 2023, Amsterdam, The Netherlands (Vol. 274, pp. 18:1-18:18). (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ESA.2023.18 https://research-portal.uu.nl/ws/files/232197449/LIPIcs.ESA.2023.18.pdf
Mannens, I., Oostveen, J., van Leeuwen, E. J., Pandey, S., & Bodlaender, H. L. (2023). The Parameterised Complexity Of Integer Multicommodity Flow. In N. Misra, & M. Wahlström (Eds.), 18th International Symposium on Parameterized and Exact Computation (IPEC 2023) (pp. 91-109). Article 6 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 285). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2023.6 https://dspace.library.uu.nl/bitstream/handle/1874/436469/LIPIcs.IPEC.2023.6.pdf?sequence=1
Johnson, M., Martin, B., Pandey, S., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2023). Complexity Framework for Forbidden Subgraphs {III:}: When Problems Are Tractable on Subcubic Graphs. In J. Leroux, S. Lombardy, & D. Peleg (Eds.), 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023: MFCS 2023, August 28 to September 1, 2023, Bordeaux, France (pp. 57:1-57:15). Article 57 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 272). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2023.57 https://dspace.library.uu.nl/bitstream/handle/1874/431614/LIPIcs-MFCS-2023-57.pdf?sequence=1
Bergougnoux, B., Chekan, V., Ganian, R., Kanté, M. M., Mnich, M., Oum, S., Pilipczuk, M., & van Leeuwen, E. J. (2023). Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. In I. Li Gortz, M. Farach-Colton, S. J. Puglisi, & G. Herman (Eds.), 31st Annual European Symposium on Algorithms, ESA 2023: ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands (pp. 18:1-18:18). Article 18 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 274). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2023.18 https://dspace.library.uu.nl/bitstream/handle/1874/431814/LIPIcs-ESA-2023-18.pdf?sequence=1
Martin, B., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2022). Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. In M. A. Bekos, & M. Kaufmann (Eds.), Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tubingen, Germany, June 22-24, 2022, Revised Selected Papers (pp. 398-411). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13453 LNCS). Springer. https://doi.org/10.1007/978-3-031-15914-5_29 https://dspace.library.uu.nl/bitstream/handle/1874/425269/978_3_031_15914_5_29.pdf?sequence=1
Johnson, M., Paulusma, D., & Leeuwen, E. J. V. (2021). What Graphs are 2-Dot Product Graphs?International Journal of Computational Geometry and Applications, 31(1), 1-16. https://doi.org/10.1142/S0218195921500011
Lima, P. T., van Leeuwen, E. J., & van der Wegen, M. (2020). Algorithms for the rainbow vertex coloring problem on graph classes. In J. Esparza, & D. Kral (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) (pp. 63:1--63:13). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 170). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2020.63 https://dspace.library.uu.nl/bitstream/handle/1874/414822/LIPIcs_MFCS_2020_63.pdf?sequence=1
Fomin, F. V., Kratsch, S., & van Leeuwen, E. J. (2020). Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday. (Lecture Notes in Computer Science; Vol. 12160). Springer. https://doi.org/10.1007/978-3-030-42071-0
Novotná, J., Okrasa, K., Pilipczuk, M., Rzążewski, P., van Leeuwen, E. J., & Walczak, B. (2019). Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. In B. M. P. Jansen, & J. A. Telle (Eds.), 14th International Symposium on Parameterized and Exact Computation: IPEC 2019, September 11-13, 2019, Munich, Germany Article 23 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 148). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.IPEC.2019.23 https://research-portal.uu.nl/ws/files/235747402/LIPIcs.IPEC.2019.23.pdf
Jansen, B. M. P., Pilipczuk, M., & van Leeuwen, E. J. (2019). A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. In R. Niedermeier, & C. Paul (Eds.), 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany (pp. 39:1-39:18). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 126). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.STACS.2019.39 https://dspace.library.uu.nl/bitstream/handle/1874/385021/LIPIcs_STACS_2019_39_1_.pdf?sequence=1
Mnich, M., & van Leeuwen, E. J. (2017). Polynomial kernels for deletion to classes of acyclic digraphs. Discrete Optimization, 25, 48-76. https://doi.org/10.1016/j.disopt.2017.02.002
Diaz, J., Pottonen, O., Serna, M., & van Leeuwen, E. J. (2017). Complexity of metric dimension on planar graphs. Journal of Computer and System Sciences, 83(1), 132-158. https://doi.org/10.1016/j.jcss.2016.06.006
Pilipczuk, M., van Leeuwen, E. J., & Wiese, A. (2017). Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. In K. G. Larsen, H. L. Bodlaender, & J.-F. Raskin (Eds.), Mathematical Foundations of Computer Science 2017: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) proceedings (pp. 1-13). Article 42 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 83). https://doi.org/10.4230/LIPIcs.MFCS.2017.42 https://dspace.library.uu.nl/bitstream/handle/1874/360586/LIPIcs_MFCS_2017_42.pdf?sequence=1