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="Langer, Alexander"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds on the complexity of
MSO_1
model-checking
Robert Ganian
,
Petr Hlinȇný
,
Alexander Langer
,
Jan Obdrz̑álek
,
Peter Rossmanith
,
Somnath Sikdar
Journal of Computer and System Sciences
80
(1), 2014, pp. 180-194
Linear kernels and single-exponential algorithms via protrusion decompositions
Eun Jung Kim
,
Alexander Langer
,
Christophe Paul
,
Felix Reidl
,
Peter Rossmanith
,
Ignasi Sau
,
Somnath Sikdar
Lecture Notes in Computer Science
7965
, 2013, pp. 613-624
Lower bounds on the complexity of MSO
_1
model-checking
Robert Ganian
,
Petr Hlinȇný
,
Alexander Langer
,
Jan Obdrz̑álek
,
Peter Rossmanith
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 326-337
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
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