Paradigms for parameterized enumeration
From MaRDI portal
Publication:2398214
DOI10.1007/s00224-016-9702-4zbMath1368.68221arXiv1306.2171OpenAlexW1772241399WikidataQ57998263 ScholiaQ57998263MaRDI QIDQ2398214
Nadia Creignou, Arne Meier, Heribert Vollmer, Johannes Schmidt, Julian Müller
Publication date: 15 August 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2171
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)
Related Items (6)
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework ⋮ Refined notions of parameterized enumeration kernels with applications to matching cut enumeration ⋮ Incremental delay enumeration: space and time ⋮ Parameterized aspects of triangle enumeration ⋮ Default logic and bounded treewidth ⋮ A multiparametric view on answer set programming
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Satisfiability of acyclic and almost acyclic CNF formulas
- Planar graph coloring is not self-reducible, assuming P\(\neq NP\)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- On generating all maximal independent sets
- Parametrized complexity theory.
- Tight lower bounds for certain parameterized NP-hard problems
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- Paradigms for Parameterized Enumeration
- Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight
- On generating all solutions of generalized satisfiability problems
- Theory and Applications of Satisfiability Testing
- The complexity of satisfiability problems
- A Polynomial Kernel for Proper Interval Vertex Deletion
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
- Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
This page was built for publication: Paradigms for parameterized enumeration
