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):

Displaying 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)
• Contraction bidimensionality of geometric intersection graphs (Q832527) (← 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)
• Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
• FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
• Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
• A polynomial kernel for trivially perfect editing (Q1799208) (← links)
• On the excluded minor structure theorem for graphs of large tree-width (Q1931397) (← links)
• Subexponential algorithms for partial cover problems (Q1944141) (← links)
• 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)