default search action
Nicolas Beldiceanu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c64]Ramiz Gindullin, Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Claude-Guy Quimper:
Composing Biases by Using CP to Decompose Minimal Functional Dependencies for Acquiring Complex Formulae. AAAI 2024: 8030-8037 - [c63]Arnold Hien, Samir Loudni, Maxime Garfagni, Albrecht Zimmermann, Nicolas Beldiceanu:
Fouille Interactive de Motifs à Haute Utilité. EGC 2024: 303-310 - 2023
- [c62]Ramiz Gindullin
, Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Claude-Guy Quimper:
Boolean-Arithmetic Equations: Acquisition and Uses. CPAIOR 2023: 378-394 - [i9]Jovial Cheukam-Ngouonou, Ramiz Gindullin, Nicolas Beldiceanu, Rémi Douence, Claude-Guy Quimper:
Proving Conjectures Acquired by Composing Multiple Biases. CoRR abs/2312.08990 (2023) - 2022
- [j19]Nicolas Beldiceanu:
De l'influence de Jacques Pitrat sur mes recherches en programmation par contraintes. Rev. Ouverte Intell. Artif. 3(1-2): 141-153 (2022) - [c61]Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Ramiz Gindullin
Acquiring Maps of Interrelated Conjectures on Sharp Bounds. CP 2022: 6:1-6:18 - 2020
- [j18]Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis
Invariants for time-series constraints. Constraints An Int. J. 25(3-4): 71-120 (2020) - [c60]Nicolas Beldiceanu, Maria-Isabel Restrepo-Ruiz, Helmut Simonis
Parameterised Bounds on the Sum of Variables in Time-Series Constraints. CPAIOR 2020: 82-98
2010 – 2019
- 2019
- [i8]Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis:
Synthesising a Database of Parameterised Linear and Non-Linear Invariants for Time-Series Constraints. CoRR abs/1901.09793 (2019) - [i7]Nicolas Beldiceanu, Mats Carlsson, Claude-Guy Quimper, Maria-Isabel Restrepo-Ruiz:
Classifying Pattern and Feature Properties to Get a Θ(n) Checker and Reformulation for Sliding Time-Series Constraints. CoRR abs/1912.01532 (2019) - 2018
- [j17]Ekaterina Arafailova
Deriving generic bounds for time-series constraints based on regular expressions characteristics. Constraints An Int. J. 23(1): 44-86 (2018) - 2017
- [j16]Nicolas Beldiceanu, Barbara Dumas Feris, Philippe Gravey, Md Sabbir Hasan, Claude Jard, Thomas Ledoux, Yunbo Li, Didier Lime
Towards energy-proportional clouds partially powered by renewable energy. Computing 99(1): 3-22 (2017) - [c59]Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis
Generating Linear Invariants for a Conjunction of Automata Constraints. CP 2017: 21-37 - [c58]Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis:
among Implied Constraints for Two Families of Time-Series Constraints. CP 2017: 38-54 - [c57]Nicolas Beldiceanu
Range-Consistent Forbidden Regions of Allen's Relations. CPAIOR 2017: 21-29 - [c56]Gilles Madi-Wamba, Yunbo Li, Anne-Cécile Orgerie
Green Energy Aware Scheduling Problem in Virtualized Datacenters. ICPADS 2017: 648-655 - [c55]Gilles Madi-Wamba, Yunbo Li, Anne-Cécile Orgerie
Cloud Workload Prediction and Generation Models. SBAC-PAD 2017: 89-96 - [i6]Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis:
Deriving Generic Bounds for Time-Series Constraints Based on Regular Expressions Characteristics. CoRR abs/1703.06783 (2017) - 2016
- [j15]Jean-Noël Monette
A parametric propagator for pairs of Sum constraints with a discrete convexity property. Artif. Intell. 241: 170-190 (2016) - [j14]Nicolas Beldiceanu, Mats Carlsson, Rémi Douence, Helmut Simonis
Using finite transducers for describing and synthesising structural time-series constraints. Constraints An Int. J. 21(1): 22-40 (2016) - [c54]Ekaterina Arafailova, Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints. CP 2016: 13-29 - [c53]Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Pierre Flener
Time-Series Constraints: Improvements and Application in CP and MIP Contexts. CPAIOR 2016: 18-34 - [c52]Gilles Madi-Wamba, Nicolas Beldiceanu:
The TaskIntersection Constraint. CPAIOR 2016: 246-261 - [p1]Nicolas Beldiceanu, Helmut Simonis
ModelSeeker: Extracting Global Constraint Models from Positive Examples. Data Mining and Constraint Programming 2016: 77-95 - [i5]Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez
Global Constraint Catalog, Volume II, Time-Series Constraints. CoRR abs/1609.08925 (2016) - [i4]Abderrahmane Aggoun, Nicolas Beldiceanu, Gilles Chabert, François Fages:
Packing with Complex Shapes. ERCIM News 2016(105) (2016) - 2015
- [j13]Arnaud Letort, Mats Carlsson, Nicolas Beldiceanu:
Synchronized sweep algorithms for scalable scheduling constraints. Constraints An Int. J. 20(2): 183-234 (2015) - [c51]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Xavier Lorca, Justin Pearson, Thierry Petit, Charles Prud'homme:
A Modelling Pearl with Sortedness Constraints. GCAI 2015: 27-41 - [c50]Nicolas Beldiceanu, Barbara Dumas Feris, Philippe Gravey, Md Sabbir Hasan, Claude Jard, Thomas Ledoux, Yunbo Li, Didier Lime, Gilles Madi-Wamba, Jean-Marc Menaud, Pascal Morel, Michel Morvan, Marie-Laure Moulinard, Anne-Cécile Orgerie, Jean-Louis Pazat, Olivier H. Roux, Ammar Sharaiha:
The EPOC Project - Energy Proportional and Opportunistic Computing System. SMARTGREENS 2015: 388-394 - 2014
- [j12]Nicolas Beldiceanu, Pierre Flener
Toward sustainable development in constraint programming. Constraints An Int. J. 19(2): 139-149 (2014) - [c49]Nicolas Beldiceanu, Pierre Flener, Justin Pearson, Pascal Van Hentenryck:
Propagating Regular Counting Constraints. AAAI 2014: 2616-2622 - [c48]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators. CP 2014: 142-157 - 2013
- [j11]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
On the reification of global constraints. Constraints An Int. J. 18(1): 1-6 (2013) - [j10]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
On matrices, automata, and double counting in constraint programming. Constraints An Int. J. 18(1): 108-140 (2013) - [c47]Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener
A Parametric Propagator for Discretely Convex Pairs of Sum Constraints. CP 2013: 529-544 - [c46]Nicolas Beldiceanu, Georgiana Ifrim
Describing and Generating Solutions for the EDF Unit Commitment Problem with the ModelSeeker. CP 2013: 733-748 - [c45]Arnaud Letort, Mats Carlsson, Nicolas Beldiceanu:
A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint. CPAIOR 2013: 144-159 - [c44]Naina Razakarison, Mats Carlsson, Nicolas Beldiceanu, Helmut Simonis:
GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials. SOCS 2013: 149-157 - [i3]Nicolas Beldiceanu, Pierre Flener, Justin Pearson, Pascal Van Hentenryck:
Propagating Regular Counting Constraints. CoRR abs/1309.7145 (2013) - 2012
- [c43]Nicolas Beldiceanu, Helmut Simonis:
A Model Seeker: Extracting Global Constraint Models from Positive Examples. CP 2012: 141-157 - [c42]Arnaud Letort, Nicolas Beldiceanu, Mats Carlsson:
A Scalable Sweep Algorithm for the cumulative Constraint. CP 2012: 439-454 - [c41]Nicolas Beldiceanu, Mats Carlsson, Thierry Petit, Jean-Charles Régin:
An O(nlog n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization. ECAI 2012: 145-150 - [e1]Nicolas Beldiceanu, Narendra Jussien, Eric Pinson:
Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - 9th International Conference, CPAIOR 2012, Nantes, France, May 28 - June1, 2012. Proceedings. Lecture Notes in Computer Science 7298, Springer 2012, ISBN 978-3-642-29827-1 [contents] - 2011
- [j9]Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey
New filtering for the cumulative constraint in the context of non-overlapping rectangles. Ann. Oper. Res. 184(1): 27-50 (2011) - [c40]Nicolas Beldiceanu, Helmut Simonis
A Constraint Seeker: Finding and Ranking Global Constraints from Examples. CP 2011: 12-26 - [c39]Alexis De Clercq, Thierry Petit, Nicolas Beldiceanu, Narendra Jussien:
Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource. CP 2011: 240-255 - [c38]Thierry Petit, Jean-Charles Régin, Nicolas Beldiceanu:
A Θ(n) Bound-Consistency Algorithm for the Increasing Sum Constraint. CP 2011: 721-728 - [c37]Thierry Petit, Nicolas Beldiceanu, Xavier Lorca
A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints. IJCAI 2011: 643-648 - [i2]Thierry Petit, Nicolas Beldiceanu, Xavier Lorca
A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints: Revised Edition that Incorporates One Correction. CoRR abs/1110.4719 (2011) - 2010
- [c36]Gilles Chabert, Nicolas Beldiceanu:
Sweeping with Continuous Domains. CP 2010: 137-151 - [c35]Nicolas Beldiceanu, Mats Carlsson, Pierre Flener
On Matrices, Automata, and Double Counting. CPAIOR 2010: 10-24 - [c34]Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca
The Increasing Nvalue Constraint. CPAIOR 2010: 25-39 - [i1]Abder Aggoun, Nicolas Beldiceanu, Mats Carlsson, François Fages:
Integrating Rule-Based Modelling and Constraint Programming for Solving Industrial Packing Problems. ERCIM News 2010(81) (2010)
2000 – 2009
- 2009
- [j8]Nicolas Beldiceanu, Irit Katriel, Xavier Lorca
Undirected forest constraints. Ann. Oper. Res. 171(1): 127-147 (2009) - [c33]Magnus Ågren, Nicolas Beldiceanu, Mats Carlsson, Mohamed Sbihi
Six Ways of Integrating Symmetries within Non-overlapping Constraints. CPAIOR 2009: 11-25 - 2008
- [j7]Nicolas Beldiceanu, Pierre Flener
Combining Tree Partitioning, Precedence, and Incomparability Constraints. Constraints An Int. J. 13(4): 459-489 (2008) - [c32]Emmanuel Poder, Nicolas Beldiceanu:
Filtering for a Continuous Multi-Resources cumulative Constraint with Resource Consumption and Production. ICAPS 2008: 264-271 - [c31]Mats Carlsson, Nicolas Beldiceanu, Julien Martin:
A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules. CP 2008: 220-234 - [c30]Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder:
New Filtering for the cumulative Constraint in the Context of Non-Overlapping Rectangles. CPAIOR 2008: 21-35 - 2007
- [j6]Nicolas Beldiceanu:
Introduction to the Special Issue on Global Constraints. Constraints An Int. J. 12(1): 1-2 (2007) - [j5]Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey
Global Constraint Catalogue: Past, Present and Future. Constraints An Int. J. 12(1): 21-62 (2007) - [c29]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 - [c28]Nicolas Beldiceanu, Xavier Lorca
Necessary Condition for Path Partitioning Constraints. CPAIOR 2007: 141-154 - [c27]Nicolas Beldiceanu, Emmanuel Poder:
A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production. CPAIOR 2007: 214-228 - 2006
- [j4]Nicolas Beldiceanu, Mats Carlsson, Sven Thiel:
Sweep synchronization as a global propagation mechanism. Comput. Oper. Res. 33(10): 2835-2851 (2006) - [j3]Nicolas Beldiceanu, Thierry Petit, Guillaume Rochart:
Bounds of graph parameters for global constraints. RAIRO Oper. Res. 40(4): 327-353 (2006) - [c26]Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey
Graph Properties Based Filtering. CP 2006: 59-74 - [c25]Nicolas Beldiceanu, Irit Katriel, Xavier Lorca
Undirected Forest Constraints. CPAIOR 2006: 29-43 - 2005
- [j2]Nicolas Beldiceanu, Mats Carlsson, Romuald Debruyne, Thierry Petit:
Reformulation of Global Constraints Based on Constraints Checkers. Constraints An Int. J. 10(4): 339-362 (2005) - [c24]Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Rampon, Charlotte Truchet:
Graph Invariants as Necessary Conditions for Global Constraints. CP 2005: 92-106 - [c23]Nicolas Beldiceanu, Thierry Petit, Guillaume Rochart:
Bounds of Graph Characteristics. CP 2005: 742-746 - [c22]Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
The tree Constraint. CPAIOR 2005: 64-78 - 2004
- [j1]Emmanuel Poder, Nicolas Beldiceanu, Eric Sanlaville
Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. Eur. J. Oper. Res. 153(1): 239-254 (2004) - [c21]Mats Carlsson, Nicolas Beldiceanu:
Dispensation Order Generation for Pyrosequencing. APBC 2004: 327-332 - [c20]Nicolas Beldiceanu, Mats Carlsson, Thierry Petit:
Deriving Filtering Algorithms from Constraint Checkers. CP 2004: 107-122 - [c19]Nicolas Beldiceanu, Irit Katriel, Sven Thiel:
Filtering Algorithms for the Same Constraint. CPAIOR 2004: 65-79 - [c18]Nicolas Beldiceanu, Thierry Petit:
Cost Evaluation of Soft Global Constraints. CPAIOR 2004: 80-95 - [c17]Nicolas Beldiceanu, Irit Katriel, Sven Thiel:
GCC-Like Restrictions on the Same Constraint. CSCLP 2004: 1-11 - [c16]Mats Carlsson, Nicolas Beldiceanu:
From Constraints to Finite Automata to Filtering Algorithms. ESOP 2004: 94-108 - [c15]Nicolas Beldiceanu, Emmanuel Poder:
The period Constraint. ICLP 2004: 329-342 - [c14]Nicolas Beldiceanu, Emmanuel Poder:
La contrainte période. JFPLC 2004 - 2003
- [b1]Nicolas Beldiceanu:
Contraintes Globales : Aspects Algorithmiques et Déclaratifs. (Global constraints: algorithmic and declarative aspects). Pierre and Marie Curie University, Paris, France, 2003 - 2002
- [c13]Nicolas Beldiceanu, Mats Carlsson:
A New Multi-resource cumulatives Constraint with Negative Heights. CP 2002: 63-79 - [c12]Magnus Ågren, Tamás Szeredi, Nicolas Beldiceanu, Mats Carlsson:
Tracing and Explaining Execution of CLP(FD) Programs. WLPE 2002: 1-16 - 2001
- [c11]Nicolas Beldiceanu:
Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family. CP 2001: 211-224 - [c10]Nicolas Beldiceanu, Mats Carlsson:
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint. CP 2001: 377-391 - [c9]Nicolas Beldiceanu, Qi Guo, Sven Thiel:
Non-overlapping Constraints between Convex Polytopes. CP 2001: 392-407 - [c8]Nicolas Beldiceanu, Mats Carlsson:
Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family. ICLP 2001: 59-73 - 2000
- [c7]Nicolas Beldiceanu:
Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type. CP 2000: 52-66 - [c6]Helmut Simonis, Abderrahmane Aggoun, Nicolas Beldiceanu, Eric Bourreau:
Complex Constraint Abstraction: Global Constraint Visualisation. Analysis and Visualization Tools for Constraint Programming 2000: 299-317
1990 – 1999
- 1992
- [c5]Abderrahmane Aggoun, Nicolas Beldiceanu:
Extending CHIP in order to solve complex scheduling and placement problems. JFPL 1992: 51- - 1991
- [c4]Abderrahmane Aggoun, Nicolas Beldiceanu:
Overview of the CHIP Compiler System. ICLP 1991: 775-789 - [c3]Abderrahmane Aggoun, Nicolas Beldiceanu:
Overview of the CHIP Compiler System. WCLP 1991: 421-435 - 1990
- [c2]Abderrahmane Aggoun, Nicolas Beldiceanu:
Time Stamps Techniques for the Trailed Data in Constraint Logic Programming Systems. SPLT 1990: 487-510
1980 – 1989
- 1988
- [c1]Younes Souissi, Nicolas Beldiceanu:
Deterministic Systems of Sequential Processes: Theory and Tools. Concurrency 1988: 380-400
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: