scientific article; zbMATH DE number 1256750
From MaRDI portal
Publication:4228486
Recommendations
Cited in
(20)- PTAS for Sparse General-valued CSPs
- The approximability of non-Boolean satisfiability problems and restricted integer programming
- Max NP-completeness made easy
- Succinct certification of monotone circuits
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Satisfiability, branch-width and Tseitin tautologies
- Sublinear-space approximation algorithms for Max \(r\)-SAT
- Conjunctive query containment revisited
- scientific article; zbMATH DE number 7650083 (Why is no real title available?)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
- Complexity and Algorithms for Well-Structured k-SAT Instances
- Partition into cliques for cubic graphs: Planar case, complexity and approximation
- On MAX-SAT with cardinality constraint
- On planar valued CSPs
- Planar 3-SAT with a clause/variable cycle
- Parameterized complexity: the main ideas and connections to practical computing
- Intractability of assembly sequencing: unit disks in the plane
- Succinct monotone circuit certification: planarity and parameterized complexity
- On the efficiency of polynomial time approximation schemes
- Network pollution games
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228486)
