Improved Upper Bounds for Partial Vertex Cover. - Joachim Kneis; Alexander Langer; Peter Rossmanith (WG, 2008)

A Practical Approach to Courcelle's Theorem. - Joachim Kneis; Alexander Langer (MEMICS, 2008)

A Fine-grained Analysis of a Simple Independent Set Algorithm. - Joachim Kneis; Alexander Langer; Peter Rossmanith (FSTTCS, 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 001; Peter Rossmanith (CoRR, 2009)

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

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

A New Algorithm for Finding Trees with Many Leaves. - Joachim Kneis; Alexander Langer; Peter Rossmanith (Algorithmica, 2011)

Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - Alexander Langer; Peter Rossmanith; Somnath Sikdar (CoRR, 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)

Courcelle's theorem - A game-theoretic approach. - Joachim Kneis; Alexander Langer; Peter Rossmanith (Discret. Optim., 2011)

Breaking the 2n-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)

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

Evaluation of an MSO-Solver. - Alexander Langer; Felix Reidl; Peter Rossmanith; Somnath Sikdar (ALENEX, 2012)

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

Linear Kernels on Graphs Excluding Topological Minors - Alexander Langer; Felix Reidl; Peter Rossmanith; Somnath Sikdar (CoRR, 2012)

Schnelle Algorithmen für zerlegbare Graphen. - Alexander Langer (Ausgezeichnete Informatikdissertationen, 2013)

Fast algorithms for decomposable graphs. - Alexander Langer (2013)

Practical algorithms for MSO model-checking on tree-decomposable graphs. - Alexander Langer; Felix Reidl; Peter Rossmanith; Somnath Sikdar (Comput. Sci. Rev., 2014)

Digraph width measures in parameterized algorithmics. - Robert Ganian; Petr Hlinený; Joachim Kneis; Alexander Langer; Jan Obdrzálek; Peter Rossmanith (Discret. Appl. Math., 2014)

Lower bounds on the complexity of MSO1 model-checking. - Robert Ganian; Petr Hlinený; Alexander Langer; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (J. Comput. Syst. Sci., 2014)

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. - Eun Jung Kim 002; Alexander Langer; Christophe Paul; Felix Reidl; Peter Rossmanith; Ignasi Sau; Somnath Sikdar (ACM Trans. Algorithms, 2016)