The following pages link to (Q4601874):
Displaying 7 items.
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS (Q5145291) (← links)
