Pages that link to "Item:Q2568440"

The following pages link to Tight lower bounds for certain parameterized NP-hard problems (Q2568440):

Displaying 50 items.

• The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
• Courcelle's theorem for triangulations (Q346450) (← links)
• Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
• The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
• Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
• Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
• Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
• Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
• Treewidth governs the complexity of target set selection (Q456700) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
• An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
• The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
• A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
• Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
• Parameterized graph separation problems (Q820151) (← links)
• Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520) (← links)
• Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
• Strong computational lower bounds via parameterized complexity (Q856413) (← links)
• Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
• Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
• Searching the \(k\)-change neighborhood for TSP is W[1]-hard (Q924881) (← links)
• On parameterized exponential time complexity (Q1029333) (← links)
• On problems without polynomial kernels (Q1034099) (← links)
• Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
• Backdoors for linear temporal logic (Q1725638) (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• Improved integrality gap upper bounds for traveling salesperson problems with distances one and two (Q1754106) (← links)
• Parameterized two-player Nash equilibrium (Q1949741) (← links)
• Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
• Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
• Computing the depth distribution of a set of boxes (Q2049979) (← links)
• Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
• Fixed-parameter complexity and approximability of norm maximization (Q2340407) (← links)
• On structural parameterizations for the 2-club problem (Q2341718) (← links)
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
• On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
• Paradigms for parameterized enumeration (Q2398214) (← links)
• The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
• The parameterized complexity of stabbing rectangles (Q2428672) (← links)
• Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
• On the computational hardness based on linear fpt-reductions (Q2498987) (← 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)
• Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
• Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
• Strong Backdoors for Default Logic (Q2818000) (← links)
• Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)