Erik Jan van Leeuwen

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 88

Top Venues

CoRR

Theor. Comput. Sci.

J. Comput. Syst. Sci.

Algorithmica

Publications

Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT (2024)
Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
The Complexity of Diameter on H-free graphs. CoRR (2024)
Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. SoCG (2024)
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA (2024)
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
Computing Subset Vertex Covers in H-Free Graphs. FCT (2023)
Jelle J. Oostveen, Erik Jan van Leeuwen
Streaming deletion problems parameterized by vertex cover. Theor. Comput. Sci. 979 (2023)
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
Computing Subset Vertex Covers in H-Free Graphs. CoRR (2023)
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR (2023)
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs. CoRR (2023)
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA (2023)
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
The Parameterised Complexity Of Integer Multicommodity Flow. IPEC (2023)
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. MFCS (2023)
Sándor Kisfaludi-Bak, Jana Masarikova, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. CoRR (2023)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
-free graphs. Theor. Comput. Sci. 939 (2023)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Algorithmica 85 (9) (2023)
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR (2023)
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
The Parameterised Complexity of Integer Multicommodity Flow. CoRR (2023)
Sukanya Pandey, Erik Jan van Leeuwen
Planar Multiway Cut with Terminals on Few Faces. SODA (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. WG (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR (2022)
Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework For Forbidden Subgraphs. CoRR (2022)
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
Induced Disjoint Paths in AT-free graphs. J. Comput. Syst. Sci. 124 (2022)
Jelle J. Oostveen, Erik Jan van Leeuwen
Parameterized Complexity of Streaming Diameter and Connectivity Problems. CoRR (2022)
Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision. CoRR (2022)
Jelle J. Oostveen, Erik Jan van Leeuwen
Parameterized Complexity of Streaming Diameter and Connectivity Problems. IPEC (2022)
Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
The Parameterized Complexity of the Survivable Network Design Problem. SOSA (2022)
Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. CoRR (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Few Induced Disjoint Paths for H-Free Graphs. CoRR (2022)
L. Sunil Chandran, Davis Issac, Juho Lauri, Erik Jan van Leeuwen
Upper bounding rainbow connection number by forest number. Discret. Math. 345 (7) (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Few Induced Disjoint Paths for H-Free Graphs. ISCO (2022)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
-free graphs. Theor. Comput. Sci. 898 (2022)
Jelle J. Oostveen, Erik Jan van Leeuwen
Streaming Deletion Problems Parameterized by Vertex Cover. FCT (2021)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. 867 (2021)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR (2021)
Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
What Graphs are 2-Dot Product Graphs? Int. J. Comput. Geom. Appl. 31 (1) (2021)
Jelle J. Oostveen, Erik Jan van Leeuwen
Streaming Deletion Problems Parameterized by Vertex Cover. CoRR (2021)
Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. SIAM J. Discret. Math. 35 (4) (2021)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica 83 (8) (2021)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Disjoint Paths and Connected Subgraphs for H-Free Graphs. IWOCA (2021)
Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen
Algorithms for the rainbow vertex coloring problem on graph classes. Theor. Comput. Sci. 887 (2021)
Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
The Parameterized Complexity of the Survivable Network Design Problem. CoRR (2021)
Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen
Complexity of independency and cliquy trees. Discret. Appl. Math. 272 (2020)
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
Induced Disjoint Paths in AT-free Graphs. CoRR (2020)
Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen
Algorithms for the rainbow vertex coloring problem on graph classes. CoRR (2020)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR (2020)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner Trees for Hereditary Graph Classes. LATIN (2020)
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Trans. Algorithms 16 (3) (2020)
Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM J. Discret. Math. 34 (1) (2020)
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica 82 (6) (2020)
Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
Disconnected cuts in claw-free graphs. J. Comput. Syst. Sci. 113 (2020)
Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen
Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes. MFCS (2020)
Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica 81 (2) (2019)
Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen
On Geometric Set Cover for Orthants. ESA (2019)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR (2019)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC (2019)
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. SODA (2019)
Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
Domination When the Stars Are Out. ACM Trans. Algorithms 15 (2) (2019)
Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. STACS (2019)
L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
Algorithms and Bounds for Very Strong Rainbow Coloring. LATIN (2018)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. ESA (2018)
Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
A deterministic polynomial kernel for Odd Cycle Transversal and Vertex Multiway Cut in planar graphs. CoRR (2018)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. CoRR (2018)
Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
Disconnected Cuts in Claw-free Graphs. CoRR (2018)
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. CoRR (2018)
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. CoRR (2018)
Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS (2018)
Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. ACM Trans. Algorithms 14 (4) (2018)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. J. Comput. Syst. Sci. 92 (2018)
Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
-free and Broom-free Graphs. CoRR (2018)
Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
-free Graphs. ACM Trans. Algorithms 14 (1) (2018)
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. ESA (2018)
Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle
Fast Dynamic Programming on Graph Decompositions. CoRR (2018)
Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
Disconnected Cuts in Claw-free Graphs. ESA (2018)
Matthias Mnich, Erik Jan van Leeuwen
Polynomial kernels for deletion to classes of acyclic digraphs. Discret. Optim. 25 (2017)
Richard B. Tan, Erik Jan van Leeuwen, Jan van Leeuwen
Shortcutting directed and undirected networks with a degree constraint. Discret. Appl. Math. 220 (2017)
Wanchote Jiamjitrak, Erik Jan van Leeuwen
Co-Bipartite Neighborhood Edge Elimination Orderings. Electron. Notes Discret. Math. 61 (2017)
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. MFCS (2017)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna
Polynomial Kernelization for Removing Induced Claws and Diamonds. Theory Comput. Syst. 60 (4) (2017)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. CoRR (2017)
L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
Algorithms and Bounds for Very Strong Rainbow Coloring. CoRR (2017)
Josep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen
Complexity of metric dimension on planar graphs. J. Comput. Syst. Sci. 83 (1) (2017)
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Approximation and parameterized algorithms for geometric independent set with shrinking. CoRR (2016)
Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen
The Firefighter problem on graph classes. Theor. Comput. Sci. 613 (2016)
Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
-free Graphs. SODA (2016)
Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
Parameterized complexity dichotomy for Steiner Multicut. J. Comput. Syst. Sci. 82 (6) (2016)
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
Induced disjoint paths in circular-arc graphs in linear time. Theor. Comput. Sci. 640 (2016)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. SWAT (2016)
Matthias Mnich, Erik Jan van Leeuwen
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. STACS (2016)
Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
Algorithms for diversity and clustering in social networks through dot product graphs. Soc. Networks 41 (2015)
Matthew Johnson, Erik Jan van Leeuwen, Daniël Paulusma
What Graphs are 2-Dot Product Graphs? Electron. Notes Discret. Math. 49 (2015)
Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
-free Graph. CoRR (2015)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna
Polynomial kernelization for removing induced claws and diamonds. CoRR (2015)
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
Induced Disjoint Paths in Claw-Free Graphs. SIAM J. Discret. Math. 29 (1) (2015)
Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
What Graphs are 2-Dot Product Graphs? CoRR (2015)
Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
Parameterized Complexity Dichotomy for Steiner Multicut. STACS (2015)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna
Polynomial Kernelization for Removing Induced Claws and Diamonds. WG (2015)
Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
Finding Disjoint Paths in Split Graphs. Theory Comput. Syst. 57 (1) (2015)
Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
Finding Disjoint Paths in Split Graphs. SOFSEM (2014)
Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Algorithmica 70 (3) (2014)
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. WG (2014)

Erik Jan van Leeuwen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Erik Jan van Leeuwen