Erik Jan van Leeuwen

Orcid: 0000-0001-5240-7257

Affiliations:
  • Utrecht University, The Netherlands
  • National Research Institute for Mathematics and Computer Science, Amsterdam, The Netherlands (former)


According to our database1, Erik Jan van Leeuwen authored at least 81 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parameterized Complexity of Streaming Diameter and Connectivity Problems.
Algorithmica, September, 2024

The Complexity of Diameter on H-free graphs.
CoRR, 2024

Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Separator Theorem and Algorithms for Planar Hyperbolic Graphs.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Streaming deletion problems parameterized by vertex cover.
Theor. Comput. Sci., November, 2023

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs.
Algorithmica, September, 2023

Few induced disjoint paths for <i>H</i>-free graphs.
Theor. Comput. Sci., 2023

Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

The Parameterised Complexity Of Integer Multicommodity Flow.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Computing Subset Vertex Covers in H-Free Graphs.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Disjoint paths and connected subgraphs for <i>H</i>-free graphs.
Theor. Comput. Sci., 2022

Induced Disjoint Paths in AT-free graphs.
J. Comput. Syst. Sci., 2022

Upper bounding rainbow connection number by forest number.
Discret. Math., 2022

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

Complexity Framework For Forbidden Subgraphs.
CoRR, 2022

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

The Parameterized Complexity of the Survivable Network Design Problem.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Planar Multiway Cut with Terminals on Few Faces.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Few Induced Disjoint Paths for H-Free Graphs.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021
Algorithms for the rainbow vertex coloring problem on graph classes.
Theor. Comput. Sci., 2021

Steiner trees for hereditary graph classes: A treewidth perspective.
Theor. Comput. Sci., 2021

A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs.
SIAM J. Discret. Math., 2021

What Graphs are 2-Dot Product Graphs?
Int. J. Comput. Geom. Appl., 2021

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
Algorithmica, 2021

Disjoint Paths and Connected Subgraphs for H-Free Graphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces.
ACM Trans. Algorithms, 2020

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.
SIAM J. Discret. Math., 2020

Disconnected cuts in claw-free graphs.
J. Comput. Syst. Sci., 2020

Complexity of independency and cliquy trees.
Discret. Appl. Math., 2020

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

Steiner Trees for Hereditary Graph Classes.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Domination When the Stars Are Out.
ACM Trans. Algorithms, 2019

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

On Geometric Set Cover for Orthants.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.
ACM Trans. Algorithms, 2018

Independence and Efficient Domination on <i>P</i><sub>6</sub>-free Graphs.
ACM Trans. Algorithms, 2018

Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs.
J. Comput. Syst. Sci., 2018

Fast Dynamic Programming on Graph Decompositions.
CoRR, 2018

Subexponential-time Algorithms for Maximum Independent Set in P<sub>t</sub>-free and Broom-free Graphs.
CoRR, 2018

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Algorithms and Bounds for Very Strong Rainbow Coloring.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Polynomial Kernelization for Removing Induced Claws and Diamonds.
Theory Comput. Syst., 2017

Complexity of metric dimension on planar graphs.
J. Comput. Syst. Sci., 2017

Co-Bipartite Neighborhood Edge Elimination Orderings.
Electron. Notes Discret. Math., 2017

Polynomial kernels for deletion to classes of acyclic digraphs.
Discret. Optim., 2017

Shortcutting directed and undirected networks with a degree constraint.
Discret. Appl. Math., 2017

Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
Induced disjoint paths in circular-arc graphs in linear time.
Theor. Comput. Sci., 2016

The Firefighter problem on graph classes.
Theor. Comput. Sci., 2016

Parameterized complexity dichotomy for Steiner Multicut.
J. Comput. Syst. Sci., 2016

2015
Algorithms for diversity and clustering in social networks through dot product graphs.
Soc. Networks, 2015

Induced Disjoint Paths in Claw-Free Graphs.
SIAM J. Discret. Math., 2015

Finding Disjoint Paths in Split Graphs.
Theory Comput. Syst., 2015

Independence and Efficient Domination on P<sub>6</sub>-free Graph.
CoRR, 2015

2014
Parameterized complexity of firefighting.
J. Comput. Syst. Sci., 2014

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

2013
Integer Representations of Convex Polygon Intersection Graphs.
SIAM J. Discret. Math., 2013

Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs.
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.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Structure of Polynomial-Time Approximation.
Theory Comput. Syst., 2012

Parameterized Complexity of the Spanning Tree Congestion Problem.
Algorithmica, 2012

Reducing a Target Interval to a Few Exact Queries.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

k-Gap Interval Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Making Life Easier for Firefighters.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Parameterized Complexity of Induced H-Matching on Claw-Free Graphs.
Proceedings of the Algorithms - ESA 2012, 2012

On the Complexity of Metric Dimension.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Weisfeiler-Lehman Graph Kernels.
J. Mach. Learn. Res., 2011

Spanners of bounded degree graphs.
Inf. Process. Lett., 2011

Planar Metric Dimension is NP-complete
CoRR, 2011

Parameterized Complexity of Firefighting Revisited.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

2010
Complexity Results for the Spanning Tree Congestion Problem.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Faster Algorithms on Branch and Clique Decompositions.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Convex Polygon Intersection Graphs.
Proceedings of the Graph Drawing - 18th International Symposium, 2010

PTAS for Weighted Set Cover on Unit Squares.
Proceedings of the Approximation, 2010

2008
Approximating geometric coverage problems.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Domination in Geometric Intersection Graphs.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2006
Better Approximation Schemes for Disk Graphs.
Proceedings of the Algorithm Theory, 2006

2005
Approximation Algorithms for Unit Disk Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005


  Loading...