Pages that link to "Item:Q633768"
From MaRDI portal
The following pages link to Vertex cover problem parameterized above and below tight bounds (Q633768):
Displaying 25 items.
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
- A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- Tight gaps for vertex cover in the Sherali-Adams SDP hierarchy (Q2911610) (← links)
- Combining Two Worlds: Parameterised Approximation for Vertex Cover (Q3060750) (← links)
- Graph Layout Problems Parameterized by Vertex Cover (Q3596727) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- (Q5075790) (← links)
- (Q5092402) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- Parameterized Reductions and Algorithms for Another Vertex Cover Generalization (Q5199249) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- Detours in directed graphs (Q6113279) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
- Long directed detours: reduction to 2-disjoint paths (Q6551717) (← links)
- Approximating long cycle above Dirac's guarantee (Q6586667) (← links)