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="Kneis, Joachim"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An exact algorithm for the Maximum Leaf Spanning Tree problem
Henning Fernau
,
Joachim Kneis
,
Dieter Kratsch
,
Alexander Langer
,
Mathieu Liedloff
,
Daniel Raible
,
Peter Rossmanith
Theoretical Computer Science
412
(45), 2011, pp. 6290-6302
A new algorithm for finding trees with many leaves
Joachim Kneis
,
Alexander Langer
,
Peter Rossmanith
Algorithmica
61
(4), 2011, pp. 882-897
A parameterized route to exact puzzles: Breaking the
2^n
-barrier for irredundance
Daniel Binkele-Raible
,
Ljiljana Brankovic
,
Henning Fernau
,
Joachim Kneis
,
Dieter Kratsch
,
Alexander Langer
,
Mathieu Liedloff
,
Peter Rossmanith
Lecture Notes in Computer Science
6078
, 2010, pp. 311-322
Approximation hardness of deadline-TSP reoptimization
Hans-Joachim Böckenhauer
,
Joachim Kneis
,
Joachim Kupke
Theoretical Computer Science
410
(21-23), 2009, pp. 2241-2249
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 fine-grained analysis of a simple independent set algorithm
Joachim Kneis
,
Alexander Langer
,
Peter Rossmanith
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 287-298
Improved upper bounds for partial vertex cover
Joachim Kneis
,
Alexander Langer
,
Peter Rossmanith
Lecture Notes in Computer Science
5344
, 2008, pp. 240-251
A new algorithm for finding trees with many leaves
Joachim Kneis
,
Alexander Langer
,
Peter Rossmanith
Lecture Notes in Computer Science
5369
, 2008, pp. 270-281
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
The parameterized approximability of TSP with deadlines
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Joachim Kneis
,
Joachim Kupke
Theory of Computing Systems
41
(3), 2007, pp. 431-444
On the approximation hardness of some generalizations of TSP
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Joachim Kneis
,
Joachim Kupke
Lecture Notes in Computer Science
4059
, 2006, pp. 184-195
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
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