The following pages link to Theoretical Computer Science (Q5395087):
Displaying 7 items.
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
- New bounds for the signless Laplacian spread (Q1736235) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
