On the public citation graph

Filtering Algorithms for the NValue Constraint

https://doi.org/10.1007/11493853_8
0 signed · 33 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-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/3-540-45578-7_31openalex-snapshot
Specific Filtering Algorithms for Over-Constrained Problems
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_53openalex-snapshot
The Tractability of Global Constraints
inferredcites →https://doi.org/10.1007/978-3-540-48085-3_24openalex-snapshot
Automatic Generation of Music Programs
inferredcites →https://doi.org/10.1007/bfb0011899openalex-snapshot
Deep Electromagnetic Exploration
inferredcites →https://doi.org/10.1016/0012-365x(93)90156-nopenalex-snapshot
Some eigenvalue properties in graphs (conjectures of Graffiti — II)
inferredcites →https://doi.org/10.1016/j.ipl.2005.03.010openalex-snapshot
Hitting sets when the VC-dimension is small
inferredcites →https://doi.org/10.1016/s0893-9659(97)00044-xopenalex-snapshot
Improved approximations for maximum independent set via approximation chains
inferredcites →https://doi.org/10.1145/195058.195221openalex-snapshot
Greed is good
inferredcites →https://doi.org/10.37236/1573openalex-snapshot
Values of Domination Numbers of the Queen's Graph
inferredcites →https://doi.org/10.4064/cm-13-2-251-254openalex-snapshot
On an extremal problem in graph theory
inferredcites →https://doi.org/10.4064/fm-33-1-303-307openalex-snapshot
Sur deux propriétés des classes d'ensembles

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11564751_10openalex-snapshot
Graph Invariants as Necessary Conditions for Global Constraints
inferred← citeshttps://doi.org/10.1007/11564751_105openalex-snapshot
From Linear Relaxations to Global Constraint Propagation
inferred← citeshttps://doi.org/10.1007/11564751_56openalex-snapshot
Bounds of Graph Characteristics
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_2openalex-snapshot
Hybrid Modeling
inferred← citeshttps://doi.org/10.1007/978-3-031-95976-9_10openalex-snapshot
Acquiring and Selecting Implied Constraints with an Application to the BinSeq and Partition Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_29openalex-snapshot
The Markov Transition Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_24openalex-snapshot
A Soft Constraint of Equality: Complexity and Approximability
inferred← citeshttps://doi.org/10.1007/978-3-540-89812-2_6openalex-snapshot
Combining Two Structured Domains for Modeling Various Graph Matching Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_18openalex-snapshot
A Constraint on the Number of Distinct Vectors with Application to Localization
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_5openalex-snapshot
The Increasing Nvalue Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_12openalex-snapshot
Decomposition of the NValue Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-17493-3_3openalex-snapshot
Parameterized Complexity Results in Symmetry Breaking
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_48openalex-snapshot
Breaking Variable Symmetry in Almost Injective Problems
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-9007-3openalex-snapshot
The Complexity of Reasoning with Global 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.tcs.2012.11.038openalex-snapshot
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
inferred← citeshttps://doi.org/10.1613/jair.1.11870openalex-snapshot
A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-095openalex-snapshot
Constraint satisfaction problems: convexity makes all different constraints tractable
inferred← citeshttps://doi.org/10.70675/a1f6523dzdb45z4592z8f08za5f73c510e11openalex-snapshot
Constraint programming models for conceptual clustering : Application to an erp configuration problem
inferred← citeshttps://doi.org/10.70675/b2bd12bdz0c54z4b14z9450zd529241890caopenalex-snapshot
Estimer le nombre de solutions sur les contraintes de cardinalité
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.