Parameterized complexity: the main ideas and connections to practical computing
From MaRDI portal
Recommendations
Cites work
- A linear-time algorithm for computing the intersection of all odd cycles in a graph
- Computation Models for Parameterized Complexity
- Computing large and small stable models
- Coordinatized kernels and catalytic reductions: An improved FPT algorithm for Max Leaf Spanning Tree and other problems
- Describing parameterized complexity classes
- Faster exact algorithms for hard problems: A parameterized point of view
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Generalized model-checking problems for first-order logic
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256750 (Why is no real title available?)
- scientific article; zbMATH DE number 1341905 (Why is no real title available?)
- scientific article; zbMATH DE number 1775386 (Why is no real title available?)
- Kernels in planar digraphs
- On the complexity of database queries
- On the efficiency of polynomial time approximation schemes
- Parameterized complexity
- Parameterized complexity after (almost) ten years: Review and open questions
- Parameterized complexity of finding subgraphs with hereditary properties
- Parameterized complexity of vertex colouring
- Parameterized complexity: Exponential speed-up for planar graph problems
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Solving large FPT problems on coarse-grained parallel machines
- Subexponential parameterized algorithms collapse the W-hierarchy
- The complexity of type inference for higher-order typed lambda calculi
- The parameterized complexity of relational database queries and an improved characterization of \(W[1]\)
- Vertex cover: Further observations and further improvements
Cited in
(35)- The Turing way to parameterized complexity
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- Parameterized complexity in the polynomial hierarchy. Extending parameterized complexity theory to higher levels of the hierarchy
- Parameterized computational geometry via decomposition theorems
- Parametrized complexity theory.
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Parametrized complexity: New developments and research frontiers
- A parameterized complexity analysis of combinatorial feature selection problems
- A parameterized complexity tutorial
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
- A basic parameterized complexity primer
- Parameterized complexity and subexponential-time computability
- New races in parameterized algorithmics
- Reflections on multivariate algorithmics and problem parameterization
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 1341905 (Why is no real title available?)
- Computation Models for Parameterized Complexity
- Parameterized complexity
- Parameterized complexity: The main ideas and connections to practical computing
- Parameterized complexity: the main ideas and some research frontiers
- Parameterized complexity after (almost) ten years: Review and open questions
- Confronting intractability via parameters
- scientific article; zbMATH DE number 806748 (Why is no real title available?)
- Analysis parameterized algorithms on the bases of elasticity to functions complexity
- Parameterized Algorithms
- Ubiquitous parameterization -- invitation to fixed-parameter algorithms
- A structural view on parameterizing problems: Distance from triviality
- Parameter compilation
- Multivariate complexity theory
- A survey of FPT algorithm design techniques with an emphasis on recent advances and connections to practical computing
- Parameterized algorithms
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Algorithms and Data Structures
- Thick forests
This page was built for publication: Parameterized complexity: the main ideas and connections to practical computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841253)