Pages that link to "Item:Q3455210"
From MaRDI portal
The following pages link to Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs (Q3455210):
Displaying 50 items.
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three (Q2668021) (← links)
- A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
- Exploring the subexponential complexity of completion problems (Q2828210) (← links)
- Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs (Q2839212) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
- An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- (Q4972036) (← links)
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- (Q5088957) (← links)
- (Q5090497) (← links)
- Decomposition of Map Graphs with Applications. (Q5091217) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
- Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
- Parameterized Algorithms for Generalized Domination (Q5505650) (← links)
- (Q5743379) (← links)
- (Q5743430) (← links)
- (Q5743499) (← links)
- (Q5743514) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
- The complexity of tree partitioning (Q5918926) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
