Pages that link to "Item:Q4575661"
From MaRDI portal
The following pages link to Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee (Q4575661):
Displaying 16 items.
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Above guarantee parameterization for vertex cover on graphs with maximum degree 4 (Q2111076) (← links)
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
- The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- (Q5075790) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- (Q5090486) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- Elimination Distances, Blocking Sets, and Kernels for Vertex Cover (Q5099101) (← links)
- Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Balanced stable marriage: how close is close enough? (Q5918373) (← links)
- Detours in directed graphs (Q6113279) (← links)
