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.
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- Parameterized and approximation algorithms for the load coloring problem (Q2408202) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Untangling two systems of noncrossing curves (Q2630858) (← links)
- 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)