The following pages link to Paths, Flowers and Vertex Cover (Q3092246):
Displaying 17 items.
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- A characterization of König-Egerváry graphs with extendable vertex covers (Q783699) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Above guarantee parameterization for vertex cover on graphs with maximum degree 4 (Q2111076) (← links)
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
- (Q4993600) (← links)
- (Q5090486) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- Balanced stable marriage: how close is close enough? (Q5918373) (← links)
