Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="van Leeuwen, Erik Jan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parameterized complexity dichotomy for Steiner multicut
Karl Bringmann
,
Danny Hermelin
,
Matthias Mnich
,
Erik Jan van Leeuwen
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 157-170
Parameterized complexity of firefighting
Cristina Bazgan
,
Morgan Chopin
,
Marek Cygan
,
Michael R. Fellows
,
Fedor V. Fomin
,
Erik Jan van Leeuwen
Journal of Computer and System Sciences
80
(7), 2014, pp. 1285-1297
Induced disjoint paths in circular-arc graphs in linear time
Petr A. Golovach
,
Daniël Paulusma
,
Erik Jan van Leeuwen
Lecture Notes in Computer Science
8747
, 2014, pp. 225-237
Parameterized complexity of induced graph matching on claw-free graphs
Danny Hermelin
,
Matthias Mnich
,
Erik Jan van Leeuwen
Algorithmica
70
(3), 2014, pp. 513-560
Algorithms to measure diversity and clustering in social networks through dot product graphs
Matthew Johnson
,
Daniël Paulusma
,
Erik Jan van Leeuwen
Lecture Notes in Computer Science
8283
, 2013, pp. 130-140
Integer representations of convex polygon intersection graphs
Tobias Müller
,
Erik Jan van Leeuwen
,
Jan van Leeuwen
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 205-231
Subexponential-time parameterized algorithm for Steiner tree on planar graphs
Marcin Pilipczuk
,
Michal Pilipczuk
,
Piotr Sankowski
,
Erik Jan van Leeuwen
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 353-364
On the complexity of metric dimension
Josep Díaz
,
Olli Pottonen
,
Maria Serna
,
Erik Jan van Leeuwen
Lecture Notes in Computer Science
7501
, 2012, pp. 419-430
Induced disjoint paths in AT-free graphs
Petr A. Golovach
,
Daniël Paulusma
,
Erik Jan van Leeuwen
Lecture Notes in Computer Science
7357
, 2012, pp. 153-164
Induced disjoint paths in claw-free graphs
Petr A. Golovach
,
Daniël Paulusma
,
Erik Jan van Leeuwen
Lecture Notes in Computer Science
7501
, 2012, pp. 515-526
Parameterized complexity of induced
H
-matching on claw-free graphs
Danny Hermelin
,
Matthias Mnich
,
Erik Jan van Leeuwen
Lecture Notes in Computer Science
7501
, 2012, pp. 624-635
Reducing a target interval to a few exact queries
Jesper Nederlof
,
Erik Jan van Leeuwen
,
Ruben van der Zwaan
Lecture Notes in Computer Science
7464
, 2012, pp. 718-727
Structure of polynomial-time approximation
Erik Jan van Leeuwen
,
Jan van Leeuwen
Theory of Computing Systems
50
(4), 2012, pp. 641-674
Spanners of bounded degree graphs
Fedor V. Fomin
,
Petr A. Golovach
,
Erik Jan van Leeuwen
Information Processing Letters
111
(3), 2011, pp. 142-144
Domination when the stars are out
Danny Hermelin
,
Matthias Mnich
,
Erik Jan van Leeuwen
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
6755
, 2011, pp. 462-473
Convex polygon intersection graphs
Erik Jan van Leeuwen
,
Jan van Leeuwen
Lecture Notes in Computer Science
6502
, 2011, pp. 377-388
Faster algorithms on branch and clique decompositions
Hans L. Bodlaender
,
Erik Jan van Leeuwen
,
Johan M.M. van Rooij
,
Martin Vatshelle
Lecture Notes in Computer Science
6281
, 2010, pp. 174-185
Approximation algorithms for unit disk graphs
Erik Jan van Leeuwen
Lecture Notes in Computer Science
3787
, 2005, pp. 351-361