Pages that link to "Item:Q4815770"

The following pages link to The dominating set problem is fixed parameter tractable for graphs of bounded genus (Q4815770):

Displayed 11 items.

• Dominating set is fixed parameter tractable in claw-free graphs (Q650938) ‎ (← links)
• Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646) ‎ (← links)
• FPT algorithms for domination in sparse graphs and beyond (Q1740694) ‎ (← links)
• Revising Johnson's table for the 21st century (Q2091799) ‎ (← links)
• Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) ‎ (← links)
• A refined search tree technique for dominating set on planar graphs (Q2575830) ‎ (← links)
• Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) ‎ (← links)
• Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) ‎ (← links)
• Stronger ILPs for the Graph Genus Problem. (Q5075767) ‎ (← links)
• Maximum Cut Parameterized by Crossing Number (Q5119374) ‎ (← links)
• Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) ‎ (← links)