Pages that link to "Item:Q3503580"
From MaRDI portal
The following pages link to Capacitated Domination and Covering: A Parameterized Perspective (Q3503580):
Displaying 36 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)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Complexity of secure sets (Q722534) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- Defensive alliances in graphs of bounded treewidth (Q1627877) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- The mixed Chinese postman problem parameterized by pathwidth and treedepth (Q2835842) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
- Parameterized Power Vertex Cover (Q3181050) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
- Structural Parameterizations of the Mixed Chinese Postman Problem (Q3452829) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5874480) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
- Offensive alliances in graphs (Q6201327) (← links)
