Pages that link to "Item:Q2508336"
From MaRDI portal
The following pages link to On the structure of parameterized problems in NP (Q2508336):
Displaying 20 items.
- Nested structure in parameterized rough reduction (Q278817) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- Parameterized power domination complexity (Q844180) (← links)
- On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- Bounded fixed-parameter tractability and reducibility (Q2382273) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance (Q3563012) (← links)
- On the Space Complexity of Parameterized Problems (Q4899254) (← links)
- (Q4972729) (← links)
- (Q5005177) (← links)
- A fixed-parameter-tractable algorithm for set packing (Q5957983) (← links)
