Pages that link to "Item:Q1849745"

The following pages link to Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs (Q1849745):

Displaying 30 items.

• Kernels in planar digraphs (Q2485283) (← links)
• Improved bottleneck domination algorithms (Q2499580) (← links)
• A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
• On Complexities of Minus Domination (Q2867118) (← links)
• Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
• Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
• Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
• Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
• Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
• Tree Decompositions of Graphs: Saving Memory in Dynamic Programming (Q3439128) (← links)
• Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
• Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
• How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
• A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
• Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
• Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
• (Q4972036) (← links)
• Fast Algorithms for Join Operations on Tree Decompositions (Q5042462) (← links)
• Decomposition of Map Graphs with Applications. (Q5091217) (← links)
• (Q5092402) (← links)
• Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
• Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055) (← links)
• (Q5743379) (← links)
• Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
• Tree-decompositions of small pathwidth (Q5916128) (← links)
• Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
• On the kernel and related problems in interval digraphs (Q6103517) (← links)
• The parameterized complexity of the survivable network design problem (Q6655676) (← links)