Pages that link to "Item:Q3434987"

The following pages link to Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up (Q3434987):

Displaying 44 items.

• (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
• New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
• Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
• On self-duality of branchwidth in graphs of bounded genus (Q411870) (← links)
• The complexity of two graph orientation problems (Q412352) (← links)
• A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
• Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
• Subexponential parameterized algorithms (Q458457) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
• Improved induced matchings in sparse graphs (Q608287) (← links)
• Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
• Dominating sets in plane triangulations (Q708360) (← links)
• Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
• Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
• Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
• Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
• On parameterized exponential time complexity (Q1029333) (← links)
• Computational study on planar dominating set problem (Q1040587) (← links)
• Tree-length equals branch-length (Q1044006) (← links)
• Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
• Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
• Twin-width and polynomial kernels (Q2093574) (← links)
• On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
• Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
• Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
• Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071) (← links)
• Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
• Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← 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)
• (Q4972036) (← links)
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
• Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
• Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
• Mobile Sensor Networks (Q5178095) (← links)
• Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
• Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
• Dynamic programming for graphs on surfaces (Q5501962) (← links)
• (Q5743379) (← links)
• Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
• A fast approximation algorithm for the maximum 2-packing set problem on planar graphs (Q6110632) (← links)