On the public citation graph

Dynamic Lex Constraints

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/11564751_37openalex-snapshot
Breaking All Value Symmetries in Surjection Problems
inferredcites →https://doi.org/10.1007/11564751_5openalex-snapshot
Symmetry Definitions for Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/11889205_39openalex-snapshot
Constraint Programming Models for Graceful Graphs
inferredcites →https://doi.org/10.1007/3-540-45578-7_6openalex-snapshot
Global Cut Framework for Removing Symmetries
inferredcites →https://doi.org/10.1007/3-540-45578-7_7openalex-snapshot
Symmetry Breaking
inferredcites →https://doi.org/10.1007/3-540-46135-3_28openalex-snapshot
Groups and Constraints: Symmetry Breaking during Search
inferredcites →https://doi.org/10.1007/3-540-56804-2_33openalex-snapshot
On the satisfiability of symmetrical constrained satisfaction problems
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_23openalex-snapshot
Generic SBDD Using Computational Group Theory
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_81openalex-snapshot
Symmetry Breaking in Graceful Graphs
inferredcites →https://doi.org/10.1007/978-3-540-48085-3_6openalex-snapshot
Excluding Symmetries in Constraint-Based Search
inferredcites →https://doi.org/10.1007/s10601-004-5306-8openalex-snapshot
Symmetry Breaking Revisited
inferredcites →https://doi.org/10.1007/s10601-006-8059-8openalex-snapshot
Symmetry Definitions for Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1017/cbo9780511546549openalex-snapshot
Permutation Group Algorithms
inferredcites →https://doi.org/10.1287/inte.31.6.29.9647openalex-snapshot
Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470612309.ch7openalex-snapshot
Improved Models for Graceful Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_16openalex-snapshot
Local Symmetry Breaking During Search in CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_38openalex-snapshot
Model Restarts for Structural Symmetry Breaking
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_41openalex-snapshot
Breaking Symmetry with Different Orderings
inferred← citeshttps://doi.org/10.1007/s10472-009-9172-3openalex-snapshot
Static and dynamic structural symmetry breaking
inferred← citeshttps://doi.org/10.1007/s10601-008-9060-1openalex-snapshot
SymChaff: exploiting symmetry in a structure-aware satisfiability solver
inferred← citeshttps://doi.org/10.1007/s10601-009-9071-6openalex-snapshot
Constraint models for graceful graphs
inferred← citeshttps://doi.org/10.1007/s10601-012-9117-zopenalex-snapshot
Partial symmetry breaking by local search in the group
inferred← citeshttps://doi.org/10.1016/j.artint.2017.07.006openalex-snapshot
Towards breaking more composition symmetries in partial symmetry breaking
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03002-7openalex-snapshot
Chapter 2 Satisfiability Solvers
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)x0300-6openalex-snapshot
Handbook of Knowledge Representation
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8437openalex-snapshot
Symmetry Breaking Constraints: Recent Results
inferred← citeshttps://doi.org/10.48550/arxiv.2005.08954openalex-snapshot
On the Complexity of Breaking Symmetry
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.