Pages that link to "Item:Q3656850"

The following pages link to Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850):

Displaying 13 items.

• Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
• Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
• On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
• On complexities of minus domination (Q1751171) (← links)
• Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
• Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) (← links)
• Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
• Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
• Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
• Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
• Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
• Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)