Pages that link to "Item:Q3455210"

The following pages link to Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs (Q3455210):

Displayed 50 items.

• (Total) vector domination for graphs with bounded branchwidth (Q290105) ‎ (← links)
• Approximate tree decompositions of planar graphs in linear time (Q306256) ‎ (← links)
• A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) ‎ (← links)
• Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) ‎ (← links)
• A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) ‎ (← links)
• Effective computation of immersion obstructions for unions of graph classes (Q395009) ‎ (← links)
• Local search: is brute-force avoidable? (Q439931) ‎ (← links)
• Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) ‎ (← links)
• Subexponential parameterized algorithms (Q458457) ‎ (← links)
• Confronting intractability via parameters (Q465686) ‎ (← links)
• Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) ‎ (← links)
• Computing cooperative solution concepts in coalitional skill games (Q490424) ‎ (← links)
• Improved induced matchings in sparse graphs (Q608287) ‎ (← links)
• Guard games on graphs: keep the intruder out! (Q650877) ‎ (← links)
• Faster parameterized algorithms for minor containment (Q650942) ‎ (← links)
• Spanners in sparse graphs (Q657919) ‎ (← links)
• Implicit branching and parameterized partial cover problems (Q657922) ‎ (← links)
• Covering nearly surface-embedded graphs with a fixed number of balls (Q741614) ‎ (← links)
• A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) ‎ (← links)
• Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) ‎ (← links)
• Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) ‎ (← links)
• Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) ‎ (← links)
• Computational study on planar dominating set problem (Q1040587) ‎ (← links)
• Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) ‎ (← links)
• On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) ‎ (← links)
• Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) ‎ (← links)
• Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) ‎ (← links)
• On the excluded minor structure theorem for graphs of large tree-width (Q1931397) ‎ (← links)
• Subexponential algorithms for partial cover problems (Q1944141) ‎ (← links)
• Contraction obstructions for treewidth (Q2275894) ‎ (← 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 $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)
• 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)
• Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) ‎ (← links)