Linear kernels and single-exponential algorithms via protrusion decompositions EJ Kim, A Langer, C Paul, F Reidl, P Rossmanith, I Sau, S Sikdar ACM Transactions on Algorithms (TALG) 12 (2), 1-41, 2015 | 106 | 2015 |

Courcelle’s theorem—a game-theoretic approach J Kneis, A Langer, P Rossmanith Discrete Optimization 8 (4), 568-594, 2011 | 59 | 2011 |

A fine-grained analysis of a simple independent set algorithm J Kneis, A Langer, P Rossmanith IARCS Annual Conference on Foundations of Software Technology and …, 2009 | 55 | 2009 |

On digraph width measures in parameterized algorithmics R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith International Workshop on Parameterized and Exact Computation, 185-197, 2009 | 46 | 2009 |

Process for reducing the fat content of meats H Langer, A Langer US Patent 3,780,191, 1973 | 46 | 1973 |

An exact algorithm for the maximum leaf spanning tree problem H Fernau, J Kneis, D Kratsch, A Langer, M Liedloff, D Raible, ... theoretical computer science 412 (45), 6290-6302, 2011 | 45 | 2011 |

A new algorithm for finding trees with many leaves J Kneis, A Langer, P Rossmanith International Symposium on Algorithms and Computation, 270-281, 2008 | 42 | 2008 |

Digraph width measures in parameterized algorithmics R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith Discrete applied mathematics 168, 88-107, 2014 | 36 | 2014 |

Practical algorithms for MSO model-checking on tree-decomposable graphs A Langer, F Reidl, P Rossmanith, S Sikdar Computer Science Review 13, 39-74, 2014 | 35 | 2014 |

Evaluation of an MSO-solver A Langer, F Reidl, P Rossmanith, S Sikdar 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and …, 2012 | 34 | 2012 |

Lower bounds on the complexity of MSO1 model-checking R Ganian, P Hliněný, A Langer, J Obdržálek, P Rossmanith, S Sikdar Journal of Computer and System Sciences 80 (1), 180-194, 2014 | 30 | 2014 |

Breaking the 2n-barrier for irredundance: Two lines of attack D Binkele-Raible, L Brankovic, M Cygan, H Fernau, J Kneis, D Kratsch, ... Journal of Discrete Algorithms 9 (3), 214-230, 2011 | 28 | 2011 |

Improved upper bounds for partial vertex cover J Kneis, A Langer, P Rossmanith International Workshop on Graph-Theoretic Concepts in Computer Science, 240-251, 2008 | 27 | 2008 |

An exact algorithm for the maximum leaf spanning tree problem H Fernau, J Kneis, D Kratsch, A Langer, M Liedloff, D Raible, ... International Workshop on Parameterized and Exact Computation, 161-172, 2009 | 26 | 2009 |

A practical approach to Courcelle's theorem J Kneis, A Langer Electronic Notes in Theoretical Computer Science 251, 65-81, 2009 | 21 | 2009 |

Lehrer beobachten und beurteilen Schüler A Langer, H Langer, H Theimer München: Oldenbourg, 1993 | 16 | 1993 |

A new algorithm for finding trees with many leaves J Kneis, A Langer, P Rossmanith Algorithmica 61 (4), 882-897, 2011 | 12 | 2011 |

Linear-time algorithms for graphs of bounded rankwidth: A fresh look using game theory A Langer, P Rossmanith, S Sikdar International Conference on Theory and Applications of Models of Computation …, 2011 | 12 | 2011 |

Parameterized and Exact Computation J Chen, FV Fomin 4th International Workshop, IWPEC, 10-11, 2009 | 7 | 2009 |

Fast algorithms for decomposable graphs AJ Langer RWTH Aachen University, 2013 | 6 | 2013 |