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
- Faster exact algorithms for hard problems: A parameterized point of view
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- scientific article; zbMATH DE number 1688350 (Why is no real title available?)
- scientific article; zbMATH DE number 1696630 (Why is no real title available?)
- 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 1222098 (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 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2080206 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 1754598 (Why is no real title available?)
- scientific article; zbMATH DE number 1756013 (Why is no real title available?)
- scientific article; zbMATH DE number 1775386 (Why is no real title available?)
- scientific article; zbMATH DE number 2086399 (Why is no real title available?)
- scientific article; zbMATH DE number 1420918 (Why is no real title available?)
- scientific article; zbMATH DE number 1453052 (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 of vertex colouring
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Solving large FPT problems on coarse-grained parallel machines
- The complexity of type inference for higher-order typed lambda calculi
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
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1956210 (Why is no real title available?)
- scientific article; zbMATH DE number 2080999 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- 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
- Mathematical Foundations of Computer Science 2004
- Parameterized and Exact Computation
- Parameter compilation
- Multivariate complexity theory
- Algorithms – ESA 2004
- 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)
