Approximation Algorithms for Unit Disk Graphs. - Erik Jan van Leeuwen (WG, 2005)

Better Approximation Schemes for Disk Graphs. - Erik Jan van Leeuwen (SWAT, 2006)

Domination in Geometric Intersection Graphs. - Thomas Erlebach; Erik Jan van Leeuwen (LATIN, 2008)

Approximating geometric coverage problems. - Thomas Erlebach; Erik Jan van Leeuwen (SODA, 2008)

PTAS for Weighted Set Cover on Unit Squares. - Thomas Erlebach; Erik Jan van Leeuwen (APPROX-RANDOM, 2010)

Convex Polygon Intersection Graphs. - Erik Jan van Leeuwen; Jan van Leeuwen (GD, 2010)

Faster Algorithms on Branch and Clique Decompositions. - Hans L. Bodlaender; Erik Jan van Leeuwen; Johan M. M. van Rooij; Martin Vatshelle (MFCS, 2010)

Complexity Results for the Spanning Tree Congestion Problem. - Yota Otachi; Hans L. Bodlaender; Erik Jan van Leeuwen (WG, 2010)

Parameterized Complexity of Firefighting Revisited. - Marek Cygan; Fedor V. Fomin; Erik Jan van Leeuwen (IPEC, 2011)

Planar Metric Dimension is NP-complete - Josep Díaz; Olli Pottonen; Erik Jan van Leeuwen (CoRR, 2011)

Spanners of bounded degree graphs. - Fedor V. Fomin; Petr A. Golovach; Erik Jan van Leeuwen (Inf. Process. Lett., 2011)

Weisfeiler-Lehman Graph Kernels. - Nino Shervashidze; Pascal Schweitzer; Erik Jan van Leeuwen; Kurt Mehlhorn; Karsten M. Borgwardt (J. Mach. Learn. Res., 2011)

On the Complexity of Metric Dimension. - Josep Díaz; Olli Pottonen; Maria J. Serna; Erik Jan van Leeuwen (ESA, 2012)

Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. - Danny Hermelin; Matthias Mnich; Erik Jan van Leeuwen (ESA, 2012)

Making Life Easier for Firefighters. - Fedor V. Fomin; Pinar Heggernes; Erik Jan van Leeuwen (FUN, 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 (LATIN, 2012)

Reducing a Target Interval to a Few Exact Queries. - Jesper Nederlof; Erik Jan van Leeuwen; Ruben van der Zwaan (MFCS, 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)

Structure of Polynomial-Time Approximation. - Erik Jan van Leeuwen; Jan van Leeuwen (Theory Comput. Syst., 2012)

Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. - Matthew Johnson 002; Daniël Paulusma; Erik Jan van Leeuwen (ISAAC, 2013)

Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. - Marcin Pilipczuk; Michal Pilipczuk; Piotr Sankowski; Erik Jan van Leeuwen (STACS, 2013)

Integer Representations of Convex Polygon Intersection Graphs. - Tobias Müller 001; Erik Jan van Leeuwen; Jan van Leeuwen (SIAM J. Discret. Math., 2013)

Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. - Danny Hermelin; Matthias Mnich; Erik Jan van Leeuwen (Algorithmica, 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)

Independence and Efficient Domination on P6-free Graph. - Daniel Lokshtanov; Marcin Pilipczuk; Erik Jan van Leeuwen (CoRR, 2015)

Finding Disjoint Paths in Split Graphs. - Pinar Heggernes; Pim van 't Hof; Erik Jan van Leeuwen; Reza Saei (Theory Comput. Syst., 2015)

Induced Disjoint Paths in Claw-Free Graphs. - Petr A. Golovach; Daniël Paulusma; Erik Jan van Leeuwen (SIAM J. Discret. Math., 2015)

Algorithms for diversity and clustering in social networks through dot product graphs. - Matthew Johnson 002; Daniël Paulusma; Erik Jan van Leeuwen (Soc. Networks, 2015)

Parameterized complexity dichotomy for Steiner Multicut. - Karl Bringmann; Danny Hermelin; Matthias Mnich; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2016)

The Firefighter problem on graph classes. - Fedor V. Fomin; Pinar Heggernes; Erik Jan van Leeuwen (Theor. Comput. Sci., 2016)

Induced disjoint paths in circular-arc graphs in linear time. - Petr A. Golovach; Daniël Paulusma; Erik Jan van Leeuwen (Theor. Comput. Sci., 2016)

Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. - Michal Pilipczuk; Erik Jan van Leeuwen; Andreas Wiese (MFCS, 2017)

Shortcutting directed and undirected networks with a degree constraint. - Richard B. Tan; Erik Jan van Leeuwen; Jan van Leeuwen (Discret. Appl. Math., 2017)

Polynomial kernels for deletion to classes of acyclic digraphs. - Matthias Mnich; Erik Jan van Leeuwen (Discret. Optim., 2017)

Co-Bipartite Neighborhood Edge Elimination Orderings. - Wanchote Jiamjitrak; Erik Jan van Leeuwen (Electron. Notes Discret. Math., 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)

Polynomial Kernelization for Removing Induced Claws and Diamonds. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Erik Jan van Leeuwen; Marcin Wrochna (Theory Comput. Syst., 2017)

Algorithms and Bounds for Very Strong Rainbow Coloring. - L. Sunil Chandran; Anita Das 001; Davis Issac; Erik Jan van Leeuwen (LATIN, 2018)

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. - Pinar Heggernes; Davis Issac; Juho Lauri; Paloma T. Lima; Erik Jan van Leeuwen (MFCS, 2018)

Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs. - Gábor Bacsó; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Zsolt Tuza; Erik Jan van Leeuwen (CoRR, 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)

Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. - Iyad A. Kanj; Christian Komusiewicz; Manuel Sorge; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2018)

Independence and Efficient Domination on P6-free Graphs. - Daniel Lokshtanov; Marcin Pilipczuk; Erik Jan van Leeuwen (ACM Trans. Algorithms, 2018)

Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. - Marcin Pilipczuk; Michal Pilipczuk; Piotr Sankowski; Erik Jan van Leeuwen (ACM Trans. Algorithms, 2018)

On Geometric Set Cover for Orthants. - Karl Bringmann; Sándor Kisfaludi-Bak; Michal Pilipczuk; Erik Jan van Leeuwen (ESA, 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)

Domination When the Stars Are Out. - Danny Hermelin; Matthias Mnich; Erik Jan van Leeuwen; Gerhard J. Woeginger (ACM Trans. Algorithms, 2019)

Steiner Trees for Hereditary Graph Classes. - Hans L. Bodlaender; Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Erik Jan van Leeuwen (LATIN, 2020)

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. - Michal Pilipczuk; Erik Jan van Leeuwen; Andreas Wiese (Algorithmica, 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)

Disconnected cuts in claw-free graphs. - Barnaby Martin; Daniël Paulusma; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2020)

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. - Iyad Kanj; Christian Komusiewicz; Manuel Sorge; Erik Jan van Leeuwen (SIAM J. Discret. Math., 2020)

Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. - Sándor Kisfaludi-Bak; Jesper Nederlof; Erik Jan van Leeuwen (ACM Trans. Algorithms, 2020)

Disjoint Paths and Connected Subgraphs for H-Free Graphs. - Walter Kern; Barnaby Martin; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (IWOCA, 2021)

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. - Jana Novotná 001; Karolina Okrasa; Michal Pilipczuk; Pawel Rzazewski; Erik Jan van Leeuwen; Bartosz Walczak (Algorithmica, 2021)

What Graphs are 2-Dot Product Graphs? - Matthew Johnson 002; Daniël Paulusma; Erik Jan van Leeuwen (Int. J. Comput. Geom. Appl., 2021)

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 (SIAM J. Discret. Math., 2021)

Steiner trees for hereditary graph classes: A treewidth perspective. - Hans L. Bodlaender; Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Erik Jan van Leeuwen (Theor. Comput. Sci., 2021)

Algorithms for the rainbow vertex coloring problem on graph classes. - Paloma T. Lima; Erik Jan van Leeuwen; Marieke van der Wegen (Theor. Comput. Sci., 2021)

Few Induced Disjoint Paths for H-Free Graphs. - Barnaby Martin; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (ISCO, 2022)

Planar Multiway Cut with Terminals on Few Faces. - Sukanya Pandey; Erik Jan van Leeuwen (SODA, 2022)

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. - Matthew Johnson 002; Barnaby Martin; Siani Smith; Sukanya Pandey; Daniël Paulusma; Erik Jan van Leeuwen (CoRR, 2022)

Complexity Framework For Forbidden Subgraphs. - Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (CoRR, 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)

Upper bounding rainbow connection number by forest number. - L. Sunil Chandran; Davis Issac; Juho Lauri; Erik Jan van Leeuwen (Discret. Math., 2022)

Induced Disjoint Paths in AT-free graphs. - Petr A. Golovach; Daniël Paulusma; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2022)

Disjoint paths and connected subgraphs for H-free graphs. - Walter Kern; Barnaby Martin; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (Theor. Comput. Sci., 2022)

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 (ESA, 2023)

Computing Subset Vertex Covers in H-Free Graphs. - Nick Brettell; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Erik Jan van Leeuwen (FCT, 2023)

The Parameterised Complexity Of Integer Multicommodity Flow. - Hans L. Bodlaender; Isja Mannens; Jelle J. Oostveen; Sukanya Pandey; Erik Jan van Leeuwen (IPEC, 2023)

Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. - Matthew Johnson 002; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (MFCS, 2023)

Few induced disjoint paths for H-free graphs. - Barnaby Martin; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (Theor. Comput. Sci., 2023)

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. - Barnaby Martin; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (Algorithmica, 2023)

Streaming deletion problems parameterized by vertex cover. - Jelle J. Oostveen; Erik Jan van Leeuwen (Theor. Comput. Sci., 2023)

Separator Theorem and Algorithms for Planar Hyperbolic Graphs. - Sándor Kisfaludi-Bak; Jana Masaríková; Erik Jan van Leeuwen; Bartosz Walczak; Karol Wegrzycki (SoCG, 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 (ISAAC, 2024)

Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. - Matthew Johnson 002; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (SWAT, 2024)

Parameterized Complexity of Streaming Diameter and Connectivity Problems. - Jelle J. Oostveen; Erik Jan van Leeuwen (Algorithmica, 2024)

Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs. - Erik Jan van Leeuwen (SOFSEM (1), 2025)

Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. - Hans L. Bodlaender; Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2025)

The parameterized complexity of the survivable network design problem. - Andreas Emil Feldmann; Anish Mukherjee 001; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2025)

The Complexity of Diameter on ({H} )-Free Graphs. - Jelle J. Oostveen; Daniël Paulusma; Erik Jan van Leeuwen (SIAM J. Discret. Math., 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)

Complexity Framework for Forbidden Subgraphs I: The Framework. - Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (Algorithmica, 2025)

Concurrency Constrained Scheduling with Tree-Like Constraints. - Hans L. Bodlaender; Danny Hermelin; Erik Jan van Leeuwen (CoRR, 2025)

Colouring Probe H-Free Graphs. - Daniël Paulusma; Johannes Rauch; Erik Jan van Leeuwen (CoRR, 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, 2025)