On miniaturized problems in parameterized complexity theory
From MaRDI portal
Publication:820145
Recommendations
- Parameterized and Exact Computation
- The Parameterized Complexity of Maximality and Minimality Problems
- The parameterized complexity of maximality and minimality problems
- Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping
- Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping
Cites work
- scientific article; zbMATH DE number 5604125 (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?)
- Algorithms and Data Structures
- Automata, Languages and Programming
- Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems
- Fixed-parameter tractability, definability, and model-checking
- Linear FPT reductions and computational lower bounds
- On the complexity of \(k\)-SAT
- Vertex packings: Structural properties and algorithms
- Which problems have strongly exponential complexity?
Cited in
(36)- On the upward book thickness problem: combinatorial and complexity results
- Confronting intractability via parameters
- Parameterized and Exact Computation
- Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping
- Parameterized algorithms for module map problems
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
- Complexity of independency and cliquy trees
- Fine-grained parameterized complexity analysis of graph coloring problems
- Parameterized and subexponential-time complexity of satisfiability problems and applications
- An Isomorphism Between Subexponential and Parameterized Complexity Theory
- Parameterized and subexponential-time complexity of satisfiability problems and applications
- VC bounds on the cardinality of nearly orthogonal function classes
- Color spanning objects: algorithms and hardness results
- Compactors for parameterized counting problems
- Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping
- Covering graphs with few complete bipartite subgraphs
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- The Parameterized Complexity of Maximality and Minimality Problems
- On parameterized exponential time complexity
- Minimization problems for parity OBDDs
- On Parameterized Exponential Time Complexity
- Spined categories: generalizing tree-width beyond graphs
- Pursuing a fast robber on a graph
- On families of categorial grammars of bounded value, their learnability and related complexity questions
- Containment relations in split graphs
- Parameterized analysis and crossing minimization problems
- An annotated bibliography on 1-planarity
- Fixed-parameter decidability: extending parameterized complexity analysis
- Parameterized complexity and subexponential-time computability
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
- Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms
- Stable assignment with couples: parameterized complexity and local search
- Integer programming in parameterized complexity: five miniatures
- Domination and convexity problems in the target set selection model
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- Paths of bounded length and their cuts: parameterized complexity and algorithms
This page was built for publication: On miniaturized problems in parameterized complexity theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820145)
