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
Hilfe
Suche: Author="M{\"o}lle, Daniel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Randomized divide-and-conquer: Improved path, matching, and packing algorithms
Jianer Chen
,
Joachim Kneis
,
Songjian Lu
,
Daniel Mölle
,
Stefan Richter
,
Peter Rossmanith
,
Sing-Hoi Sze
,
Fenghui Zhang
SIAM Journal on Computing
38
(6), 2009, pp. 2526-2547
A bound on the pathwidth of sparse graphs with applications to exact algorithms
Joachim Kneis
,
Daniel Mölle
,
Stefan Richter
,
Peter Rossmanith
SIAM Journal on Discrete Mathematics
23
(1), 2008-2009, pp. 407-427
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
Daniel Mölle
,
Stefan Richter
,
Peter Rossmantih
Theory of Computing Systems
43
(2), 2008, pp. 234-253
Parameterized power domination complexity
Joachim Kneis
,
Daniel Mölle
,
Stefan Richter
,
Peter Rossmanith
Information Processing Letters
98
(4), 2006, pp. 145-149
Divide-and-color
Joachim Kneis
,
Daniel Mölle
,
Stefan Richter
,
Peter Rossmanith
Lecture Notes in Computer Science
4271
, 2006, pp. 58-67
Intuitive algorithms and
t
-vertex cover
Joachim Kneis
,
Daniel Mölle
,
Stefan Richter
,
Peter Rossmanith
Lecture Notes in Computer Science
4288
, 2006, pp. 598-607
Enumerate and expand: New runtime bounds for vertex cover variants
Daniel Mölle
,
Stefan Richter
,
Peter Rossmanith
Lecture Notes in Computer Science
4112
, 2006, pp. 265-273
On the parameterized complexity of exact satisfiability problems
Joachim Kneis
,
Daniel Mölle
,
Stefan Richter
,
Peter Rossmanith
Lecture Notes in Computer Science
3618
, 2005, pp. 568-579
Algorithms based on the treewidth of sparse graphs
Joachim Kneis
,
Daniel Mölle
,
Stefan Richter
,
Peter Rossmanith
Lecture Notes in Computer Science
3787
, 2005, pp. 385-396