 | 2012 |
| 22 |  | Fedor V. Fomin,
Pinar Heggernes,
Erik Jan van Leeuwen:
Making Life Easier for Firefighters.
FUN 2012: 177-188 |
| 21 |  | 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 |
| 20 |  | 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) |
| 19 |  | Petr A. Golovach,
Daniël Paulusma,
Erik Jan van Leeuwen:
Induced Disjoint Paths in Claw-Free Graphs
CoRR abs/1202.4419: (2012) |
| 18 |  | Erik Jan van Leeuwen,
Jan van Leeuwen:
Structure of Polynomial-Time Approximation.
Theory Comput. Syst. 50(4): 641-674 (2012) |
| 2011 |
| 17 |  | Danny Hermelin,
Matthias Mnich,
Erik Jan van Leeuwen,
Gerhard J. Woeginger:
Domination When the Stars Are Out.
ICALP (1) 2011: 462-473 |
| 16 |  | Marek Cygan,
Fedor V. Fomin,
Erik Jan van Leeuwen:
Parameterized Complexity of Firefighting Revisited.
IPEC 2011: 13-26 |
| 15 |  | Tobias Müller,
Erik Jan van Leeuwen,
Jan van Leeuwen:
Integer representations of convex polygon intersection graphs.
Symposium on Computational Geometry 2011: 300-307 |
| 14 |  | Josep Diaz,
Olli Pottonen,
Erik Jan van Leeuwen:
Planar Metric Dimension is NP-complete
CoRR abs/1107.2256: (2011) |
| 13 |  | Marek Cygan,
Fedor V. Fomin,
Erik Jan van Leeuwen:
Parameterized Complexity of Firefighting Revisited
CoRR abs/1109.4729: (2011) |
| 12 |  | 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) |
| 11 |  | Fedor V. Fomin,
Petr A. Golovach,
Erik Jan van Leeuwen:
Spanners of bounded degree graphs.
Inf. Process. Lett. 111(3): 142-144 (2011) |
| 10 |  | Nino Shervashidze,
Pascal Schweitzer,
Erik Jan van Leeuwen,
Kurt Mehlhorn,
Karsten M. Borgwardt:
Weisfeiler-Lehman Graph Kernels.
Journal of Machine Learning Research 12: 2539-2561 (2011) |
| 2010 |
| 9 |  | Thomas Erlebach,
Erik Jan van Leeuwen:
PTAS for Weighted Set Cover on Unit Squares.
APPROX-RANDOM 2010: 166-177 |
| 8 |  | Erik Jan van Leeuwen,
Jan van Leeuwen:
Convex Polygon Intersection Graphs.
Graph Drawing 2010: 377-388 |
| 7 |  | 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 |
| 6 |  | Yota Otachi,
Hans L. Bodlaender,
Erik Jan van Leeuwen:
Complexity Results for the Spanning Tree Congestion Problem.
WG 2010: 3-14 |
| 5 |  | Danny Hermelin,
Matthias Mnich,
Erik Jan van Leeuwen,
Gerhard J. Woeginger:
Domination When the Stars Are Out
CoRR abs/1012.0012: (2010) |
| 2008 |
| 4 |  | Thomas Erlebach,
Erik Jan van Leeuwen:
Domination in Geometric Intersection Graphs.
LATIN 2008: 747-758 |
| 3 |  | Thomas Erlebach,
Erik Jan van Leeuwen:
Approximating geometric coverage problems.
SODA 2008: 1267-1276 |
| 2006 |
| 2 |  | Erik Jan van Leeuwen:
Better Approximation Schemes for Disk Graphs.
SWAT 2006: 316-327 |
| 2005 |
| 1 |  | Erik Jan van Leeuwen:
Approximation Algorithms for Unit Disk Graphs.
WG 2005: 351-361 |