Erik Jan van Leeuwen
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
46
Venues
14
Active years
2005–2026
Best venue rank
A*
Where they publish
Papers
46 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STACS | Colouring Probe H-Free Graphs. | Danil Paulusma, Johannes Rauch, Erik Jan van Leeuwen |
| 2025 | SOFSEM | Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs. | Erik Jan van Leeuwen |
| 2025 | WG | Concurrency Constrained Scheduling with Tree-Like Constraints. | Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen |
| 2024 | ISAAC | Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. | Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Danil Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen |
| 2024 | IWOCA | Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. | Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2024 | WG | The Complexity of Diameter on H-free Graphs. | Jelle J. Oostveen, Danil Paulusma, Erik Jan van Leeuwen |
| 2023 | ESA | 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 |
| 2023 | FCT | Computing Subset Vertex Covers in H-Free Graphs. | Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Danil Paulusma, Erik Jan van Leeuwen |
| 2023 | MFCS | Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. | Matthew Johnson, Barnaby Martin, Sukanya Pandey, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2022 | SODA | Planar Multiway Cut with Terminals on Few Faces. | Sukanya Pandey, Erik Jan van Leeuwen |
| 2022 | WG | Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. | Barnaby Martin, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2021 | FCT | Streaming Deletion Problems Parameterized by Vertex Cover. | Jelle J. Oostveen, Erik Jan van Leeuwen |
| 2021 | IWOCA | Disjoint Paths and Connected Subgraphs for H-Free Graphs. | Walter Kern, Barnaby Martin, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2020 | LATIN | Steiner Trees for Hereditary Graph Classes. | Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Danil Paulusma, Erik Jan van Leeuwen |
| 2020 | MFCS | Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes. | Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen |
| 2019 | ESA | On Geometric Set Cover for Orthants. | Karl Bringmann, Sndor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen |
| 2019 | SODA | Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. | Sndor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen |
| 2019 | STACS | 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 |
| 2018 | ESA | Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. | Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen |
| 2018 | ESA | Disconnected Cuts in Claw-free Graphs. | Barnaby Martin, Danil Paulusma, Erik Jan van Leeuwen |
| 2018 | ESA | Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. | Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese |
| 2018 | LATIN | Algorithms and Bounds for Very Strong Rainbow Coloring. | L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen |
| 2018 | MFCS | Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. | Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen |
| 2017 | MFCS | Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. | Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese |
| 2016 | SODA | Independence and Efficient Domination on | Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen |
| 2016 | STACS | Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. | Matthias Mnich, Erik Jan van Leeuwen |
| 2015 | STACS | Parameterized Complexity Dichotomy for Steiner Multicut. | Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen |
| 2015 | WG | Polynomial Kernelization for Removing Induced Claws and Diamonds. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna |
| 2014 | FOCS | Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen |
| 2014 | SOFSEM | Finding Disjoint Paths in Split Graphs. | Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei |
| 2014 | WG | Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. | Petr A. Golovach, Danil Paulusma, Erik Jan van Leeuwen |
| 2013 | ISAAC | Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. | Matthew Johnson, Danil Paulusma, Erik Jan van Leeuwen |
| 2013 | STACS | Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen |
| 2012 | ESA | On the Complexity of Metric Dimension. | Josep Daz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen |
| 2012 | ESA | Induced Disjoint Paths in Claw-Free Graphs. | Petr A. Golovach, Danil Paulusma, Erik Jan van Leeuwen |
| 2012 | ESA | Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen |
| 2012 | FUN | Making Life Easier for Firefighters. | Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen |
| 2012 | LATIN | k-Gap Interval Graphs. | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger |
| 2012 | MFCS | Reducing a Target Interval to a Few Exact Queries. | Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan |
| 2011 | ICALP | Domination When the Stars Are Out. | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger |
| 2010 | GD | Convex Polygon Intersection Graphs. | Erik Jan van Leeuwen, Jan van Leeuwen |
| 2010 | MFCS | Faster Algorithms on Branch and Clique Decompositions. | Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle |
| 2010 | WG | Complexity Results for the Spanning Tree Congestion Problem. | Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen |
| 2008 | LATIN | Domination in Geometric Intersection Graphs. | Thomas Erlebach, Erik Jan van Leeuwen |
| 2008 | SODA | Approximating geometric coverage problems. | Thomas Erlebach, Erik Jan van Leeuwen |
| 2005 | WG | Approximation Algorithms for Unit Disk Graphs. | Erik Jan van Leeuwen |