On the public citation graph

Combination of Among and Cardinality Constraints

https://doi.org/10.1007/11493853_22
0 signed · 24 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/978-1-4419-8917-8_4openalex-snapshot
Global Constraints and Filtering Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_40openalex-snapshot
Improved Algorithms for the Global Cardinality Constraint
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_42openalex-snapshot
The Cardinality Matrix Constraint
inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/b100482openalex-snapshot
Principles and Practice of Constraint Programming – CP 2004
inferredcites →https://doi.org/10.1007/bfb0017424openalex-snapshot
Principles and practice of constraint programming - CP 97 : Third International Conference, CP 97, Linz, Austria, October 29 - November 1, 1997 : proceedings
inferredcites →https://doi.org/10.1007/bfb0017428openalex-snapshot
A filtering algorithm for global sequencing constraints
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.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms

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_44openalex-snapshot
Revisiting the Sequence Constraint
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-10428-7_57openalex-snapshot
Solving a Judge Assignment Problem Using Conjunctions of Global Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_6openalex-snapshot
Conjunctions of Among Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_17openalex-snapshot
Encodings of the Sequence Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_11openalex-snapshot
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-89812-2_9openalex-snapshot
Generalizing Global Constraints Based on Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_52openalex-snapshot
Constraint-Level Advice for Shaving
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-39611-3_14openalex-snapshot
Automated Reencoding of Boolean Formulas
inferred← citeshttps://doi.org/10.1007/s10601-008-9067-7openalex-snapshot
New filtering algorithms for combinations of among constraints
inferred← citeshttps://doi.org/10.1007/s10601-014-9159-5openalex-snapshot
Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
inferred← citeshttps://doi.org/10.1109/ictai.2012.11openalex-snapshot
Propagating Polynomially (Integral) Linear Projection-Safe Global Cost Functions in WCSPs
inferred← citeshttps://doi.org/10.48550/arxiv.1706.05059openalex-snapshot
Conjunctions of Among Constraints
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.