Erik Jan van Leeuwen

157 papers A* 6A 14B 27C 3Misc 1Journal 95Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Colouring Probe H-Free Graphs. STACS Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen
2026	J	`jnl`	Steiner Forest for CoRR Tala Eagling-Vose, David C. Kutner, Felicia Lucke, Dániel Marx, Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
2025	B	`ed.`	20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 IPEC Akanksha Agrawal, Erik Jan van Leeuwen
2025	J	`jnl`	Colouring Probe CoRR Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen
2025	J	`jnl`	Complexity Framework for Forbidden Subgraphs I: The Framework. Algorithmica Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025	J	`jnl`	Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. J. Comput. Syst. Sci. Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025	J	`jnl`	Computing subset vertex covers in H-free graphs. Theor. Comput. Sci. Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen
2025	B	`conf`	Concurrency Constrained Scheduling with Tree-Like Constraints. WG Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen
2025	J	`jnl`	Concurrency Constrained Scheduling with Tree-Like Constraints. CoRR Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen
2025	—	`conf`	LAS-GNN: A Graph Neural Network for Temporal Money Laundering Motif Detection. ICAIF Stan Verlaan, Ioana Hulpus, Erik Jan van Leeuwen
2025	—	`conf`	Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs. SOFSEM (1) Erik Jan van Leeuwen
2025	J	`jnl`	Planar Multiway Cut with Terminals on Few Faces. CoRR Sukanya Pandey, Erik Jan van Leeuwen
2025	J	`jnl`	Prediction Gaps as Pathways to Explanation: Rethinking Educational Outcomes through Differences in Model Performance. CoRR Javier Garcia-Bernardo, Eva Jaspers, Weverthon Machado, Samuel Plach, Erik Jan van Leeuwen
2025	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ACM Trans. Comput. Theory Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2025	J	`jnl`	The Complexity of Diameter on ${H}$-Free Graphs. SIAM J. Discret. Math. Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
2025	J	`jnl`	The parameterized complexity of the survivable network design problem. J. Comput. Syst. Sci. Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
2024	B	`conf`	Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. ISAAC Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen
2024	C	`conf`	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2024	—	`conf`	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2024	J	`jnl`	Parameterized Complexity of Streaming Diameter and Connectivity Problems. Algorithmica Jelle J. Oostveen, Erik Jan van Leeuwen
2024	A*	`conf`	Separator Theorem and Algorithms for Planar Hyperbolic Graphs. SoCG Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
2024	B	`conf`	The Complexity of Diameter on H-free Graphs. WG Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
2024	J	`jnl`	The Complexity of Diameter on H-free graphs. CoRR Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
2023	B	`conf`	Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. MFCS Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs. CoRR Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	B	`conf`	Computing Subset Vertex Covers in H-Free Graphs. FCT Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2023	J	`jnl`	Computing Subset Vertex Covers in H-Free Graphs. CoRR Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2023	J	`jnl`	Few induced disjoint paths for Theor. Comput. Sci. Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Algorithmica Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Separator Theorem and Algorithms for Planar Hyperbolic Graphs. CoRR Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
2023	A	`conf`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023	J	`jnl`	Streaming deletion problems parameterized by vertex cover. Theor. Comput. Sci. Jelle J. Oostveen, Erik Jan van Leeuwen
2023	B	`conf`	The Parameterised Complexity Of Integer Multicommodity Flow. IPEC Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
2023	J	`jnl`	The Parameterised Complexity of Integer Multicommodity Flow. CoRR Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
2022	J	`jnl`	Complexity Framework For Forbidden Subgraphs. CoRR Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision. CoRR Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Disjoint paths and connected subgraphs for Theor. Comput. Sci. Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. CoRR Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2022	C	`conf`	Few Induced Disjoint Paths for H-Free Graphs. ISCO Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Few Induced Disjoint Paths for H-Free Graphs. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	B	`conf`	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. WG Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Induced Disjoint Paths in AT-free graphs. J. Comput. Syst. Sci. Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2022	B	`conf`	Parameterized Complexity of Streaming Diameter and Connectivity Problems. IPEC Jelle J. Oostveen, Erik Jan van Leeuwen
2022	J	`jnl`	Parameterized Complexity of Streaming Diameter and Connectivity Problems. CoRR Jelle J. Oostveen, Erik Jan van Leeuwen
2022	A*	`conf`	Planar Multiway Cut with Terminals on Few Faces. SODA Sukanya Pandey, Erik Jan van Leeuwen
2022	—	`conf`	The Parameterized Complexity of the Survivable Network Design Problem. SOSA Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
2022	J	`jnl`	Upper bounding rainbow connection number by forest number. Discret. Math. L. Sunil Chandran, Davis Issac, Juho Lauri, Erik Jan van Leeuwen
2021	J	`jnl`	A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. SIAM J. Discret. Math. Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
2021	J	`jnl`	Algorithms for the rainbow vertex coloring problem on graph classes. Theor. Comput. Sci. Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen
2021	C	`conf`	Disjoint Paths and Connected Subgraphs for H-Free Graphs. IWOCA Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2021	J	`jnl`	Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2021	J	`jnl`	Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2021	B	`conf`	Streaming Deletion Problems Parameterized by Vertex Cover. FCT Jelle J. Oostveen, Erik Jan van Leeuwen
2021	J	`jnl`	Streaming Deletion Problems Parameterized by Vertex Cover. CoRR Jelle J. Oostveen, Erik Jan van Leeuwen
2021	J	`jnl`	Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2021	J	`jnl`	The Parameterized Complexity of the Survivable Network Design Problem. CoRR Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen
2021	J	`jnl`	What Graphs are 2-Dot Product Graphs? Int. J. Comput. Geom. Appl. Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2020	B	`conf`	Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes. MFCS Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen
2020	J	`jnl`	Algorithms for the rainbow vertex coloring problem on graph classes. CoRR Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen
2020	J	`jnl`	Complexity of independency and cliquy trees. Discret. Appl. Math. Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen
2020	J	`jnl`	Disconnected cuts in claw-free graphs. J. Comput. Syst. Sci. Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	Induced Disjoint Paths in AT-free Graphs. CoRR Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Trans. Algorithms Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
2020	J	`jnl`	Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2020	J	`jnl`	Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM J. Discret. Math. Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2020	B	`conf`	Steiner Trees for Hereditary Graph Classes. LATIN Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2020	—	`ed.`	Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday Treewidth, Kernels, and Algorithms Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen
2019	A	`conf`	A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. STACS Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
2019	J	`jnl`	Domination When the Stars Are Out. ACM Trans. Algorithms Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2019	A*	`conf`	Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. SODA Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
2019	A	`conf`	On Geometric Set Cover for Orthants. ESA Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen
2019	B	`conf`	Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2019	J	`jnl`	Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2019	J	`jnl`	Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2018	J	`jnl`	A deterministic polynomial kernel for Odd Cycle Transversal and Vertex Multiway Cut in planar graphs. CoRR Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen
2018	B	`conf`	Algorithms and Bounds for Very Strong Rainbow Coloring. LATIN L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
2018	A	`conf`	Disconnected Cuts in Claw-free Graphs. ESA Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
2018	J	`jnl`	Disconnected Cuts in Claw-free Graphs. CoRR Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
2018	J	`jnl`	Fast Dynamic Programming on Graph Decompositions. CoRR Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle
2018	J	`jnl`	Independence and Efficient Domination on ACM Trans. Algorithms Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
2018	J	`jnl`	Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. CoRR Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
2018	J	`jnl`	Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. ACM Trans. Algorithms Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2018	J	`jnl`	Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. J. Comput. Syst. Sci. Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2018	A	`conf`	Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. ESA Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2018	J	`jnl`	Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. CoRR Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2018	B	`conf`	Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen
2018	A	`conf`	Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. ESA Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2018	J	`jnl`	Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. CoRR Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2018	J	`jnl`	Subexponential-time Algorithms for Maximum Independent Set in P CoRR Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2017	J	`jnl`	Algorithms and Bounds for Very Strong Rainbow Coloring. CoRR L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
2017	B	`conf`	Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. MFCS Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2017	J	`jnl`	Co-Bipartite Neighborhood Edge Elimination Orderings. Electron. Notes Discret. Math. Wanchote Jiamjitrak, Erik Jan van Leeuwen
2017	J	`jnl`	Complexity of metric dimension on planar graphs. J. Comput. Syst. Sci. Josep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen
2017	J	`jnl`	Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. CoRR Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2017	J	`jnl`	Polynomial Kernelization for Removing Induced Claws and Diamonds. Theory Comput. Syst. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna
2017	J	`jnl`	Polynomial kernels for deletion to classes of acyclic digraphs. Discret. Optim. Matthias Mnich, Erik Jan van Leeuwen
2017	J	`jnl`	Shortcutting directed and undirected networks with a degree constraint. Discret. Appl. Math. Richard B. Tan, Erik Jan van Leeuwen, Jan van Leeuwen
2016	J	`jnl`	Approximation and parameterized algorithms for geometric independent set with shrinking. CoRR Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2016	A*	`conf`	Independence and Efficient Domination on SODA Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
2016	J	`jnl`	Induced disjoint paths in circular-arc graphs in linear time. Theor. Comput. Sci. Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2016	—	`conf`	Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. SWAT Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2016	J	`jnl`	Parameterized complexity dichotomy for Steiner Multicut. J. Comput. Syst. Sci. Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2016	A	`conf`	Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. STACS Matthias Mnich, Erik Jan van Leeuwen
2016	J	`jnl`	The Firefighter problem on graph classes. Theor. Comput. Sci. Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen
2015	J	`jnl`	Algorithms for diversity and clustering in social networks through dot product graphs. Soc. Networks Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2015	J	`jnl`	Finding Disjoint Paths in Split Graphs. Theory Comput. Syst. Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
2015	J	`jnl`	Independence and Efficient Domination on P CoRR Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
2015	J	`jnl`	Induced Disjoint Paths in Claw-Free Graphs. SIAM J. Discret. Math. Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2015	A	`conf`	Parameterized Complexity Dichotomy for Steiner Multicut. STACS Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2015	B	`conf`	Polynomial Kernelization for Removing Induced Claws and Diamonds. WG Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna
2015	J	`jnl`	Polynomial kernelization for removing induced claws and diamonds. CoRR Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna
2015	J	`jnl`	What Graphs are 2-Dot Product Graphs? CoRR Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2015	J	`jnl`	What Graphs are 2-Dot Product Graphs? Electron. Notes Discret. Math. Matthew Johnson, Erik Jan van Leeuwen, Daniël Paulusma
2014	B	`conf`	Finding Disjoint Paths in Split Graphs. SOFSEM Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
2014	B	`conf`	Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. WG Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2014	J	`jnl`	Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. CoRR Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2014	A*	`conf`	Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. FOCS Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2014	J	`jnl`	Parameterized Complexity Dichotomy for Steiner Multicut. CoRR Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2014	J	`jnl`	Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Algorithmica Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2014	J	`jnl`	Parameterized complexity of firefighting. J. Comput. Syst. Sci. Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen
2013	B	`conf`	Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. ISAAC Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2013	J	`jnl`	Integer Representations of Convex Polygon Intersection Graphs. SIAM J. Discret. Math. Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen
2013	J	`jnl`	Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. CoRR Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2013	A	`conf`	Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. STACS Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2012	—	`conf`	Induced Disjoint Paths in AT-Free Graphs. SWAT Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2012	J	`jnl`	Induced Disjoint Paths in Claw-Free Graphs CoRR Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2012	A	`conf`	Induced Disjoint Paths in Claw-Free Graphs. ESA Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2012	Misc	`conf`	Making Life Easier for Firefighters. FUN Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen
2012	A	`conf`	On the Complexity of Metric Dimension. ESA Josep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen
2012	J	`jnl`	Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. CoRR Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2012	A	`conf`	Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. ESA Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2012	J	`jnl`	Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen
2012	J	`jnl`	Reducing a Target Interval to a Few Exact Queries CoRR Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan
2012	B	`conf`	Reducing a Target Interval to a Few Exact Queries. MFCS Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan
2012	J	`jnl`	Structure of Polynomial-Time Approximation. Theory Comput. Syst. Erik Jan van Leeuwen, Jan van Leeuwen
2012	B	`conf`	k-Gap Interval Graphs. LATIN Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
2011	—	`conf`	Domination When the Stars Are Out. ICALP (1) Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2011	—	`conf`	Integer representations of convex polygon intersection graphs. SCG Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen
2011	J	`jnl`	Parameterized Complexity of Firefighting Revisited CoRR Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen
2011	B	`conf`	Parameterized Complexity of Firefighting Revisited. IPEC Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen
2011	J	`jnl`	Planar Metric Dimension is NP-complete CoRR Josep Díaz, Olli Pottonen, Erik Jan van Leeuwen
2011	J	`jnl`	Spanners of bounded degree graphs. Inf. Process. Lett. Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen
2011	J	`jnl`	Weisfeiler-Lehman Graph Kernels. J. Mach. Learn. Res. Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, Karsten M. Borgwardt
2011	J	`jnl`	k-Gap Interval Graphs CoRR Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
2010	B	`conf`	Complexity Results for the Spanning Tree Congestion Problem. WG Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen
2010	A	`conf`	Convex Polygon Intersection Graphs. GD Erik Jan van Leeuwen, Jan van Leeuwen
2010	J	`jnl`	Domination When the Stars Are Out CoRR Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2010	B	`conf`	Faster Algorithms on Branch and Clique Decompositions. MFCS Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle
2010	—	`conf`	PTAS for Weighted Set Cover on Unit Squares. APPROX-RANDOM Thomas Erlebach, Erik Jan van Leeuwen
2008	A*	`conf`	Approximating geometric coverage problems. SODA Thomas Erlebach, Erik Jan van Leeuwen
2008	B	`conf`	Domination in Geometric Intersection Graphs. LATIN Thomas Erlebach, Erik Jan van Leeuwen
2006	—	`conf`	Better Approximation Schemes for Disk Graphs. SWAT Erik Jan van Leeuwen
2005	B	`conf`	Approximation Algorithms for Unit Disk Graphs. WG Erik Jan van Leeuwen