On the public citation graph

Conservative constraint satisfaction re-revisited

0 signed · 51 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.10073openalex-snapshot
Bi‐arc graphs and the complexity of list homomorphisms
inferredcites →https://doi.org/10.1006/jctb.1997.1812openalex-snapshot
List Homomorphisms to Reflexive Graphs
inferredcites →https://doi.org/10.1007/978-1-4613-8130-3openalex-snapshot
A Course in Universal Algebra
inferredcites →https://doi.org/10.1007/s004939970003openalex-snapshot
List Homomorphisms and Circular Arc Graphs
inferredcites →https://doi.org/10.1016/0095-8956(90)90132-jopenalex-snapshot
On the complexity of H-coloring
inferredcites →https://doi.org/10.1016/0166-218x(94)90150-3openalex-snapshot
Algorithmic complexity of list colorings
inferredcites →https://doi.org/10.1016/j.engappai.2004.08.021openalex-snapshot
Constraint processing
inferredcites →https://doi.org/10.1016/s0004-3702(98)00022-8openalex-snapshot
Constraints, consistency and closure
inferredcites →https://doi.org/10.1016/s0304-3975(97)00230-2openalex-snapshot
On the algebraic structure of combinatorial problems
inferredcites →https://doi.org/10.1109/lics.2003.1210072openalex-snapshot
Tractable conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1109/lics.2011.25openalex-snapshot
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
inferredcites →https://doi.org/10.1109/sfcs.2002.1181990openalex-snapshot
A dichotomy theorem for constraints on a three-element set
inferredcites →https://doi.org/10.1137/090775646openalex-snapshot
Tractability and Learnability Arising from Algebras with Few Subpowers
inferredcites →https://doi.org/10.1137/s0097539700376676openalex-snapshot
Classifying the Complexity of Constraints Using Finite Algebras
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1142/s0218196709004956openalex-snapshot
ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
inferredcites →https://doi.org/10.1145/1120582.1120584openalex-snapshot
A dichotomy theorem for constraint satisfaction problems on a 3-element set
inferredcites →https://doi.org/10.1145/1970398.1970400openalex-snapshot
Complexity of conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1145/263867.263489openalex-snapshot
Closure properties of constraints
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.2168/lmcs-2(4:1)2006openalex-snapshot
Generalized Majority-Minority Operations are Tractable
inferredcites →https://doi.org/10.2307/2322184openalex-snapshot
A Course in Universal Algebra.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-57418-9_13openalex-snapshot
Aggregation of Votes with Multiple Positions on Each Issue
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_1openalex-snapshot
Constraint Satisfaction Problems: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/s00012-019-0626-0openalex-snapshot
Every quasitrivial n-ary semigroup is reducible to a semigroup
inferred← citeshttps://doi.org/10.1007/s00012-024-00865-5openalex-snapshot
Graphs of finite algebras: edges, and connectivity
inferred← citeshttps://doi.org/10.1007/s10601-015-9198-6openalex-snapshot
Tractability in constraint satisfaction problems: a survey
inferred← citeshttps://doi.org/10.1007/s10601-023-09341-8openalex-snapshot
The smallest hard trees
inferred← citeshttps://doi.org/10.1016/j.artint.2017.12.003openalex-snapshot
Constants and finite unary relations in qualitative constraint reasoning
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104437openalex-snapshot
Constraint Satisfaction Problems over semilattice block Mal'tsev algebras
inferred← citeshttps://doi.org/10.1017/9781107337534openalex-snapshot
Complexity of Infinite-Domain Constraint Satisfaction
inferred← citeshttps://doi.org/10.1109/focs.2017.37openalex-snapshot
A Dichotomy Theorem for Nonuniform CSPs
inferred← citeshttps://doi.org/10.1109/lics.2017.8005149openalex-snapshot
Constraint satisfaction problems over semilattice block Mal'tsev algebras
inferred← citeshttps://doi.org/10.1137/1.9781611977073.22openalex-snapshot
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
inferred← citeshttps://doi.org/10.1137/19m128212xopenalex-snapshot
Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy
inferred← citeshttps://doi.org/10.1137/25m1748901openalex-snapshot
Aggregation of Evaluations without Unanimity
inferred← citeshttps://doi.org/10.1142/s0218196723500327openalex-snapshot
The lattice of clones of self-dual operations collapsed
inferred← citeshttps://doi.org/10.1142/s0218196726500013openalex-snapshot
Network satisfaction problems solved by k -consistency
inferred← citeshttps://doi.org/10.1145/2933575.2933604openalex-snapshot
Graphs of relational structures
inferred← citeshttps://doi.org/10.1145/3292048.3292050openalex-snapshot
Constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/3377391.3377393openalex-snapshot
Foundations of Query Answering on Inconsistent Databases
inferred← citeshttps://doi.org/10.1145/3640814openalex-snapshot
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds
inferred← citeshttps://doi.org/10.11575/prism/31986openalex-snapshot
Bounded Width Dichotomies in Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1609/aaai.v35i7.16773openalex-snapshot
Network Satisfaction for Symmetric Relation Algebras with a Flexible Atom
inferred← citeshttps://doi.org/10.1613/jair.1.12476openalex-snapshot
On the Computational Complexity of Non-Dictatorial Aggregation
inferred← citeshttps://doi.org/10.1613/jair.1.14195openalex-snapshot
The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.50openalex-snapshot
Algorithmically Efficient Syntactic Characterization of Possibility Domains
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.91openalex-snapshot
Toward a Dichotomy for Approximation of $H$-coloring
inferred← citeshttps://doi.org/10.48550/arxiv.2006.10239openalex-snapshot
Local structure of idempotent algebras II
inferred← citeshttps://doi.org/10.48550/arxiv.2006.11713openalex-snapshot
Graphs of relational structures: restricted types
inferred← citeshttps://doi.org/10.48550/arxiv.2007.09099openalex-snapshot
A dichotomy theorem for nonuniform CSPs simplified
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.