Alexander Langer

27 papers A 2B 2C 2Journal 14Unranked 5
YearRankTypeTitle / Venue / Authors
2016 J jnl
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions.
ACM Trans. Algorithms
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2014 J jnl
Digraph width measures in parameterized algorithmics.
Discret. Appl. Math.
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
2014 J jnl
Lower bounds on the complexity of MSO
J. Comput. Syst. Sci.
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2014 J jnl
Practical algorithms for MSO model-checking on tree-decomposable graphs.
Comput. Sci. Rev.
Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2013 — —
Fast algorithms for decomposable graphs.
Alexander Langer
2013 — conf
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions.
ICALP (1)
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2013 — ch.
Schnelle Algorithmen für zerlegbare Graphen.
Ausgezeichnete Informatikdissertationen
Alexander Langer
2012 A conf
Evaluation of an MSO-Solver.
ALENEX
Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2012 J jnl
Linear Kernels on Graphs Excluding Topological Minors
CoRR
Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2012 J jnl
Linear kernels and single-exponential algorithms via protrusion decompositions
CoRR
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2012 A conf
Lower Bounds on the Complexity of MSO_1 Model-Checking.
STACS
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2011 J jnl
A New Algorithm for Finding Trees with Many Leaves.
Algorithmica
Joachim Kneis, Alexander Langer, Peter Rossmanith
2011 J jnl
An exact algorithm for the Maximum Leaf Spanning Tree problem.
Theor. Comput. Sci.
Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2011 J jnl
Breaking the 2
J. Discrete Algorithms
Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk
2011 J jnl
Courcelle's Theorem - A Game-Theoretic Approach
CoRR
Joachim Kneis, Alexander Langer, Peter Rossmanith
2011 J jnl
Courcelle's theorem - A game-theoretic approach.
Discret. Optim.
Joachim Kneis, Alexander Langer, Peter Rossmanith
2011 J jnl
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
CoRR
Alexander Langer, Peter Rossmanith, Somnath Sikdar
2011 C conf
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract).
TAMC
Alexander Langer, Peter Rossmanith, Somnath Sikdar
2011 J jnl
Lower Bounds on the Complexity of MSO1 Model-Checking
CoRR
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2010 C conf
A Parameterized Route to Exact Puzzles: Breaking the 2
CIAC
Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith
2009 — conf
A Fine-grained Analysis of a Simple Independent Set Algorithm.
FSTTCS
Joachim Kneis, Alexander Langer, Peter Rossmanith
2009 — conf
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.
IWPEC
Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009 J jnl
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
CoRR
Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009 — conf
On Digraph Width Measures in Parameterized Algorithmics.
IWPEC
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
2008 B conf
A New Algorithm for Finding Trees with Many Leaves.
ISAAC
Joachim Kneis, Alexander Langer, Peter Rossmanith
2008 — conf
A Practical Approach to Courcelle's Theorem.
MEMICS
Joachim Kneis, Alexander Langer
2008 B conf
Improved Upper Bounds for Partial Vertex Cover.
WG
Joachim Kneis, Alexander Langer, Peter Rossmanith