The following pages link to Frederic Dorn (Q391649):
Displaying 24 items.
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- Efficient Algorithms for Eulerian Extension (Q3057616) (← links)
- (Q3113754) (← links)
- Planar Subgraph Isomorphism Revisited (Q3113755) (← links)
- Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree (Q3189028) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm (Q3525775) (← links)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)
- Faster Parameterized Algorithms for Minor Containment (Q3569902) (← links)
- (Q3579494) (← links)
- Fast Minor Testing in Planar Graphs (Q3586454) (← links)
- Efficient Algorithms for Eulerian Extension and Rural Postman (Q5300482) (← links)
- Subexponential Parameterized Algorithms (Q5428794) (← links)
- Dynamic Programming and Fast Matrix Multiplication (Q5449535) (← links)
- Algorithms – ESA 2005 (Q5475822) (← links)
- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus (Q5757875) (← links)
