Dr. E.J. (Erik Jan) van Leeuwen

Buys Ballotgebouw
Princetonplein 5
Kamer 4.71
3584 CC Utrecht

Dr. E.J. (Erik Jan) van Leeuwen

Universitair docent
Algorithms and Complexity
030 253 5432
e.j.vanleeuwen@uu.nl

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
Basavaraju, M., van Leeuwen, E. J., & Saei, R. (2024). Maximal induced matchings in K4-free and K5-free graphs. Discrete Applied Mathematics, 359, 407-418. https://doi.org/10.1016/j.dam.2024.09.027
https://research-portal.uu.nl/ws/files/242968858/1-s2.0-S0166218X24004177-main.pdf
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
Oostveen, J. J., & van Leeuwen, E. J. (2024). Parameterized Complexity of Streaming Diameter and Connectivity Problems. Algorithmica, 86(9), 2885-2928. https://doi.org/10.1007/s00453-024-01246-z
https://research-portal.uu.nl/ws/files/239104719/s00453-024-01246-z.pdf

2023

Wetenschappelijke publicaties

Brettell, N., Oostveen, J., Pandey, S., Paulusma, D., & van Leeuwen, E. J. (2023). Computing Subset Vertex Covers in H-Free Graphs. In Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings (pp. 88-102). (Lecture Notes in Computer Science; Vol. 14292). Springer. https://doi.org/10.1007/978-3-031-43587-4_7
https://research-portal.uu.nl/ws/files/232197632/978-3-031-43587-4_7.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
Martin, B., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2023). Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Algorithmica, 85(9), 2580-2604. https://doi.org/10.1007/S00453-023-01109-Z
https://research-portal.uu.nl/ws/files/232197174/s00453-023-01109-z.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
Oostveen, J., & van Leeuwen, E. J. (2023). Streaming deletion problems parameterized by vertex cover. Theoretical Computer Science, 979, 1-25. Article 114178. https://doi.org/10.1016/j.tcs.2023.114178
https://dspace.library.uu.nl/bitstream/handle/1874/431820/1-s2.0-S0304397523004917-main.pdf?sequence=1
Brettell, N., Oostveen, J., Pandey, S., Paulusma, D., & van Leeuwen, E. J. (2023). Computing Subset Vertex Covers in H-Free Graphs. arXiv. https://doi.org/10.48550/arXiv.2307.05701
https://dspace.library.uu.nl/bitstream/handle/1874/431577/2307.05701.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. arXiv. https://doi.org/10.48550/arXiv.2307.01285
https://dspace.library.uu.nl/bitstream/handle/1874/431818/2307.01285.pdf?sequence=1
Bodlaender, H. L., Johnson, M., Martin, B., Oostveen, J., Pandey, S., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2023). Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. arXiv. https://doi.org/10.48550/arXiv.2305.01613
https://dspace.library.uu.nl/bitstream/handle/1874/431612/2305.01613.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. arXiv. https://doi.org/10.48550/arXiv.2305.01104
https://dspace.library.uu.nl/bitstream/handle/1874/431613/2305.01104.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., & Leeuwen, E. J. V. (2023). Few induced disjoint paths for H-free graphs. Theoretical Computer Science, 939, 182-193. https://doi.org/10.1016/j.tcs.2022.10.024
https://dspace.library.uu.nl/bitstream/handle/1874/426588/1_s2.0_S030439752200620X_main.pdf?sequence=1

2022

Wetenschappelijke publicaties

Martin, B., Pandey, S., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2022). Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision. arXiv. https://doi.org/10.48550/arXiv.2211.14214
https://dspace.library.uu.nl/bitstream/handle/1874/431797/2211.14214v1.pdf?sequence=1
Oostveen, J., & van Leeuwen, E. J. (2022). Parameterized Complexity of Streaming Diameter and Connectivity Problems. arXiv. https://doi.org/10.48550/arXiv.2207.04872
https://dspace.library.uu.nl/bitstream/handle/1874/431872/2207.04872.pdf?sequence=1
Martin, B., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2022). Few Induced Disjoint Paths for H-Free Graphs. arXiv. https://doi.org/10.48550/arXiv.2203.03319
https://dspace.library.uu.nl/bitstream/handle/1874/431822/2203.03319.pdf?sequence=1
Johnson, M. S., Martin, B., Smith, S., Pandey, S., Paulusma, D., & van Leeuwen, E. J. (2022). Edge Multiway Cut and Node Multiway Cut are NP-complete on Subcubic Graphs. (pp. 1-13). arXiv. https://doi.org/10.48550/arXiv.2211.12203
https://dspace.library.uu.nl/bitstream/handle/1874/426435/2211.12203.pdf?sequence=1
Johnson, M. S., Martin, B., Oostveen, J., Pandey, S., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2022). Complexity Framework for Forbidden Subgraphs. arXiv. https://doi.org/10.48550/arXiv.2211.12887
https://dspace.library.uu.nl/bitstream/handle/1874/426551/2211.12887.pdf?sequence=1
Martin, B., Paulusma, D., Smith, S., & Leeuwen, E. J. V. (2022). Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. (pp. 1-24). arXiv. https://doi.org/10.48550/arXiv.2202.11595
https://dspace.library.uu.nl/bitstream/handle/1874/424823/2202.11595.pdf?sequence=1
Chandran, L. S., Issac, D., Lauri, J., & Leeuwen, E. J. V. (2022). Upper bounding rainbow connection number by forest number. Discrete Mathematics, 345(7), 112829. Article 112829. https://doi.org/10.1016/J.DISC.2022.112829
https://dspace.library.uu.nl/bitstream/handle/1874/425081/1_s2.0_S0012365X22000358_main.pdf?sequence=1
Martin, B., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2022). Few Induced Disjoint Paths for H-Free Graphs. In I. Ljubić, F. Barahona, S. S. Dey, & A. R. Mahjoub (Eds.), Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers (pp. 89-101). (Lecture Notes in Computer Science; Vol. 13526). Springer. https://doi.org/10.1007/978-3-031-18530-4_7
https://dspace.library.uu.nl/bitstream/handle/1874/425270/978_3_031_18530_4_7.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
Oostveen, J. J., & Leeuwen, E. J. V. (2022). Parameterized Complexity of Streaming Diameter and Connectivity Problems. In H. Dell, & J. Nederlof (Eds.), 17th International Symposium on Parameterized and Exact Computation (IPEC 2022) (pp. 24:1-24:16). Article 24 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 249). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.48550/arXiv.2207.04872, https://doi.org/10.4230/LIPIcs.IPEC.2022.24
https://dspace.library.uu.nl/bitstream/handle/1874/425130/LIPIcs_IPEC_2022_24.pdf?sequence=1
Feldmann, A. E., Mukherjee, A., & van Leeuwen, E. J. (2022). The Parameterized Complexity of the Survivable Network Design Problem. In K. Bringmann, & T. Chan (Eds.), Symposium on Simplicity in Algorithms (SOSA): 5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022 (pp. 37-56). SIAM. https://doi.org/10.1137/1.9781611977066.4
https://dspace.library.uu.nl/bitstream/handle/1874/420614/1.9781611977066.4.pdf?sequence=1
Pandey, S., & van Leeuwen, E. J. (2022). Planar Multiway Cut with Terminals on Few Faces. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022 (pp. 2032-2063). SIAM. https://doi.org/10.1137/1.9781611977073.81
https://dspace.library.uu.nl/bitstream/handle/1874/420613/1.9781611977073.81.pdf?sequence=1
Golovach, P. A., Paulusma, D., & Leeuwen, E. J. V. (2022). Induced Disjoint Paths in AT-free graphs. Journal of Computer and System Sciences, 124, 170-191. https://doi.org/10.1016/j.jcss.2021.10.003
https://dspace.library.uu.nl/bitstream/handle/1874/416034/1_s2.0_S0022000021001008_main.pdf?sequence=1
Kern, W., Martin, B., Paulusma, D., Smith, S., & Leeuwen, E. J. V. (2022). Disjoint paths and connected subgraphs for H-free graphs. Theoretical Computer Science, 898, 59-68. https://doi.org/10.1016/J.TCS.2021.10.019
https://dspace.library.uu.nl/bitstream/handle/1874/416033/1_s2.0_S0304397521006344_main.pdf?sequence=1

2021

Wetenschappelijke publicaties

Jansen, B. M. P., Pilipczuk, M., & Leeuwen, E. J. V. (2021). A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. SIAM Journal on Discrete Mathematics, 35(4), 2387-2429. https://doi.org/10.1137/20M1353782
https://dspace.library.uu.nl/bitstream/handle/1874/420511/20m1353782.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
Novotná, J., Okrasa, K., Pilipczuk, M., Rzazewski, P., Leeuwen, E. J. V., & Walczak, B. (2021). Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica, 83, 2634-2650. https://doi.org/10.1007/s00453-020-00745-z
https://dspace.library.uu.nl/bitstream/handle/1874/415731/Novotn_2021_Article_Subexponential_TimeAlgorithmsF.pdf?sequence=1
Lima, P. T., Leeuwen, E. J. V., & Wegen, M. V. D. (2021). Algorithms for the rainbow vertex coloring problem on graph classes. Theoretical Computer Science, 887, 122-142. https://doi.org/10.1016/j.tcs.2021.07.009
https://dspace.library.uu.nl/bitstream/handle/1874/416225/1_s2.0_S0304397521004102_main.pdf?sequence=1
Kern, W., Martin, B., Paulusma, D., Smith, S., & Leeuwen, E. J. V. (2021). Disjoint Paths and Connected Subgraphs for H-Free Graphs. In P. Flocchini, & L. Moura (Eds.), Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings (pp. 414-427). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12757 LNCS). Springer. https://doi.org/10.1007/978-3-030-79987-8_29
https://dspace.library.uu.nl/bitstream/handle/1874/416475/Kern2021_Chapter_DisjointPathsAndConnectedSubgr.pdf?sequence=1
Oostveen, J., & van Leeuwen, E. J. (2021). Streaming Deletion Problems Parameterized by Vertex Cover. In E. Bampis, & A. Pagourtzis (Eds.), Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings (pp. 413-426). (Lecture Notes in Computer Science; Vol. 12867). Springer. https://doi.org/10.1007/978-3-030-86593-1_29
https://dspace.library.uu.nl/bitstream/handle/1874/416474/Oostveen_Leeuwen2021_Chapter_StreamingDeletionProblemsParam.pdf?sequence=1
Bodlaender, H. L., Brettell, N., Johnson, M., Paesani, G., Paulusma, D., & van Leeuwen, E. J. (2021). Steiner trees for hereditary graph classes: A treewidth perspective. Theoretical Computer Science, 867, 30-39. https://doi.org/10.1016/j.tcs.2021.03.012
https://dspace.library.uu.nl/bitstream/handle/1874/412714/1_s2.0_S0304397521001420_main.pdf?sequence=1

2020

Wetenschappelijke publicaties

Kanj, I., Komusiewicz, C., Sorge, M., & Leeuwen, E. J. V. (2020). Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM Journal on Discrete Mathematics, 34(1), 640-681. https://doi.org/10.1137/19M1239362
https://research-portal.uu.nl/ws/files/235426366/19m1239362.pdf
Martin, B., Paulusma, D., & Leeuwen, E. J. V. (2020). Disconnected cuts in claw-free graphs. Journal of Computer and System Sciences, 113, 60-75. https://doi.org/10.1016/J.JCSS.2020.04.005
https://research-portal.uu.nl/ws/files/235530010/1-s2.0-S0022000018306056-main.pdf
Kisfaludi-Bak, S., Nederlof, J., & Leeuwen, E. J. V. (2020). Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Transactions on Algorithms, 16(3), 28:1-28:30. https://doi.org/10.1145/3371389
https://research-portal.uu.nl/ws/files/235311920/3371389.pdf
Bodlaender, H. L., Brettell, N., Johnson, M., Paesani, G., Paulusma, D., & Leeuwen, E. J. V. (2020). Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. (pp. 1-16). arXiv. https://doi.org/10.48550/arXiv.2004.07492
https://dspace.library.uu.nl/bitstream/handle/1874/415170/2004.07492v1.pdf?sequence=1
Bodlaender, H. L., Brettell, N., Johnson, M., Paesani, G., Paulusma, D., & van Leeuwen, E. J. (2020). Steiner Trees for Hereditary Graph Classes. In Y. Kohayakawa, & F. K. Miyazawa (Eds.), LATIN 2020: Theoretical Informatics - 14th Latin American Symposium 2021, Proceedings (pp. 613-624). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12118 LNCS). Springer. https://doi.org/10.1007/978-3-030-61792-9_48
https://dspace.library.uu.nl/bitstream/handle/1874/414966/Bodlaender2020_Chapter_SteinerTreesForHereditaryGraph.pdf?sequence=1
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
Reijnders, D., van Leeuwen, E. J., & van Sebille, E. (2020). Ocean Surface Connectivity in the Arctic: Capabilities and Caveats of Community Detection in Lagrangian Flow Networks. Journal of Geophysical Research: Oceans, 126(1), 1-24. https://doi.org/10.1029/2020JC016416
https://dspace.library.uu.nl/bitstream/handle/1874/410556/2020JC016416.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
Casel, K., Dreier, J., Fernau, H., Gobbert, M., Kuinke, P., Sánchez Villaamil, F., Schmid, M. L., & van Leeuwen, E. J. (2020). Complexity of independency and cliquy trees. Discrete Applied Mathematics, 272, 2-15. https://doi.org/10.1016/j.dam.2018.08.011
https://dspace.library.uu.nl/bitstream/handle/1874/396254/1_s2.0_S0166218X18304505_main.pdf?sequence=1
Pilipczuk, M., van Leeuwen, E. J., & Wiese, A. (2020). Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica, 82(6), 1703-1739. https://doi.org/10.1007/s00453-019-00670-w
https://dspace.library.uu.nl/bitstream/handle/1874/396253/Pilipczuk2020_Article_Quasi_PolynomialTimeApproximat.pdf?sequence=1

2019

Wetenschappelijke publicaties

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
Bringmann, K., Kisfaludi-Bak, S., Pilipczuk, M., & van Leeuwen, E. J. (2019). On Geometric Set Cover for Orthants. In 27th Annual European Symposium on Algorithms, {ESA} 2019, September 9-11, 2019, Munich/Garching, Germany Article 26 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 144). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.ESA.2019.26
https://dspace.library.uu.nl/bitstream/handle/1874/390282/LIPIcs_ESA_2019_26.pdf?sequence=1
Bacsó, G., Lokshtanov, D., Marx, D., Pilipczuk, M., Tuza, Z., & van Leeuwen, E. J. (2019). Subexponential-Time Algorithms for Maximum Independent Set in P_t-Free and Broom-Free Graphs. Algorithmica, 81(2), 421-438. https://doi.org/10.1007/s00453-018-0479-5
https://dspace.library.uu.nl/bitstream/handle/1874/382147/Subexponential_time_algorithms.pdf?sequence=1
Hermelin, D., Mnich, M., van Leeuwen, E. J., & Woeginger, G. J. (2019). Domination When the Stars Are Out. ACM Transactions on Algorithms, 15(2), 25:1-25:90. Article 25. https://doi.org/10.1145/3301445
https://dspace.library.uu.nl/bitstream/handle/1874/382146/a25_hermelin.pdf?sequence=1
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
Kisfaludi-Bak, S., Nederlof, J., & Leeuwen, E. J. V. (2019). Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019 (pp. 1015-1034) https://doi.org/10.1137/1.9781611975482.63
https://dspace.library.uu.nl/bitstream/handle/1874/378087/Nearly.pdf?sequence=1

2018

Wetenschappelijke publicaties

Heggernes, P., Issac, D., Lauri, J., Lima, P. T., & Leeuwen, E. J. V. (2018). Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK Article 83 https://doi.org/10.4230/LIPIcs.MFCS.2018.83
https://dspace.library.uu.nl/bitstream/handle/1874/376898/LIPIcs_MFCS_2018_83.pdf?sequence=1
Chandran, L. S., Das, A., Issac, D., & Leeuwen, E. J. V. (2018). Algorithms and Bounds for Very Strong Rainbow Coloring. In M. A. Bender, M. Farach-Colton, & M. A. Mosteiro (Eds.), LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings (pp. 625-639). (Lecture notes in computer science; Vol. 10807), (Advanced research in computing and software science). Springer. https://doi.org/10.1007/978-3-319-77404-6_46
https://dspace.library.uu.nl/bitstream/handle/1874/376897/Chandran2018_Chapter_AlgorithmsAndBoundsForVeryStro.pdf?sequence=1
Pilipczuk, M., Leeuwen, E. J. V., & Wiese, A. (2018). Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. In Y. Azar, H. Bast, & G. Herman (Eds.), 26th Annual European Symposium on Algorithms: ESA 2018, August 20-22, 2018, Helsinki, Finland Article 65 (LIPICS; Vol. 112). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.ESA.2018.65
https://dspace.library.uu.nl/bitstream/handle/1874/376896/LIPIcs_ESA_2018_65.pdf?sequence=1
Martin, B., Paulusma, D., & Leeuwen, E. J. V. (2018). Disconnected Cuts in Claw-free Graphs. In 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland (pp. 61:1-61:14). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ESA.2018.61
https://research-portal.uu.nl/ws/files/248804160/LIPIcs.ESA.2018.61.pdf
Kanj, I. A., Komusiewicz, C., Sorge, M., & Leeuwen, E. J. V. (2018). Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. In Y. Azar, H. Bast, & G. Herman (Eds.), 26th Annual European Symposium on Algorithms: ESA 2018, August 20-22, 2018, Helsinki, Finland Article 51 (LIPICS; Vol. 112). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.ESA.2018.51
https://dspace.library.uu.nl/bitstream/handle/1874/376895/LIPIcs_ESA_2018_51.pdf?sequence=1
Pilipczuk, M., Pilipczuk, M., Sankowski, P., & Leeuwen, E. J. V. (2018). Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. ACM Transactions on Algorithms, 14(4), Article 53. https://doi.org/10.1145/3239560
https://dspace.library.uu.nl/bitstream/handle/1874/376744/pilipczuk.pdf?sequence=1
Lokshtanov, D., Pilipczuk, M., & Leeuwen, E. J. V. (2018). Independence and efficient domination on P6-free graphs. ACM Transactions on Algorithms, 14(1), Article 3. https://doi.org/10.1145/3147214
https://dspace.library.uu.nl/bitstream/handle/1874/407578/a3_lokshtanov.pdf?sequence=1
Kanj, I. A., Komusiewicz, C., Sorge, M., & van Leeuwen, E. J. (2018). Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. Journal of Computer and System Sciences, 92, 22-47. https://doi.org/10.1016/j.jcss.2017.08.002
https://dspace.library.uu.nl/bitstream/handle/1874/362611/kanj.pdf?sequence=1

2017

Wetenschappelijke publicaties

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
Jiamjitrak, W., & van Leeuwen, E. J. (2017). Co-Bipartite Neighborhood Edge Elimination Orderings. Electronic Notes in Discrete Mathematics, 61, 655-661. https://doi.org/10.1016/j.endm.2017.07.020
https://dspace.library.uu.nl/bitstream/handle/1874/361077/1_s2.0_S1571065317301853_main.pdf?sequence=1
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
Cygan, M., Pilipczuk, M., Pilipczuk, M., van Leeuwen, E. J., & Wrochna, M. (2017). Polynomial Kernelization for Removing Induced Claws and Diamonds. Theory of Computing Systems, 60(4), 615-636. https://doi.org/10.1007/s00224-016-9689-x
https://dspace.library.uu.nl/bitstream/handle/1874/361075/10.1007_2Fs00224_016_9689_x.pdf?sequence=1
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
Tan, R. B., van Leeuwen, E. J., & van Leeuwen, J. (2017). Shortcutting directed and undirected networks with a degree constraint. Discrete Applied Mathematics, 220, 91-117. https://doi.org/10.1016/j.dam.2016.12.016
https://dspace.library.uu.nl/bitstream/handle/1874/350789/2.pdf?sequence=1