Pages that link to "Item:Q2498987"
From MaRDI portal
The following pages link to On the computational hardness based on linear fpt-reductions (Q2498987):
Displaying 13 items.
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Linear FPT reductions and computational lower bounds (Q3580971) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Computing and Combinatorics (Q5717021) (← links)
- Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
- Maximum locally irregular induced subgraphs via minimum irregulators (Q6671395) (← links)