On the public citation graph

Bounds of Graph Characteristics

https://doi.org/10.1007/11564751_56
0 signed · 20 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/11493853_8openalex-snapshot
Filtering Algorithms for the NValue Constraint
inferredcites →https://doi.org/10.1007/11564751_56openalex-snapshot
Bounds of Graph Characteristics
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/978-3-540-30201-8_11openalex-snapshot
Deriving Filtering Algorithms from Constraint Checkers
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_49openalex-snapshot
A Hyper-arc Consistency Algorithm for the Soft Alldifferent Constraint
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/s0743-1066(98)10006-7openalex-snapshot
Design, implementation, and evaluation of the constraint language cc(FD)
inferredcites →https://doi.org/10.4064/cm-13-2-251-254openalex-snapshot
On an extremal problem in graph theory

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118604304.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/11564751_10openalex-snapshot
Graph Invariants as Necessary Conditions for Global Constraints
inferred← citeshttps://doi.org/10.1007/11757375_5openalex-snapshot
Undirected Forest Constraints
inferred← citeshttps://doi.org/10.1007/11889205_64openalex-snapshot
Global Grammar Constraints
inferred← citeshttps://doi.org/10.1007/11889205_7openalex-snapshot
Graph Properties Based Filtering
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_3openalex-snapshot
Global Constraints: A Survey
inferred← citeshttps://doi.org/10.1007/s10479-008-0374-6openalex-snapshot
Undirected forest constraints
inferred← citeshttps://doi.org/10.1007/s10601-006-9010-8openalex-snapshot
Global Constraint Catalogue: Past, Present and Future
inferred← citeshttps://doi.org/10.1007/s10601-026-09386-5openalex-snapshot
The global constraint catalogue: a retrospective on organic growth and unplanned emergence
inferred← citeshttps://doi.org/10.70675/230e7222z1b32z46dfza6dczcc6894c4c230openalex-snapshot
Functional description of sequence constraints and synthesis of combinatorial objects
showing the first 10 of 11 · page through all 11
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.