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
972015
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
522009
Courcelle’s theorem—a game-theoretic approach
J Kneis, A Langer, P Rossmanith
Discrete Optimization 8 (4), 568-594, 2011
512011
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
482009
Process for reducing the fat content of meats
H Langer, A Langer
US Patent 3,780,191, 1973
451973
A new algorithm for finding trees with many leaves
J Kneis, A Langer, P Rossmanith
International Symposium on Algorithms and Computation, 270-281, 2008
422008
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
382011
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
302014
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
292014
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
282008
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
272014
Evaluation of an MSO-solver
A Langer, F Reidl, P Rossmanith, S Sikdar
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and …, 2012
272012
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
262009
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
252011
A practical approach to Courcelle's theorem
J Kneis, A Langer
Electronic Notes in Theoretical Computer Science 251, 65-81, 2009
212009
Lehrer beobachten und beurteilen Schüler
A Langer, H Langer, H Theimer
München: Oldenbourg, 1993
181993
A new algorithm for finding trees with many leaves
J Kneis, A Langer, P Rossmanith
Algorithmica 61 (4), 882-897, 2011
122011
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
122011
On Digraph Width Measures in Parameterized Algorithmics, Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009 …
R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith
Springer-Verlag, Berlin, Heidelberg, 2009
122009
Improved Upper Bounds for Partial Vertex Cover, Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30---July 2, 2008. Revised …
J Kneis, A Langer, P Rossmanith
Springer-Verlag, Berlin, Heidelberg, 2008
102008
The system can't perform the operation now. Try again later.
Articles 1–20