Erik Jan van Leeuwen

According to our database, Erik Jan van Leeuwen authored at least 87 papers between 2005 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

Prediction Gaps as Pathways to Explanation: Rethinking Educational Outcomes through Differences in Model Performance.

Javier Garcia-Bernardo, Eva Jaspers, Weverthon Machado, Samuel Plach, Erik Jan van Leeuwen

CoRR, June, 2025

Colouring Probe <i>H</i>-Free Graphs.

Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen

CoRR, May, 2025

Concurrency Constrained Scheduling with Tree-Like Constraints.

Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen

CoRR, April, 2025

Complexity Framework for Forbidden Subgraphs I: The Framework.

Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Algorithmica, March, 2025

Computing subset vertex covers in H-free graphs.

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen

Theor. Comput. Sci., 2025

Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs.

Erik Jan van Leeuwen

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

2024

The Complexity of Diameter on H-free Graphs.

Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs.

Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.

Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs.

Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Separator Theorem and Algorithms for Planar Hyperbolic Graphs.

Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Few induced disjoint paths for <i>H</i>-free graphs.

Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Theor. Comput. Sci., 2023

Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs.

Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

The Parameterised Complexity Of Integer Multicommodity Flow.

Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Computing Subset Vertex Covers in H-Free Graphs.

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.

Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Disjoint paths and connected subgraphs for <i>H</i>-free graphs.

Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Theor. Comput. Sci., 2022

Upper bounding rainbow connection number by forest number.

L. Sunil Chandran, Davis Issac, Juho Lauri, Erik Jan van Leeuwen

Discret. Math., 2022

Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision.

Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

CoRR, 2022

Complexity Framework For Forbidden Subgraphs.

Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

CoRR, 2022

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs.

Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

CoRR, 2022

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs.

Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

The Parameterized Complexity of the Survivable Network Design Problem.

Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Planar Multiway Cut with Terminals on Few Faces.

Sukanya Pandey, Erik Jan van Leeuwen

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Parameterized Complexity of Streaming Diameter and Connectivity Problems.

Jelle J. Oostveen, Erik Jan van Leeuwen

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Few Induced Disjoint Paths for H-Free Graphs.

Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021

Steiner trees for hereditary graph classes: A treewidth perspective.

Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen

Theor. Comput. Sci., 2021

Disjoint Paths and Connected Subgraphs for H-Free Graphs.

Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Streaming Deletion Problems Parameterized by Vertex Cover.

Jelle J. Oostveen, Erik Jan van Leeuwen

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

Complexity of independency and cliquy trees.

Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen

Discret. Appl. Math., 2020

Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes.

Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Steiner Trees for Hereditary Graph Classes.

Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs.

Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen

Algorithmica, 2019

A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs.

Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces.

Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.

Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

On Geometric Set Cover for Orthants.

Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Fast Dynamic Programming on Graph Decompositions.

Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle

CoRR, 2018

Subexponential-time Algorithms for Maximum Independent Set in P_t-free and Broom-free Graphs.

Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen

CoRR, 2018

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs.

Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Algorithms and Bounds for Very Strong Rainbow Coloring.

L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.

Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Disconnected Cuts in Claw-free Graphs.

Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.

Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Complexity of metric dimension on planar graphs.

Josep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen

J. Comput. Syst. Sci., 2017

Co-Bipartite Neighborhood Edge Elimination Orderings.

Wanchote Jiamjitrak, Erik Jan van Leeuwen

Electron. Notes Discret. Math., 2017

Shortcutting directed and undirected networks with a degree constraint.

Richard B. Tan, Erik Jan van Leeuwen, Jan van Leeuwen

Discret. Appl. Math., 2017

Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking.

Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

The Firefighter problem on graph classes.

Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen

Theor. Comput. Sci., 2016

Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.

Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Polynomial Kernels for Deletion to Classes of Acyclic Digraphs.

Matthias Mnich, Erik Jan van Leeuwen

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Independence and Efficient Domination on <i>P</i>₆-free Graphs.

Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Algorithms for diversity and clustering in social networks through dot product graphs.

Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen

Soc. Networks, 2015

What Graphs are 2-Dot Product Graphs?

Matthew Johnson, Erik Jan van Leeuwen, Daniël Paulusma

Electron. Notes Discret. Math., 2015

Independence and Efficient Domination on P₆-free Graph.

Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen

CoRR, 2015

Polynomial Kernelization for Removing Induced Claws and Diamonds.

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Parameterized Complexity Dichotomy for Steiner Multicut.

Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

Parameterized complexity of firefighting.

Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen

J. Comput. Syst. Sci., 2014

Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs.

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen

Algorithmica, 2014

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time.

Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Finding Disjoint Paths in Split Graphs.

Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.

Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs.

Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs.

Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Structure of Polynomial-Time Approximation.

Erik Jan van Leeuwen, Jan van Leeuwen

Theory Comput. Syst., 2012

Parameterized Complexity of the Spanning Tree Congestion Problem.

Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen

Algorithmica, 2012

Induced Disjoint Paths in AT-Free Graphs.

Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Reducing a Target Interval to a Few Exact Queries.

Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

k-Gap Interval Graphs.

Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Making Life Easier for Firefighters.

Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Parameterized Complexity of Induced H-Matching on Claw-Free Graphs.

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen

Proceedings of the Algorithms - ESA 2012, 2012

Induced Disjoint Paths in Claw-Free Graphs.

Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the Algorithms - ESA 2012, 2012

On the Complexity of Metric Dimension.

Josep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen

Proceedings of the Algorithms - ESA 2012, 2012

2011

Weisfeiler-Lehman Graph Kernels.

Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, Karsten M. Borgwardt

J. Mach. Learn. Res., 2011

Spanners of bounded degree graphs.

Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen

Inf. Process. Lett., 2011

Planar Metric Dimension is NP-complete

Josep Díaz, Olli Pottonen, Erik Jan van Leeuwen

CoRR, 2011

Parameterized Complexity of Firefighting Revisited.

Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Domination When the Stars Are Out.

Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Integer representations of convex polygon intersection graphs.

Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Complexity Results for the Spanning Tree Congestion Problem.

Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Faster Algorithms on Branch and Clique Decompositions.

Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Convex Polygon Intersection Graphs.

Erik Jan van Leeuwen, Jan van Leeuwen

Proceedings of the Graph Drawing - 18th International Symposium, 2010

PTAS for Weighted Set Cover on Unit Squares.

Thomas Erlebach, Erik Jan van Leeuwen

Proceedings of the Approximation, 2010

2008

Approximating geometric coverage problems.

Thomas Erlebach, Erik Jan van Leeuwen

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Domination in Geometric Intersection Graphs.

Thomas Erlebach, Erik Jan van Leeuwen

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2006

Better Approximation Schemes for Disk Graphs.

Erik Jan van Leeuwen

Proceedings of the Algorithm Theory, 2006

2005

Approximation Algorithms for Unit Disk Graphs.

Erik Jan van Leeuwen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005