Pages that link to "Item:Q3580971"
From MaRDI portal
The following pages link to Linear FPT reductions and computational lower bounds (Q3580971):
Displayed 32 items.
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Parameterized maximum path coloring (Q392021) (← links)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- On finding the longest antisymmetric path in directed acyclic graphs (Q477694) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- On miniaturized problems in parameterized complexity theory (Q820145) (← links)
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- On recovering syntenic blocks from comparative maps (Q1041433) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- Some lower bounds in parameterized \(\mathrm{AC}^{0}\) (Q2417855) (← 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)
- On the independent set problem in random graphs (Q2804023) (← links)
- Parameterized Maximum Path Coloring (Q2891353) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- On the Variable Hierarchy of First-Order Spectra (Q2957699) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- On Recovering Syntenic Blocks from Comparative Maps (Q5505670) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- Communication and information complexity (Q6200329) (← links)