Erik Jan van Leeuwen
Utrecht University
127 Papers
493 Citations
Erik Jan van Leeuwen is an academic researcher from Utrecht University. The author has contributed to research in topics: Parameterized complexity & Planar graph. The author has an hindex of 18, co-authored 111 publications. Previous affiliations of Erik Jan van Leeuwen include Sapienza University of Rome & Max Planck Society.
Chat about Author
Papers
Weisfeiler-Lehman Graph Kernels
TL;DR: A family of efficient kernels for large graphs with discrete node labels based on the Weisfeiler-Lehman test of isomorphism on graphs that outperform state-of-the-art graph kernels on several graph classification benchmark data sets in terms of accuracy and runtime.
•Proceedings Article
Approximating geometric coverage problems
Thomas Erlebach,Erik Jan van Leeuwen +1 more
- 20 Jan 2008
TL;DR: This study uses the well-known (unit) disk model for wireless networks and shows that Unique Coverage remains NP-hard in this case and presents a polynomial-time 1/18-approximation algorithm for the minimum membership set cover problem.
51
•Posted Content
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
TL;DR: These results imply the first polynomial kernels for Steiner Tree and Steiner Forest on planar and bounded-genus graphs by explaining the structure of the solution space within a brick of the so-called mortar graph -- the central notion of this framework.
Faster algorithms on branch and clique decompositions
Hans L. Bodlaender,Erik Jan van Leeuwen,Johan M. M. van Rooij,Martin Vatshelle +3 more
- 23 Aug 2010
TL;DR: The unification of generalized fast subset convolution and fast matrix multiplication yields significant improvements to the running time of previous algorithms for several optimization problems, resulting in faster algorithms for all so-called [ρ, σ]-domination problems on branch decompositions if ρ and ρ are finite or cofinite.
44
•Posted Content
Independence and Efficient Domination on $P_6$-free Graphs
TL;DR: In this article, the authors gave a polynomial-time algorithm for Efficient dominating set on P_6-free graphs, which is the only class of graphs defined by a single forbidden induced subgraph on which the computational complexity of dominating set is known.
35