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 14 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)
- 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)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- (Q5075790) (← links)
- (Q5092402) (← links)
- Going Far from Degeneracy (Q5130907) (← 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)
