On the public citation graph
A Maximal Tractable Class of Soft Constraints
0 signed · 46 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jctb.2000.1989openalex-snapshot
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_17openalex-snapshot
Soft Constraints: Complexity and Multimorphisms
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_10openalex-snapshot
Submodular functions and convexity
inferredcites →https://doi.org/10.1007/bf01415751openalex-snapshot
The cone of Monge matrices: Extremal rays and applications
inferredcites →https://doi.org/10.1016/0004-3702(92)90004-hopenalex-snapshot
Partial constraint satisfaction
inferredcites →https://doi.org/10.1016/0004-3702(92)90011-lopenalex-snapshot
Reasoning about qualitative temporal information
inferredcites →https://doi.org/10.1016/0004-3702(92)90020-xopenalex-snapshot
A generic arc-consistency algorithm and its specializations
inferredcites →https://doi.org/10.1016/0020-0255(74)90008-5openalex-snapshot
Networks of constraints: Fundamental properties and applications to picture processing
inferredcites →https://doi.org/10.1016/0166-218x(95)00103-xopenalex-snapshot
Perspectives of Monge properties in optimization
inferredcites →https://doi.org/10.1016/s0004-3702(98)00108-8openalex-snapshot
Maintaining reversible DAC for Max-CSP
inferredcites →https://doi.org/10.1016/s0004-3702(99)00012-0openalex-snapshot
Constraint satisfaction over connected row-convex constraints
inferredcites →https://doi.org/10.1016/s0165-0114(02)00134-3openalex-snapshot
Reduction operations in fuzzy or valued constraint satisfaction
inferredcites →https://doi.org/10.1023/a:1026441215081openalex-snapshot
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison
inferredcites →https://doi.org/10.1109/fuzzy.1994.343640openalex-snapshot
Fuzzy constraint satisfaction
inferredcites →https://doi.org/10.1109/lics.2003.1210072openalex-snapshot
Tractable conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1109/tsmc.1976.4309519openalex-snapshot
Scene Labeling by Relaxation Operations
inferredcites →https://doi.org/10.1137/1.9780898718546openalex-snapshot
Complexity Classifications of Boolean Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1137/s0097539792225297openalex-snapshot
The Complexity of Multiterminal Cuts
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.1137/s0097539799349948openalex-snapshot
The Approximability of Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1145/263867.263489openalex-snapshot
Closure properties of constraints
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1145/502090.502096openalex-snapshot
A combinatorial strongly polynomial algorithm for minimizing submodular functions
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.1287/opre.26.2.305openalex-snapshot
Minimizing a Submodular Function on a Lattice
inferredcites →https://doi.org/10.1515/9781400822539openalex-snapshot
Supermodularity and Complementarity
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118601457.ch12openalex-snapshot
Complexity of Constraint Languages
inferred← citeshttps://doi.org/10.1016/j.artint.2006.04.002openalex-snapshot
The complexity of soft constraint satisfaction
inferred← citeshttps://doi.org/10.1016/j.artint.2010.02.001openalex-snapshot
Soft arc consistency revisited
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103841openalex-snapshot
Tractability of explaining classifier decisions
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.003openalex-snapshot
Colouring, constraint satisfaction, and complexity
inferred← citeshttps://doi.org/10.1016/j.dam.2005.03.003openalex-snapshot
Supermodular functions and the complexity of MAX CSP
inferred← citeshttps://doi.org/10.1016/j.dam.2005.11.006openalex-snapshot
Minimum cost and list homomorphisms to semicomplete digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.09.023openalex-snapshot
Minimum cost homomorphisms to semicomplete multipartite digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.07.001openalex-snapshot
The expressive power of binary submodular functions
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.11.012openalex-snapshot
A dichotomy for minimum cost graph homomorphisms
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.06.006openalex-snapshot
The complexity of approximating conservative counting CSPs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.015openalex-snapshot
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.036openalex-snapshot
The expressive power of valued constraints: Hierarchies and collapses
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80012-xopenalex-snapshot
The Complexity of Constraint Languages
inferred← citeshttps://doi.org/10.1109/tpami.2007.1036openalex-snapshot
A Linear Programming Approach to Max-Sum Problem: A Review
inferred← citeshttps://doi.org/10.1111/anzs.12257openalex-snapshot
Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
inferred← citeshttps://doi.org/10.1613/jair.3197openalex-snapshot
Soft Constraints of Difference and Equality
inferred← citeshttps://doi.org/10.48550/arxiv.0708.3226openalex-snapshot
A Dichotomy Theorem for General Minimum Cost Homomorphism Problem
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.