Alexander Langer

According to our database, Alexander Langer authored at least 21 papers between 2008 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2014

Lower bounds on the complexity of MSO₁ model-checking.

Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar

J. Comput. Syst. Sci., 2014

Practical algorithms for MSO model-checking on tree-decomposable graphs.

Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar

Comput. Sci. Rev., 2014

2013

Fast algorithms for decomposable graphs.

Alexander Langer

PhD thesis, 2013

Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions.

Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Schnelle Algorithmen für zerlegbare Graphen.

Alexander Langer

Proceedings of the Ausgezeichnete Informatikdissertationen 2013, 2013

2012

Linear Kernels on Graphs Excluding Topological Minors

Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar

CoRR, 2012

Lower Bounds on the Complexity of MSO_1 Model-Checking.

Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Evaluation of an MSO-Solver.

Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011

Breaking the 2ⁿ-barrier for Irredundance: Two lines of attack.

Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk

J. Discrete Algorithms, 2011

Courcelle's theorem - A game-theoretic approach.

Joachim Kneis, Alexander Langer, Peter Rossmanith

Discret. Optim., 2011

Lower Bounds on the Complexity of MSO1 Model-Checking

Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar

CoRR, 2011

Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory

Alexander Langer, Peter Rossmanith, Somnath Sikdar

CoRR, 2011

Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract).

Alexander Langer, Peter Rossmanith, Somnath Sikdar

Proceedings of the Theory and Applications of Models of Computation, 2011

2010

A Parameterized Route to Exact Puzzles: Breaking the 2^<i>n</i>-Barrier for Irredundance.

Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles

Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith

CoRR, 2009

On Digraph Width Measures in Parameterized Algorithmics.

Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.

Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

A Fine-grained Analysis of a Simple Independent Set Algorithm.

Joachim Kneis, Alexander Langer, Peter Rossmanith

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008

A Practical Approach to Courcelle's Theorem.

Joachim Kneis, Alexander Langer

Proceedings of the International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2008

Improved Upper Bounds for Partial Vertex Cover.

Joachim Kneis, Alexander Langer, Peter Rossmanith

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

A New Algorithm for Finding Trees with Many Leaves.

Joachim Kneis, Alexander Langer, Peter Rossmanith

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008