On the public citation graph

Search Heuristics and Heavy-Tailed Behaviour

https://doi.org/10.1007/11564751_26
0 signed · 31 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.1002/(sici)1520-6610(1996)4:6<405::aid-jcd3>3.0.co;2-jopenalex-snapshot
Generating uniformly distributed random latin squares
inferredcites →https://doi.org/10.1007/3-540-58601-6_86openalex-snapshot
Contradicting conventional wisdom in constraint satisfaction
inferredcites →https://doi.org/10.1007/3-540-59479-5_23openalex-snapshot
In search of exceptionally difficult constraint satisfaction problems
inferredcites →https://doi.org/10.1007/3-540-61551-2_66openalex-snapshot
MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_6openalex-snapshot
Statistical Regimes Across Constrainedness Regions
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/bfb0017434openalex-snapshot
Heavy-tailed distributions in combinatorial search
inferredcites →https://doi.org/10.1007/s10601-005-2807-zopenalex-snapshot
Statistical Regimes Across Constrainedness Regions
inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot
Consistency in networks of relations
inferredcites →https://doi.org/10.1016/0004-3702(80)90051-xopenalex-snapshot
Increasing tree search efficiency for constraint satisfaction problems
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0004-3702(94)90088-4openalex-snapshot
The hardest constraint problems: A double phase transition
inferredcites →https://doi.org/10.1016/0004-3702(94)90109-0openalex-snapshot
Easy problems are sometimes hard
inferredcites →https://doi.org/10.1016/0097-3165(83)90031-6openalex-snapshot
Embedding partial steiner triple systems is NP-complete
inferredcites →https://doi.org/10.1016/s1571-0653(04)00310-5openalex-snapshot
Balance and Filtering in Structured Satisfiable Problems (Preliminary Report)
inferredcites →https://doi.org/10.1023/a:1006314320276openalex-snapshot
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1109/ictai.2004.37openalex-snapshot
Backjump-based techniques versus conflict-directed heuristics
inferredcites →https://doi.org/10.1145/359094.359101openalex-snapshot
New methods to color the vertices of a graph

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11861461_8openalex-snapshot
Using Local Search for Guiding Enumeration in Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-21434-9_5openalex-snapshot
Learning a Mixture of Search Heuristics
inferred← citeshttps://doi.org/10.1007/s10601-006-8061-1openalex-snapshot
The Impact of Search Heuristics on Heavy-Tailed Behaviour
inferred← citeshttps://doi.org/10.1016/j.artint.2009.09.002openalex-snapshot
Reasoning from last conflict(s) in constraint programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80008-8openalex-snapshot
Backtracking Search Algorithms
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1142/s0218213008004023openalex-snapshot
RANDOM SUBSETS SUPPORT LEARNING A MIXTURE OF HEURISTICS
inferred← citeshttps://doi.org/10.3233/sat190009openalex-snapshot
Recording and Minimizing Nogoods from Restarts
inferred← citeshttps://doi.org/10.3233/sat190010openalex-snapshot
Using SAT Encodings to Derive CSP Value Ordering Heuristics
inferred← citeshttps://doi.org/10.5897/sre11.891openalex-snapshot
Hybrid strategies of enumeration in constraint solving
inferred← citeshttps://doi.org/10.70675/17f60f5aza03ez4c04zaf96z605fe438f7a6openalex-snapshot
Compilation de connaissances pour le comptage de modèles
inferred← citeshttps://doi.org/10.70675/f4e01b3dzb0c0z48cazb512z9fce896739e7openalex-snapshot
Une nouvelle approche au General Game Playing dirigée par les contraintes
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.