The following pages link to (Q5363786):
Displaying 9 items.
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Vertex Cover Structural Parameterization Revisited (Q3181056) (← links)
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
