 | 2009 |
|---|
| 40 |       | Magnus Ågren,
Nicolas Beldiceanu,
Mats Carlsson,
Mohamed Sbihi,
Charlotte Truchet,
Stéphane Zampelli:
Six Ways of Integrating Symmetries within Non-overlapping Constraints.
CPAIOR 2009: 11-25 |
| 2008 |
|---|
| 39 | | Mats Carlsson,
Nicolas Beldiceanu,
Julien Martin:
A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules.
CP 2008: 220-234 |
| 38 | | Nicolas Beldiceanu,
Mats Carlsson,
Emmanuel Poder:
New Filtering for the cumulative Constraint in the Context of Non-Overlapping Rectangles.
CPAIOR 2008: 21-35 |
| 37 |  | Emmanuel Poder,
Nicolas Beldiceanu:
Filtering for a Continuous Multi-Resources cumulative Constraint with Resource Consumption and Production.
ICAPS 2008: 264-271 |
| 36 | | Nicolas Beldiceanu,
Pierre Flener,
Xavier Lorca:
Combining Tree Partitioning, Precedence, and Incomparability Constraints.
Constraints 13(4): 459-489 (2008) |
| 2007 |
|---|
| 35 | | Nicolas Beldiceanu,
Mats Carlsson,
Emmanuel Poder,
R. Sadek,
Charlotte Truchet:
A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects.
CP 2007: 180-194 |
| 34 | | Nicolas Beldiceanu,
Xavier Lorca:
Necessary Condition for Path Partitioning Constraints.
CPAIOR 2007: 141-154 |
| 33 | | Nicolas Beldiceanu,
Emmanuel Poder:
A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production.
CPAIOR 2007: 214-228 |
| 32 | | Nicolas Beldiceanu:
Introduction to the Special Issue on Global Constraints.
Constraints 12(1): 1-2 (2007) |
| 31 | | Nicolas Beldiceanu,
Mats Carlsson,
Sophie Demassey,
Thierry Petit:
Global Constraint Catalogue: Past, Present and Future.
Constraints 12(1): 21-62 (2007) |
| 2006 |
|---|
| 30 | | Nicolas Beldiceanu,
Mats Carlsson,
Sophie Demassey,
Thierry Petit:
Graph Properties Based Filtering.
CP 2006: 59-74 |
| 29 | | Nicolas Beldiceanu,
Irit Katriel,
Xavier Lorca:
Undirected Forest Constraints.
CPAIOR 2006: 29-43 |
| 28 | | Nicolas Beldiceanu,
Mats Carlsson,
Sven Thiel:
Sweep synchronization as a global propagation mechanism.
Computers & OR 33(10): 2835-2851 (2006) |
| 2005 |
|---|
| 27 | | Nicolas Beldiceanu,
Thierry Petit,
Guillaume Rochart:
Bounds of Graph Characteristics.
CP 2005: 742-746 |
| 26 | | Nicolas Beldiceanu,
Mats Carlsson,
Jean-Xavier Rampon,
Charlotte Truchet:
Graph Invariants as Necessary Conditions for Global Constraints.
CP 2005: 92-106 |
| 25 | | Nicolas Beldiceanu,
Pierre Flener,
Xavier Lorca:
The tree Constraint.
CPAIOR 2005: 64-78 |
| 24 | | Nicolas Beldiceanu,
Mats Carlsson,
Romuald Debruyne,
Thierry Petit:
Reformulation of Global Constraints Based on Constraints Checkers.
Constraints 10(4): 339-362 (2005) |
| 2004 |
|---|
| 23 | | Mats Carlsson,
Nicolas Beldiceanu:
Dispensation Order Generation for Pyrosequencing.
APBC 2004: 327-332 |
| 22 | | Nicolas Beldiceanu,
Mats Carlsson,
Thierry Petit:
Deriving Filtering Algorithms from Constraint Checkers.
CP 2004: 107-122 |
| 21 | | Nicolas Beldiceanu,
Irit Katriel,
Sven Thiel:
Filtering Algorithms for the Same Constraint.
CPAIOR 2004: 65-79 |
| 20 | | Nicolas Beldiceanu,
Thierry Petit:
Cost Evaluation of Soft Global Constraints.
CPAIOR 2004: 80-95 |
| 19 | | Nicolas Beldiceanu,
Irit Katriel,
Sven Thiel:
GCC-Like Restrictions on the Same Constraint.
CSCLP 2004: 1-11 |
| 18 | | Mats Carlsson,
Nicolas Beldiceanu:
From Constraints to Finite Automata to Filtering Algorithms.
ESOP 2004: 94-108 |
| 17 | | Nicolas Beldiceanu,
Emmanuel Poder:
The period Constraint.
ICLP 2004: 329-342 |
| 16 | | Nicolas Beldiceanu,
Emmanuel Poder:
La contrainte période.
JFPLC 2004 |
| 15 | | Emmanuel Poder,
Nicolas Beldiceanu,
Eric Sanlaville:
Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.
European Journal of Operational Research 153(1): 239-254 (2004) |
| 2002 |
|---|
| 14 | | Nicolas Beldiceanu,
Mats Carlsson:
A New Multi-resource cumulatives Constraint with Negative Heights.
CP 2002: 63-79 |
| 13 | | Magnus Ågren,
Tamás Szeredi,
Nicolas Beldiceanu,
Mats Carlsson:
Tracing and Explaining Execution of CLP(FD) Programs.
WLPE 2002: 1-16 |
| 12 | | Magnus Ågren,
Tamás Szeredi,
Nicolas Beldiceanu,
Mats Carlsson:
Tracing and Explaining Execution of CLP(FD) Programs
CoRR cs.SE/0207047: (2002) |
| 2001 |
|---|
| 11 | | Nicolas Beldiceanu:
Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family.
CP 2001: 211-224 |
| 10 | | Nicolas Beldiceanu,
Mats Carlsson:
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint.
CP 2001: 377-391 |
| 9 | | Nicolas Beldiceanu,
Qi Guo,
Sven Thiel:
Non-overlapping Constraints between Convex Polytopes.
CP 2001: 392-407 |
| 8 | | Nicolas Beldiceanu,
Mats Carlsson:
Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family.
ICLP 2001: 59-73 |
| 2000 |
|---|
| 7 | | Helmut Simonis,
Abderrahmane Aggoun,
Nicolas Beldiceanu,
Eric Bourreau:
Complex Constraint Abstraction: Global Constraint Visualisation.
Analysis and Visualization Tools for Constraint Programming 2000: 299-317 |
| 6 | | Nicolas Beldiceanu:
Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type.
CP 2000: 52-66 |
| 1992 |
|---|
| 5 | | Abderrahmane Aggoun,
Nicolas Beldiceanu:
Extending CHIP in order to solve complex scheduling and placement problems.
JFPL 1992: 51- |
| 1991 |
|---|
| 4 | | Abderrahmane Aggoun,
Nicolas Beldiceanu:
Overview of the CHIP Compiler System.
ICLP 1991: 775-789 |
| 3 | | Abderrahmane Aggoun,
Nicolas Beldiceanu:
Overview of the CHIP Compiler System.
WCLP 1991: 421-435 |
| 1990 |
|---|
| 2 | | Abderrahmane Aggoun,
Nicolas Beldiceanu:
Time Stamps Techniques for the Trailed Data in Constraint Logic Programming Systems.
SPLT 1990: 487-510 |
| 1988 |
|---|
| 1 | | Younes Souissi,
Nicolas Beldiceanu:
Deterministic Systems of Sequential Processes: Theory and Tools.
Concurrency 1988: 380-400 |
