Pages that link to "Item:Q1877709"
From MaRDI portal
The following pages link to On the existence of subexponential parameterized algorithms (Q1877709):
Displayed 18 items.
- Structure of polynomial-time approximation (Q692893) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Parameterized Algorithms for Generalized Domination (Q5505650) (← links)