The following pages link to STACS 2005 (Q5710681):
Displaying 7 items.
- Subexponential parameterized algorithms (Q458457) (← links)
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
- Experiments on data reduction for optimal domination in networks (Q863574) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Truncation in Duality and Intertwining Kernels (Q5124157) (← links)