Pages that link to "Item:Q6163635"
From MaRDI portal
The following pages link to What Is Known About Vertex Cover Kernelization? (Q6163635):
Displaying 7 items.
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory (Q2667823) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- Collaborating with Hans: Some Remaining Wonderments (Q5042446) (← links)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
- Disentangling the computational complexity of network untangling (Q6151149) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)