On the public citation graph

Graph Properties Based Filtering

https://doi.org/10.1007/11889205_7
0 signed · 27 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/11564751openalex-snapshot
Principles and Practice of Constraint Programming - CP 2005
inferredcites →https://doi.org/10.1007/11564751_10openalex-snapshot
Graph Invariants as Necessary Conditions for Global Constraints
inferredcites →https://doi.org/10.1007/11564751_18openalex-snapshot
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
inferredcites →https://doi.org/10.1007/11564751_56openalex-snapshot
Bounds of Graph Characteristics
inferredcites →https://doi.org/10.1007/11754602_3openalex-snapshot
Among, Common and Disjoint Constraints
inferredcites →https://doi.org/10.1007/11757375_5openalex-snapshot
Undirected Forest Constraints
inferredcites →https://doi.org/10.1007/11889205_7openalex-snapshot
Graph Properties Based Filtering
inferredcites →https://doi.org/10.1007/3-540-45578-7openalex-snapshot
Principles and practice of constraint programming - CP 2001 : 7th International Conference, CP 2001, Paphos, Cyprus, November 26-December 1, 2001 : proceedings
inferredcites →https://doi.org/10.1007/3-540-45578-7_13openalex-snapshot
A Filtering Algorithm for the Stretch Constraint
inferredcites →https://doi.org/10.1007/3-540-61310-2_29openalex-snapshot
A new approach to computing optimal schedules for the job-shop scheduling problem
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-72397-4_17openalex-snapshot
Replenishment Planning for Stochastic Inventory Systems with Shortage Cost
inferredcites →https://doi.org/10.1007/978-3-540-73817-6_11openalex-snapshot
Cost-Based Filtering for Stochastic Inventory Control
inferredcites →https://doi.org/10.1007/b100482openalex-snapshot
Principles and Practice of Constraint Programming – CP 2004
inferredcites →https://doi.org/10.1016/0895-7177(94)90127-9openalex-snapshot
Introducing global constraints in CHIP
inferredcites →https://doi.org/10.1109/sfcs.1975.5openalex-snapshot
An O (N2.5) algorithm for maximum matching in general graphs
inferredcites →https://doi.org/10.1109/sfcs.1980.12openalex-snapshot
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

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-1-4419-1644-0_3openalex-snapshot
Global Constraints: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-98334-9_33openalex-snapshot
Unifying Reserve Design Strategies with Graph Theory and Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_19openalex-snapshot
An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-981-32-9931-3_24openalex-snapshot
Makespan Optimization in Open Shop Scheduling
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-015-9231-9openalex-snapshot
Range-only SLAM with indistinguishable landmarks; a constraint programming approach
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.48550/arxiv.2105.00663openalex-snapshot
Bounds of MIN_NCC and MAX_NCC and filtering scheme for graph domain variables
inferred← citeshttps://doi.org/10.70675/6ece687dz38baz44b2zbb3az1b4db8558cd4openalex-snapshot
Constraint-based systematic conservation planning, a generic and expressive approach : application to decision support in the conservation of New Caledonian forests
showing the first 9 of 10 · page through all 10
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.