Follow
Alexander Langer
Alexander Langer
Verified email at cs.rwth-aachen.de
Title
Cited by
Cited by
Year
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
1212015
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
702011
Courcelle’s theorem—A game-theoretic approach
J Kneis, A Langer, P Rossmanith
Discrete Optimization 8 (4), 568-594, 2011
602011
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
602009
A new algorithm for finding trees with many leaves
J Kneis, A Langer, P Rossmanith
Algorithmica 61, 882-897, 2011
562011
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
542014
Process for reducing the fat content of meats
H Langer, A Langer
US Patent 3,780,191, 1973
491973
On digraph width measures in parameterized algorithmics
R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith
Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009 …, 2009
482009
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
452014
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
402014
Evaluation of an MSO-solver
A Langer, F Reidl, P Rossmanith, S Sikdar
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and …, 2012
392012
Improved upper bounds for partial vertex cover
J Kneis, A Langer, P Rossmanith
Graph-Theoretic Concepts in Computer Science: 34th International Workshop …, 2008
322008
A practical approach to Courcelle's theorem
J Kneis, A Langer
Electronic Notes in Theoretical Computer Science 251, 65-81, 2009
302009
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
282011
Lehrer beobachten und beurteilen Schüler
A Langer, H Langer, H Theimer
München: Oldenbourg, 1993
161993
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
132011
Ich übernehme eine 1. Klasse
H Langer, B Mang, P Walter, PH für einen guten Schulanfang
Oldenbourg, 2002
102002
Fast algorithms for decomposable graphs
AJ Langer
Aachen, Techn. Hochsch., Diss., 2013, 2013
92013
Ich übernehme eine 1
A Langer, H Langer, B Mang, P Walter
Klasse. München: Oldenburg Schulbuchverlag, 2002
62002
Linear kernels on graphs excluding topological minors
A Langer, F Reidl, P Rossmanith, S Sikdar
arXiv preprint arXiv:1201.2780, 2012
42012
The system can't perform the operation now. Try again later.
Articles 1–20