Alexander Langer

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Evaluation of an MSO-Solver 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)	2019-09-12	Paper
Linear kernels and single-exponential algorithms via protrusion decompositions ACM Transactions on Algorithms	2018-10-30	Paper
Practical algorithms for MSO model-checking on tree-decomposable graphs Computer Science Review	2014-11-24	Paper
A Practical Approach to Courcelle's Theorem Electronic Notes in Theoretical Computer Science	2014-07-23	Paper
Digraph width measures in parameterized algorithmics Discrete Applied Mathematics	2014-04-02	Paper
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking Journal of Computer and System Sciences	2014-01-28	Paper
Linear kernels and single-exponential algorithms via protrusion decompositions Lecture Notes in Computer Science	2013-08-06	Paper
A fine-grained analysis of a simple independent set algorithm	2012-10-24	Paper
Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking	2012-08-23	Paper
Courcelle's theorem -- a game-theoretic approach Discrete Optimization	2012-04-05	Paper
An exact algorithm for the maximum leaf spanning tree problem Theoretical Computer Science	2012-01-09	Paper
A new algorithm for finding trees with many leaves Algorithmica	2011-12-14	Paper
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack Journal of Discrete Algorithms	2011-08-23	Paper
Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract) Lecture Notes in Computer Science	2011-07-01	Paper
A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance Lecture Notes in Computer Science	2010-05-28	Paper
An exact algorithm for the maximum leaf spanning tree problem Parameterized and Exact Computation	2010-01-14	Paper
On digraph width measures in parameterized algorithmics Parameterized and Exact Computation	2010-01-14	Paper
A New Algorithm for Finding Trees with Many Leaves Algorithms and Computation	2009-01-29	Paper
Improved Upper Bounds for Partial Vertex Cover Graph-Theoretic Concepts in Computer Science	2009-01-20	Paper

Research outcomes over time

This page was built for person: Alexander Langer