On the public citation graph

CP(Graph): Introducing a Graph Computation Domain in Constraint Programming

https://doi.org/10.1007/11564751_18
0 signed · 95 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/11493853_7openalex-snapshot
The tree Constraint
inferredcites →https://doi.org/10.1007/11564751openalex-snapshot
Principles and Practice of Constraint Programming - CP 2005
inferredcites →https://doi.org/10.1007/11564751_74openalex-snapshot
Approximate Constrained Subgraph Matching
inferredcites →https://doi.org/10.1007/3-540-45349-0_6openalex-snapshot
Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type
inferredcites →https://doi.org/10.1007/3-540-46135-3openalex-snapshot
Principles and Practice of Constraint Programming - CP 2002
inferredcites →https://doi.org/10.1007/3-540-46135-3_42openalex-snapshot
Robust and Parallel Solving of a Network Design Problem
inferredcites →https://doi.org/10.1007/978-3-540-31845-3_20openalex-snapshot
A Mozart Implementation of CP(BioNet)
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_37openalex-snapshot
Maintaining Longest Paths Incrementally
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_47openalex-snapshot
Cost-Based Filtering for Shorter Path Constraints
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_54openalex-snapshot
To Be or Not to Be ... a Global Constraint
inferredcites →https://doi.org/10.1007/b106627openalex-snapshot
Multiparadigm Programming in Mozart/Oz
inferredcites →https://doi.org/10.1007/b13743openalex-snapshot
Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings
inferredcites →https://doi.org/10.1007/bf00137870openalex-snapshot
Interval propagation to reason about sets: Definition and implementation of a practical language
inferredcites →https://doi.org/10.1007/s10601-005-0554-9openalex-snapshot
Maintaining Longest Paths Incrementally
inferredcites →https://doi.org/10.1016/0004-3702(78)90029-2openalex-snapshot
A language and a program for stating and solving combinatorial problems
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferredcites →https://doi.org/10.1023/a:1020577603762openalex-snapshot
PSICO: Solving Protein Structures with Constraint Programming and Optimization
inferredcites →https://doi.org/10.1090/dimacs/031/02openalex-snapshot
On the expression of graph properties in some fragments of monadic second-order logic
inferredcites →https://doi.org/10.1093/bib/4.3.246openalex-snapshot
An overview of data models for the analysis of biochemical pathways
inferredcites →https://doi.org/10.1093/nar/gkh139openalex-snapshot
The aMAZE LightBench: a web interface to a relational database of cellular processes
inferredcites →https://doi.org/10.1145/502090.502095openalex-snapshot
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
inferredcites →https://doi.org/10.1287/trsc.32.1.12openalex-snapshot
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows

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.ch10openalex-snapshot
Symmetry Breaking in Subgraph Pattern Matching
inferred← citeshttps://doi.org/10.1002/9781118604304.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/net.21682openalex-snapshot
Partial target coverage to extend the lifetime in wireless multi‐role sensor networks
inferred← citeshttps://doi.org/10.1007/11564751_104openalex-snapshot
Speeding Up Constrained Path Solvers with a Reachability Propagator
inferred← citeshttps://doi.org/10.1007/11564751_74openalex-snapshot
Approximate Constrained Subgraph Matching
inferred← citeshttps://doi.org/10.1007/11603023_6openalex-snapshot
Using Dominators for Solving Constrained Path Problems
inferred← citeshttps://doi.org/10.1007/11889205_13openalex-snapshot
The Minimum Spanning Tree Constraint
inferred← citeshttps://doi.org/10.1007/11889205_46openalex-snapshot
General Symmetry Breaking Constraints
inferred← citeshttps://doi.org/10.1007/11889205_7openalex-snapshot
Graph Properties Based Filtering
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_14openalex-snapshot
Bioinformatics: A Challenge to Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_3openalex-snapshot
Global Constraints: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-59745-531-2_25openalex-snapshot
Representing and Analyzing Biochemical Networks Using BioMaze
inferred← citeshttps://doi.org/10.1007/978-3-030-30048-7_33openalex-snapshot
SolverCheck: Declarative Testing of Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-58942-4openalex-snapshot
Integration of Constraint Programming, Artificial Intelligence, and Operations Research
inferred← citeshttps://doi.org/10.1007/978-3-030-58942-4_29openalex-snapshot
Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_10openalex-snapshot
SAT Modulo Graphs: Acyclicity
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_41openalex-snapshot
MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-23219-5_41openalex-snapshot
Solving Segment Routing Problems with Hybrid Constraint Programming Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_13openalex-snapshot
A Bounded Path Propagator on Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_23openalex-snapshot
Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_53openalex-snapshot
Using Graph-Based CSP to Solve the Address Translation Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-50137-6_1openalex-snapshot
Introduction to Combinatorial Optimisation in Numberjack
inferred← citeshttps://doi.org/10.1007/978-3-319-98334-9_26openalex-snapshot
A Circuit Constraint for Multiple Tours Problems
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-72397-4_5openalex-snapshot
The “Not-Too-Heavy Spanning Tree” Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_51openalex-snapshot
Filtering for Subgraph Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-540-77002-2_53openalex-snapshot
GRASPER
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_5openalex-snapshot
Solving a Telecommunications Feature Subscription Configuration Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-87477-5_39openalex-snapshot
Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-88309-8_8openalex-snapshot
Using Indexed Finite Set Variables for Set Bounds Propagation
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-23786-7_22openalex-snapshot
Revisiting the tree Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_6openalex-snapshot
Route Finder: Efficiently Finding k Shortest Paths Using Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_19openalex-snapshot
Solving the Longest Simple Path Problem with Constraint-Based Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_28openalex-snapshot
Efficient Approximation of Well-Founded Justification and Well-Founded Domination
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_59openalex-snapshot
Atom Mapping with Constraint Programming
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-007-9040-xopenalex-snapshot
Combining Tree Partitioning, Precedence, and Incomparability Constraints
inferred← citeshttps://doi.org/10.1007/s10601-009-9074-3openalex-snapshot
Solving subgraph isomorphism problems with constraint programming
inferred← citeshttps://doi.org/10.1007/s10601-014-9178-2openalex-snapshot
The salesman and the tree: the importance of search in CP
inferred← citeshttps://doi.org/10.1007/s10601-015-9215-9openalex-snapshot
Portfolio approaches in constraint programming
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-019-09305-xopenalex-snapshot
Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs
inferred← citeshttps://doi.org/10.1007/s10601-021-09324-7openalex-snapshot
Global domain views for expressive and cross-domain constraint programming
inferred← citeshttps://doi.org/10.1007/s10732-021-09481-1openalex-snapshot
An adaptive large neighbourhood search algorithm for diameter bounded network design problems
inferred← citeshttps://doi.org/10.1007/s10817-016-9396-yopenalex-snapshot
Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.08.013openalex-snapshot
Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.10.020openalex-snapshot
Lazy Constraint Imposing for Improving the Path Constraint
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80021-0openalex-snapshot
Constraints over Structured Domains
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80029-5openalex-snapshot
Constraint Applications in Networks
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03004-0openalex-snapshot
Chapter 4 Constraint Programming
inferred← citeshttps://doi.org/10.1051/ro:2007001openalex-snapshot
Bounds of graph parameters for global constraints
inferred← citeshttps://doi.org/10.1109/dsd.2007.4341482openalex-snapshot
Graph Matching Constraints for Synthesis with Complex Components
inferred← citeshttps://doi.org/10.1109/dsd.2007.67openalex-snapshot
Graph Matching Constraints for Synthesis with Complex Components
inferred← citeshttps://doi.org/10.1145/1529282.1529595openalex-snapshot
LS(graph & tree)
inferred← citeshttps://doi.org/10.1145/1978802.1978809openalex-snapshot
Constraint programming systems for modeling music theories and composition
inferred← citeshttps://doi.org/10.1145/3191315.3191323openalex-snapshot
Exploring life: answer set programming in bioinformatics
inferred← citeshttps://doi.org/10.1186/s13015-014-0023-3openalex-snapshot
Atom mapping with constraint programming
inferred← citeshttps://doi.org/10.14279/depositonce-2848openalex-snapshot
Efficient Constraint Solving in Dynamic Languages
inferred← citeshttps://doi.org/10.1504/ijris.2010.029816openalex-snapshot
GRASPER: constraint reasoning with graphs
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10435openalex-snapshot
Steiner Tree Problems with Side Constraints Using Constraint Programming
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5498openalex-snapshot
Improved Filtering for the Euclidean Traveling Salesperson Problem in CLP(FD)
inferred← citeshttps://doi.org/10.21105/joss.04708openalex-snapshot
Choco-solver: A Java library for constraint programming
inferred← citeshttps://doi.org/10.3233/978-1-58603-936-3-55openalex-snapshot
A Heuristic Approach to the Cable Routing Problem in Electrical Panels
inferred← citeshttps://doi.org/10.4204/eptcs.325.38openalex-snapshot
Constraint Programming Algorithms for Route Planning Exploiting Geometrical Information
inferred← citeshttps://doi.org/10.4230/lipics.cp.2023.26openalex-snapshot
Guiding Backtrack Search by Tracking Variables During Constraint Propagation
inferred← citeshttps://doi.org/10.48550/arxiv.1206.3437openalex-snapshot
Improving the Asymmetric TSP by Considering Graph Structure
inferred← citeshttps://doi.org/10.48550/arxiv.1308.3923openalex-snapshot
Efficient Approximation of Well-Founded Justification and Well-Founded Domination (Corrected and Extended Version)
inferred← citeshttps://doi.org/10.5555/1782254.1782317openalex-snapshot
GRASPER: a framework for graph constraint satisfaction problems
inferred← citeshttps://doi.org/10.70675/22310761zc9c1z4e58za10bz9a14adfbb18bopenalex-snapshot
Trouver des Solutions Diverses en Programmation par Contraintes avec des Approches Probabilistes
inferred← citeshttps://doi.org/10.70675/4bd7f062z13ecz4bc2z80aazfd99a58b79fbopenalex-snapshot
Decomposition-based approaches for the design of energy efficient wireless sensor networks
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
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.