On the public citation graph

Among, Common and Disjoint Constraints

https://doi.org/10.1007/11754602_3
0 signed · 17 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.1007/3-540-45349-0_6openalex-snapshot
Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type
inferredcites →https://doi.org/10.1007/3-540-45578-7_15openalex-snapshot
Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_53openalex-snapshot
The Tractability of Global Constraints
inferredcites →https://doi.org/10.1016/0895-7177(94)90127-9openalex-snapshot
Introducing global constraints in CHIP
inferredcites →https://doi.org/10.1023/a:1009894810205openalex-snapshot
Increasing Constraint Propagation by Redundant Modeling: an Experience Report

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11889205_7openalex-snapshot
Graph Properties Based Filtering
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_3openalex-snapshot
among Implied Constraints for Two Families of Time-Series Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_8openalex-snapshot
The Conjunction of Interval Among Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_40openalex-snapshot
A Parametric Propagator for Discretely Convex Pairs of Sum Constraints
inferred← citeshttps://doi.org/10.1007/s10479-014-1582-xopenalex-snapshot
Weighted matching as a generic pruning technique applied to optimization constraints
inferred← citeshttps://doi.org/10.1007/s10601-006-9010-8openalex-snapshot
Global Constraint Catalogue: Past, Present and Future
inferred← citeshttps://doi.org/10.1016/j.artint.2009.03.001openalex-snapshot
Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2016.08.006openalex-snapshot
A parametric propagator for pairs of Sum constraints with a discrete convexity property
inferred← citeshttps://doi.org/10.1109/ictai.2017.00030openalex-snapshot
On Constraint Linear Decompositions Using Mathematical Variables
inferred← citeshttps://doi.org/10.1287/ijoc.2018.0855openalex-snapshot
Enriching Solutions to Combinatorial Problems via Solution Engineering
inferred← citeshttps://doi.org/10.4018/ijitwe.2016100102openalex-snapshot
A Constraint Programming Approach for Web Log Mining
inferred← citeshttps://doi.org/10.48550/arxiv.1311.6907openalex-snapshot
A Constraint Programming Approach for Mining Sequential Patterns in a Sequence Database
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.