Alexander Langer

Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar: Evaluation of an MSO-Solver. ALENEX 2012: 55-63

Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS 2012: 326-337

Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar: Linear Kernels on Graphs Excluding Topological Minors. CoRR abs/1201.2780 (2012)

Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar: Linear kernels and single-exponential algorithms via protrusion decompositions. CoRR abs/1207.0835 (2012)

Joachim Kneis, Alexander Langer, Peter Rossmanith: A New Algorithm for Finding Trees with Many Leaves. Algorithmica 61(4): 882-897 (2011)

Joachim Kneis, Alexander Langer, Peter Rossmanith: Courcelle's theorem - A game-theoretic approach. Discrete Optimization 8(4): 568-594 (2011)

Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk: Breaking the 2ⁿ-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011)

Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. 412(45): 6290-6302 (2011)

Alexander Langer, Peter Rossmanith, Somnath Sikdar: Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). TAMC 2011: 505-516

Alexander Langer, Peter Rossmanith, Somnath Sikdar: Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory. CoRR abs/1102.0908 (2011)

Joachim Kneis, Alexander Langer, Peter Rossmanith: Courcelle's Theorem - A Game-Theoretic Approach. CoRR abs/1104.3905 (2011)

Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Lower Bounds on the Complexity of MSO1 Model-Checking. CoRR abs/1109.5804 (2011)

Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith: A Parameterized Route to Exact Puzzles: Breaking the 2ⁿ-Barrier for Irredundance. CIAC 2010: 311-322

Joachim Kneis, Alexander Langer: A Practical Approach to Courcelle's Theorem. Electr. Notes Theor. Comput. Sci. 251: 65-81 (2009)

Joachim Kneis, Alexander Langer, Peter Rossmanith: A Fine-grained Analysis of a Simple Independent Set Algorithm. FSTTCS 2009: 287-298

Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC 2009: 161-172

Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith: On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197

Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles. CoRR abs/0909.4224 (2009)

Joachim Kneis, Alexander Langer, Peter Rossmanith: A New Algorithm for Finding Trees with Many Leaves. ISAAC 2008: 270-281

Joachim Kneis, Alexander Langer, Peter Rossmanith: Improved Upper Bounds for Partial Vertex Cover. WG 2008: 240-251