#### Filter Results:

- Full text PDF available (33)

#### Publication Year

2005

2018

- This year (11)
- Last 5 years (37)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, Karsten M. Borgwardt
- Journal of Machine Learning Research
- 2011

In this article, we propose a family of efficient kernels for l a ge graphs with discrete node labels. Key to our method is a rapid feature extraction scheme b as d on the Weisfeiler-Lehman test ofâ€¦ (More)

- Thomas Erlebach, Erik Jan van Leeuwen
- SODA
- 2008

We present the first study on the approximability of geometric versions of the unique coverage problem and the minimum membership set cover problem. In the former problem, one is given a family ofâ€¦ (More)

- Thomas Erlebach, Erik Jan van Leeuwen
- LATIN
- 2008

For intersection graphs of disks and other fat objects, polynomial-time approximation schemes are known for the independent set and vertex cover problems, but the existing techniques were not able toâ€¦ (More)

- Thomas Erlebach, Erik Jan van Leeuwen
- APPROX-RANDOM
- 2010

We study the planar version of Minimum-Weight Set Cover, where one has to cover a given set of points with a minimum-weight subset of a given set of planar objects. For the unit-weight case, one PTASâ€¦ (More)

The metric dimension of a graph G is the size of a smallest subset L âŠ† V (G) such that for any x, y âˆˆ V (G) there is a z âˆˆ L such that the graph distance between x and z differs from the graphâ€¦ (More)

- Erik Jan van Leeuwen, Jan van Leeuwen
- Graph Drawing
- 2010

Geometric intersection graphs are graphs determined by the intersections of certain geometric objects. We study the complexity of visualizing an arrangement of objects that induces a givenâ€¦ (More)

- Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
- ACM Trans. Algorithms
- 2018

We propose polynomial-time algorithms that sparsify planar and bounded-genus graphs while preserving optimal or near-optimal solutions to Steiner problems. Our main contribution is a polynomial-timeâ€¦ (More)

- Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen
- J. Comput. Syst. Sci.
- 2014

The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with known starting point from lighting up the entire graph. In each time step, a firefighter may beâ€¦ (More)

- Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
- Algorithmica
- 2014

The Induced Graph Matching problem asks to find $$k$$ k disjoint induced subgraphs isomorphic to a given graphÂ $$H$$ H in a given graph $$G$$ G such that there are no edges between vertices ofâ€¦ (More)

- Tobias Mueller, Erik Jan van Leeuwen, Jan van Leeuwen
- SIAM J. Discrete Math.
- 2013