The following pages link to Alexander Langer (Q395002):
Displaying 18 items.
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- (Q2904773) (← links)
- A Fine-grained Analysis of a Simple Independent Set Algorithm (Q2920136) (← links)
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429) (← links)
- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance (Q3563012) (← links)
- A New Algorithm for Finding Trees with Many Leaves (Q3596725) (← links)
- An Exact Algorithm for the Maximum Leaf Spanning Tree Problem (Q3656859) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions (Q4962217) (← links)
- A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
- Evaluation of an MSO-Solver (Q5233717) (← links)
- Improved Upper Bounds for Partial Vertex Cover (Q5302059) (← links)