| 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 | 116 | 2015 |
| Courcelle’s theorem—A game-theoretic approach J Kneis, A Langer, P Rossmanith Discrete Optimization 8 (4), 568-594, 2011 | 61 | 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 | 56 | 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 | 50 | 2009 |
| Process for reducing the fat content of meats H Langer, A Langer US Patent 3,780,191, 1973 | 49 | 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 | 47 | 2011 |
| 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 | 44 | 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 | 43 | 2014 |
| 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 |
| Evaluation of an MSO-solver A Langer, F Reidl, P Rossmanith, S Sikdar 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and …, 2012 | 39 | 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 | 34 | 2014 |
| 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 | 31 | 2008 |
| 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 |
| 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 | 23 | 2009 |
| Lehrer beobachten und beurteilen Schüler A Langer, H Langer, H Theimer München, 1983 | 16 | 1983 |
| A new algorithm for finding trees with many leaves J Kneis, A Langer, P Rossmanith Algorithmica 61 (4), 882-897, 2011 | 14 | 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 | 13 | 2011 |
| Fast algorithms for decomposable graphs AJ Langer Aachen, Techn. Hochsch., Diss., 2013, 2013 | 7 | 2013 |
| Ich übernehme eine 1. Klasse H Langer, B Mang, P Walter, PH für einen guten Schulanfang Oldenbourg, 2002 | 5 | 2002 |
