Pages that link to "Item:Q2575830"

The following pages link to A refined search tree technique for dominating set on planar graphs (Q2575830):

Displaying 18 items.

• A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
• Guard games on graphs: keep the intruder out! (Q650877) (← links)
• Implicit branching and parameterized partial cover problems (Q657922) (← links)
• Multistage graph problems on a global budget (Q831134) (← links)
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
• Experiments on data reduction for optimal domination in networks (Q863574) (← links)
• Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
• Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
• A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
• Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646) (← links)
• On complexities of minus domination (Q1751171) (← links)
• Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
• Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
• An Experimental Study on Generating Planar Graphs (Q3004691) (← links)
• Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
• R<scp>OMAN DOMINATION</scp>: a parameterized perspective† (Q5438692) (← links)
• Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)