default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErik Jan van Leeuwen
Person information
- affiliation: Utrecht University, The Netherlands
- affiliation (former): National Research Institute for Mathematics and Computer Science, Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j42]Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen:
The parameterized complexity of the survivable network design problem. J. Comput. Syst. Sci. 148: 103604 (2025)- 2024
- [j41]Jelle J. Oostveen
, Erik Jan van Leeuwen:
Parameterized Complexity of Streaming Diameter and Connectivity Problems. Algorithmica 86(9): 2885-2928 (2024) - [c55]Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki:
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. SoCG 2024: 67:1-67:17 - [c54]Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. ISAAC 2024: 47:1-47:18 - [c53]Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA 2024: 206-217 - [c52]Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT 2024: 29:1-29:17 - [i43]Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen:
The Complexity of Diameter on H-free graphs. CoRR abs/2402.16678 (2024) - 2023
- [j40]Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Algorithmica 85(9): 2580-2604 (2023) - [j39]Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Few induced disjoint paths for H-free graphs. Theor. Comput. Sci. 939: 182-193 (2023) - [j38]Jelle J. Oostveen, Erik Jan van Leeuwen:
Streaming deletion problems parameterized by vertex cover. Theor. Comput. Sci. 979: 114178 (2023) - [c51]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA 2023: 18:1-18:18 - [c50]Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen:
Computing Subset Vertex Covers in H-Free Graphs. FCT 2023: 88-102 - [c49]Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen:
The Parameterised Complexity Of Integer Multicommodity Flow. IPEC 2023: 6:1-6:19 - [c48]Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. MFCS 2023: 57:1-57:15 - [i42]Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs. CoRR abs/2305.01104 (2023) - [i41]Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR abs/2305.01613 (2023) - [i40]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR abs/2307.01285 (2023) - [i39]Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen:
Computing Subset Vertex Covers in H-Free Graphs. CoRR abs/2307.05701 (2023) - [i38]Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen:
The Parameterised Complexity of Integer Multicommodity Flow. CoRR abs/2310.05784 (2023) - [i37]Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki:
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. CoRR abs/2310.11283 (2023) - 2022
- [j37]L. Sunil Chandran, Davis Issac, Juho Lauri, Erik Jan van Leeuwen:
Upper bounding rainbow connection number by forest number. Discret. Math. 345(7): 112829 (2022) - [j36]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in AT-free graphs. J. Comput. Syst. Sci. 124: 170-191 (2022) - [j35]Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Disjoint paths and connected subgraphs for H-free graphs. Theor. Comput. Sci. 898: 59-68 (2022) - [c47]Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Few Induced Disjoint Paths for H-Free Graphs. ISCO 2022: 89-101 - [c46]Jelle J. Oostveen, Erik Jan van Leeuwen:
Parameterized Complexity of Streaming Diameter and Connectivity Problems. IPEC 2022: 24:1-24:16 - [c45]Sukanya Pandey, Erik Jan van Leeuwen:
Planar Multiway Cut with Terminals on Few Faces. SODA 2022: 2032-2063 - [c44]Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen:
The Parameterized Complexity of the Survivable Network Design Problem. SOSA 2022: 37-56 - [c43]Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. WG 2022: 398-411 - [i36]Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR abs/2202.11595 (2022) - [i35]Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Few Induced Disjoint Paths for H-Free Graphs. CoRR abs/2203.03319 (2022) - [i34]Jelle J. Oostveen, Erik Jan van Leeuwen:
Parameterized Complexity of Streaming Diameter and Connectivity Problems. CoRR abs/2207.04872 (2022) - [i33]Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen:
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. CoRR abs/2211.12203 (2022) - [i32]Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework For Forbidden Subgraphs. CoRR abs/2211.12887 (2022) - [i31]Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision. CoRR abs/2211.14214 (2022) - 2021
- [j34]Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak:
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica 83(8): 2634-2650 (2021) - [j33]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
What Graphs are 2-Dot Product Graphs? Int. J. Comput. Geom. Appl. 31(1): 1-16 (2021) - [j32]Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen:
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. SIAM J. Discret. Math. 35(4): 2387-2429 (2021) - [j31]Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. 867: 30-39 (2021) - [j30]Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen:
Algorithms for the rainbow vertex coloring problem on graph classes. Theor. Comput. Sci. 887: 122-142 (2021) - [c42]Jelle J. Oostveen, Erik Jan van Leeuwen:
Streaming Deletion Problems Parameterized by Vertex Cover. FCT 2021: 413-426 - [c41]Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Disjoint Paths and Connected Subgraphs for H-Free Graphs. IWOCA 2021: 414-427 - [i30]Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR abs/2105.06349 (2021) - [i29]Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen:
The Parameterized Complexity of the Survivable Network Design Problem. CoRR abs/2111.02295 (2021) - [i28]Jelle J. Oostveen, Erik Jan van Leeuwen:
Streaming Deletion Problems Parameterized by Vertex Cover. CoRR abs/2111.10184 (2021) - 2020
- [j29]Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese:
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica 82(6): 1703-1739 (2020) - [j28]Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen:
Complexity of independency and cliquy trees. Discret. Appl. Math. 272: 2-15 (2020) - [j27]Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen:
Disconnected cuts in claw-free graphs. J. Comput. Syst. Sci. 113: 60-75 (2020) - [j26]Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM J. Discret. Math. 34(1): 640-681 (2020) - [j25]Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen:
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Trans. Algorithms 16(3): 28:1-28:30 (2020) - [c40]Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes. LATIN 2020: 613-624 - [c39]Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen:
Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes. MFCS 2020: 63:1-63:13 - [e1]Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen:
Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 12160, Springer 2020, ISBN 978-3-030-42070-3 [contents] - [i27]Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen:
Algorithms for the rainbow vertex coloring problem on graph classes. CoRR abs/2003.03108 (2020) - [i26]Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR abs/2004.07492 (2020) - [i25]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in AT-free Graphs. CoRR abs/2012.09814 (2020)
2010 – 2019
- 2019
- [j24]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica 81(2): 421-438 (2019) - [j23]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger:
Domination When the Stars Are Out. ACM Trans. Algorithms 15(2): 25:1-25:90 (2019) - [c38]Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen:
On Geometric Set Cover for Orthants. ESA 2019: 26:1-26:18 - [c37]Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak:
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC 2019: 23:1-23:11 - [c36]Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen:
Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. SODA 2019: 1015-1034 - [c35]Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen:
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. STACS 2019: 39:1-39:18 - [i24]Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak:
Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR abs/1910.01082 (2019) - 2018
- [j22]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. J. Comput. Syst. Sci. 92: 22-47 (2018) - [j21]Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen:
Independence and Efficient Domination on P6-free Graphs. ACM Trans. Algorithms 14(1): 3:1-3:30 (2018) - [j20]Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen:
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. ACM Trans. Algorithms 14(4): 53:1-53:73 (2018) - [c34]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. ESA 2018: 51:1-51:14 - [c33]Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen:
Disconnected Cuts in Claw-free Graphs. ESA 2018: 61:1-61:14 - [c32]Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese:
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. ESA 2018: 65:1-65:13 - [c31]L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen:
Algorithms and Bounds for Very Strong Rainbow Coloring. LATIN 2018: 625-639 - [c30]Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen:
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS 2018: 83:1-83:13 - [i23]Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen:
Disconnected Cuts in Claw-free Graphs. CoRR abs/1803.03663 (2018) - [i22]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs. CoRR abs/1804.04077 (2018) - [i21]Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle:
Fast Dynamic Programming on Graph Decompositions. CoRR abs/1806.01667 (2018) - [i20]Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese:
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. CoRR abs/1807.07626 (2018) - [i19]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. CoRR abs/1808.08772 (2018) - [i18]Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen:
A deterministic polynomial kernel for Odd Cycle Transversal and Vertex Multiway Cut in planar graphs. CoRR abs/1810.01136 (2018) - [i17]Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen:
Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. CoRR abs/1811.06871 (2018) - 2017
- [j19]Richard B. Tan, Erik Jan van Leeuwen, Jan van Leeuwen:
Shortcutting directed and undirected networks with a degree constraint. Discret. Appl. Math. 220: 91-117 (2017) - [j18]Matthias Mnich, Erik Jan van Leeuwen:
Polynomial kernels for deletion to classes of acyclic digraphs. Discret. Optim. 25: 48-76 (2017) - [j17]Wanchote Jiamjitrak, Erik Jan van Leeuwen:
Co-Bipartite Neighborhood Edge Elimination Orderings. Electron. Notes Discret. Math. 61: 655-661 (2017) - [j16]Josep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen:
Complexity of metric dimension on planar graphs. J. Comput. Syst. Sci. 83(1): 132-158 (2017) - [j15]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial Kernelization for Removing Induced Claws and Diamonds. Theory Comput. Syst. 60(4): 615-636 (2017) - [c29]Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese:
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. MFCS 2017: 42:1-42:13 - [i16]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. CoRR abs/1702.04322 (2017) - [i15]L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen:
Algorithms and Bounds for Very Strong Rainbow Coloring. CoRR abs/1703.00236 (2017) - 2016
- [j14]Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized complexity dichotomy for Steiner Multicut. J. Comput. Syst. Sci. 82(6): 1020-1043 (2016) - [j13]Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen:
The Firefighter problem on graph classes. Theor. Comput. Sci. 613: 38-50 (2016) - [j12]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced disjoint paths in circular-arc graphs in linear time. Theor. Comput. Sci. 640: 70-83 (2016) - [c28]Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen:
Independence and Efficient Domination on P6-free Graphs. SODA 2016: 1784-1803 - [c27]Matthias Mnich, Erik Jan van Leeuwen:
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. STACS 2016: 55:1-55:13 - [c26]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. SWAT 2016: 14:1-14:14 - [i14]Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese:
Approximation and parameterized algorithms for geometric independent set with shrinking. CoRR abs/1611.06501 (2016) - 2015
- [j11]Matthew Johnson, Erik Jan van Leeuwen, Daniël Paulusma:
What Graphs are 2-Dot Product Graphs? Electron. Notes Discret. Math. 49: 705-711 (2015) - [j10]Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei:
Finding Disjoint Paths in Split Graphs. Theory Comput. Syst. 57(1): 140-159 (2015) - [j9]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Claw-Free Graphs. SIAM J. Discret. Math. 29(1): 348-375 (2015) - [j8]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
Algorithms for diversity and clustering in social networks through dot product graphs. Soc. Networks 41: 48-55 (2015) - [c25]Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity Dichotomy for Steiner Multicut. STACS 2015: 157-170 - [c24]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial Kernelization for Removing Induced Claws and Diamonds. WG 2015: 440-455 - [i13]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial kernelization for removing induced claws and diamonds. CoRR abs/1503.00704 (2015) - [i12]Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen:
Independence and Efficient Domination on P6-free Graph. CoRR abs/1507.02163 (2015) - [i11]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
What Graphs are 2-Dot Product Graphs? CoRR abs/1511.05009 (2015) - 2014
- [j7]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Algorithmica 70(3): 513-560 (2014) - [j6]Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen:
Parameterized complexity of firefighting. J. Comput. Syst. Sci. 80(7): 1285-1297 (2014) - [c23]Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen:
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. FOCS 2014: 276-285 - [c22]Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei:
Finding Disjoint Paths in Split Graphs. SOFSEM 2014: 315-326 - [c21]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. WG 2014: 225-237 - [i10]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. CoRR abs/1403.0789 (2014) - [i9]Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity Dichotomy for Steiner Multicut. CoRR abs/1404.7006 (2014) - 2013
- [j5]Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen:
Integer Representations of Convex Polygon Intersection Graphs. SIAM J. Discret. Math. 27(1): 205-231 (2013) - [c20]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. ISAAC 2013: 130-140 - [c19]Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen:
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. STACS 2013: 353-364 - [i8]Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen:
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. CoRR abs/1306.6593 (2013) - 2012
- [j4]Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen:
Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica 64(1): 85-111 (2012) - [j3]Erik Jan van Leeuwen, Jan van Leeuwen:
Structure of Polynomial-Time Approximation. Theory Comput. Syst. 50(4): 641-674 (2012) - [c18]Josep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen:
On the Complexity of Metric Dimension. ESA 2012: 419-430 - [c17]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Claw-Free Graphs. ESA 2012: 515-526 - [c16]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. ESA 2012: 624-635 - [c15]Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen:
Making Life Easier for Firefighters. FUN 2012: 177-188 - [c14]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger:
k-Gap Interval Graphs. LATIN 2012: 350-361 - [c13]Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan:
Reducing a Target Interval to a Few Exact Queries. MFCS 2012: 718-727 - [c12]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in AT-Free Graphs. SWAT 2012: 153-164 - [i7]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Claw-Free Graphs. CoRR abs/1202.4419 (2012) - [i6]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. CoRR abs/1206.7105 (2012) - [i5]Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan:
Reducing a Target Interval to a Few Exact Queries. CoRR abs/1208.4225 (2012) - 2011
- [j2]Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen:
Spanners of bounded degree graphs. Inf. Process. Lett. 111(3): 142-144 (2011) - [j1]Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, Karsten M. Borgwardt:
Weisfeiler-Lehman Graph Kernels. J. Mach. Learn. Res. 12: 2539-2561 (2011) - [c11]Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen:
Integer representations of convex polygon intersection graphs. SCG 2011: 300-307 - [c10]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger:
Domination When the Stars Are Out. ICALP (1) 2011: 462-473 - [c9]Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen:
Parameterized Complexity of Firefighting Revisited. IPEC 2011: 13-26 - [i4]Josep Díaz, Olli Pottonen, Erik Jan van Leeuwen:
Planar Metric Dimension is NP-complete. CoRR abs/1107.2256 (2011) - [i3]Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen:
Parameterized Complexity of Firefighting Revisited. CoRR abs/1109.4729 (2011) - [i2]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger:
k-Gap Interval Graphs. CoRR abs/1112.3244 (2011) - 2010
- [c8]Thomas Erlebach, Erik Jan van Leeuwen:
PTAS for Weighted Set Cover on Unit Squares. APPROX-RANDOM 2010: 166-177 - [c7]Erik Jan van Leeuwen, Jan van Leeuwen:
Convex Polygon Intersection Graphs. GD 2010: 377-388 - [c6]Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle:
Faster Algorithms on Branch and Clique Decompositions. MFCS 2010: 174-185 - [c5]Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen:
Complexity Results for the Spanning Tree Congestion Problem. WG 2010: 3-14 - [i1]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger:
Domination When the Stars Are Out. CoRR abs/1012.0012 (2010)
2000 – 2009
- 2008
- [c4]Thomas Erlebach, Erik Jan van Leeuwen:
Domination in Geometric Intersection Graphs. LATIN 2008: 747-758 - [c3]Thomas Erlebach, Erik Jan van Leeuwen:
Approximating geometric coverage problems. SODA 2008: 1267-1276 - 2006
- [c2]Erik Jan van Leeuwen:
Better Approximation Schemes for Disk Graphs. SWAT 2006: 316-327 - 2005
- [c1]Erik Jan van Leeuwen:
Approximation Algorithms for Unit Disk Graphs. WG 2005: 351-361
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
