Pages that link to "Item:Q1877709"

The following pages link to On the existence of subexponential parameterized algorithms (Q1877709):

Displaying 38 items.

• (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
• A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
• Subexponential parameterized algorithms (Q458457) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
• Structure of polynomial-time approximation (Q692893) (← links)
• Improved upper bounds for vertex cover (Q708228) (← links)
• Approximability of clique transversal in perfect graphs (Q724231) (← links)
• Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
• On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
• Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
• On parameterized exponential time complexity (Q1029333) (← links)
• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
• Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
• Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
• A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
• Component order connectivity in directed graphs (Q2165039) (← links)
• Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} (Q2300620) (← links)
• On subexponential and FPT-time inapproximability (Q2343081) (← links)
• Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
• Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
• Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
• An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← 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)
• Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
• Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← 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)
• Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
• Component order connectivity in directed graphs (Q6068236) (← links)