Home » Fiche   membre
Fiche   membre Retour à l'annuaire  

Nicolas BELDICEANU

ENSEIGNANT-CHERCHEUR

HDR
Responsable d'équipe
Equipe : TASC.

Adresse :

IMT Atlantique Bretagne-Pays de la Loire Ecole Mines-Telecom ( IMT ATLANTIQUE )
La Chantrerie
4, rue Alfred Kastler
B.P. 20722
44307 NANTES Cedex 3



Publications référencées sur HAL

Revues internationales avec comité de lecture (ART_INT)

    • [1] E. Arafailova, N. Beldiceanu, H. Simonis. Deriving generic bounds for time-series constraints based on regular expressions characteristics. In Constraints ; éd. Springer Verlag, 2018, vol. 23, num. 1.
      https://hal.inria.fr/hal-01685567
    • [2] N. Beldiceanu, B. Dumas Feris, P. Gravey, M. Hasan, C. Jard, T. Ledoux, Y. Li, D. Lime, G. Madi-Wamba, J. Menaud, P. Morel, M. Morvan, M. MOULINARD, A. Orgerie, J. Pazat, O. Roux, A. Sharaiha. Towards energy-proportional Clouds partially powered by renewable energy. In Computing ; éd. Springer Verlag, 2017, vol. 99, num. 1.
      https://hal.inria.fr/hal-01340318
    • [4] J. Monette, N. Beldiceanu, P. Flener, J. Pearson. A Parametric Propagator for Pairs of Sum Constraints with a Discrete Convexity Property. In Artificial Intelligence ; éd. Elsevier, 2016, vol. 241.
      https://hal.inria.fr/hal-01374714
    • [5] N. Beldiceanu, M. Carlsson, R. Douence, H. Simonis. Using finite transducers for describing and synthesising structural time-series constraints. In Constraints ; éd. Springer Verlag, 2016, vol. 21, num. 1.
      https://hal.inria.fr/hal-01370322
    • [6] N. Beldiceanu, M. Carlsson, R. Douence, H. Simonis. Using finite transducers for describing and synthesising structural time-series constraints. In Constraints ; éd. Springer Verlag, 2015.
      https://hal.inria.fr/hal-01186662
    • [7] N. Beldiceanu, P. Flener, J. Monette, J. Pearson, H. Simonis. Toward sustainable development in constraint programming. In Constraints ; éd. Springer Verlag, 2014.
      https://hal.inria.fr/hal-01086761
    • [8] A. Letort, M. Carlsson, N. Beldiceanu. Synchronized sweep algorithms for scalable scheduling constraints. In Constraints ; éd. Springer Verlag, 2014.
      https://hal.inria.fr/hal-01086765
    • [9] N. Beldiceanu, M. Carlsson, P. Flener, J. Pearson. On Matrices, Automata, and Double Counting in Constraint Programming. In Constraints ; éd. Springer Verlag, 2013, vol. 18, num. 1.
      https://hal.archives-ouvertes.fr/hal-00758531
    • [11] N. Beldiceanu, P. Flener, J. Monette, J. Pearson, H. Simonis. Toward sustainable development in constraint programming. In Constraints ; éd. Springer Verlag, 2013.
      https://hal.inria.fr/hal-00874276
    • [12] N. Beldiceanu, M. Carlsson, S. Demassey, E. Poder. New filtering for the \it cumulative constraint in the context of non-overlapping rectangles. In Annals OR, vol. 184, num. 1. 2011
      https://hal.archives-ouvertes.fr/hal-00485563
    • [13] A. Abder, N. Beldiceanu, M. Carlsson, F. Fages. Integrating Rule-Based Modelling and Constraint Programming for Solving Industrial Packing Problems. In ERCIM News ; éd. ERCIM, 2010, vol. 81.
      https://hal.inria.fr/hal-00915805

Revues nationales avec comité de lecture (ART_NAT)

    • [21] E. Poder, N. Beldiceanu, E. Sanlaville. Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. In European Journal of Operational Research ; éd. Elsevier, 2004, vol. 153.
      https://hal.archives-ouvertes.fr/hal-00442833

Conférences internationales avec comité de lecture et actes (COMM_INT)

    • [24] N. Beldiceanu, M. Carlsson, A. Derrien, C. Prud'Homme, A. Schutt, P. Stuckey. Range-Consistent Forbidden Regions of Allen’s Relations. In CPAIOR 2017 - 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, juin 2017, Padoue, Italie.
      https://hal.archives-ouvertes.fr/hal-01686406
    • [25] E. Arafailova, N. Beldiceanu, H. Simonis. AMONG Implied Constraints for Two Families of Time-Series Constraints. In The 23rd International Conference on Principles and Practice of Constraint Programming, août 2017, Melbourne, Australie.
      https://hal.inria.fr/hal-01651585
    • [26] E. Arafailova, N. Beldiceanu, H. Simonis. Beyond the Holy Grail - Automatically Generating Constraint Propagators for Conjunctions of Time-Series Constraints. In Workshop on Progress Towards the Holy Grail, août 2017, Melbourne, Australie.
      https://hal.inria.fr/hal-01651610
    • [27] E. Arafailova, N. Beldiceanu, H. Simonis. Generating Linear Invariants for a Conjunction of Automata Constraints. In The 23rd International Conference on Principles and Practice of Constraint Programming, août 2017, Melbourne, Australie.
      https://hal.inria.fr/hal-01651593
    • [28] G. Madi Wamba, Y. Li, A. Orgerie, N. Beldiceanu, J. Menaud. Cloud workload prediction and generation models. In SBAC-PAD: International Symposium on Computer Architecture and High Performance Computing, octobre 2017, Campinas, Brésil.
      https://hal.archives-ouvertes.fr/hal-01578354
    • [30] E. Arafailova, N. Beldiceanu, R. Douence, P. Flener, M. Francisco Rodríguez, J. Pearson, H. Simonis. Time-Series Constraints: Improvements and Application in CP and MIP Contexts. In CPAIOR 2016 - 13th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, mai 2016, Banff, Canada.In Claude-Guy Quimper (éds.), . Springer, 2016.
      https://hal.inria.fr/hal-01355262
    • [31] G. Madi Wamba, N. Beldiceanu. The TaskIntersection Constraint. In 13th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming - CPAIOR 2016, mai 2016, Banff, Canada.In Claude-Guy Quimper (éds.), . Springer, 2016.
      https://hal.archives-ouvertes.fr/hal-01436044
    • [32] N. Beldiceanu, B. Dumas Feris, P. GRAVEY, M. Hasan, C. Jard, T. Ledoux, Y. Li, D. Lime, G. Madi-Wamba, J. Menaud, P. Morel, M. Morvan, M. MOULINARD, A. Orgerie, J. Pazat, O. Roux, A. Sharaiha. The EPOC project: Energy Proportional and Opportunistic Computing system. In International Conference on Smart Cities and Green ICT Systems (SMARTGREENS), mai 2015, Lisbonne, Portugal.
      https://hal.archives-ouvertes.fr/hal-01131602
    • [33] N. Beldiceanu, M. Carlsson, P. Flener, X. Lorca, J. Pearson, T. Petit, C. Prud'Homme. A Modelling Pearl with Sortedness Constraints. In Global conference on artificial intelligence, octobre 2015, Tbilisi, Géorgie.
      https://hal.inria.fr/hal-01186680
    • [34] N. Beldiceanu, P. Flener, J. Pearson, P. Van Hentenryck. Propagating Regular Counting Constraints. In Twenty-Eighth AAAI Conference on Artificial Intelligence, juillet 2014, Québec, Canada.In Carla E. Brodley and Peter Stone (éds.), . , 2014.
      https://hal.inria.fr/hal-01086758
    • [35] N. Beldiceanu, M. Carlsson, P. Flener, M. Andreina, J. Pearson. Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators. In Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, septembre 2014, Lyon, France.In Barry O'Sullivan (éds.), . Springer, 2014.
      https://hal.inria.fr/hal-01086755
    • [36] H. Simonis, N. Beldiceanu. A Model Seeker: Extracting Global Constraint Models From Positive Examples. In 2013 INFORMS Computing Society Conference, janvier 2013, Santa Fe, états-Unis.
      https://hal.archives-ouvertes.fr/hal-00754361
    • [37] N. Razakarison, N. Beldiceanu, M. Carlsson, H. Simonis. GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials. In The Sixth Annual Symposium on Combinatorial Search (SOCS'13), juin 2013, Leavenworth, WA, états-Unis.In Helmert, Malte and Röger, Gabriele (éds.), . Malte Helmert and Gabriele Röger, 2013.
      https://hal.inria.fr/hal-00874297
    • [38] A. Letort, M. Carlsson, N. Beldiceanu. A Synchronized Sweep Algorithm for the $k$-dimensional cumulative Constraint. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference (CPAIOR'13), juin 2013, Yorktown Heights, NY, états-Unis.In Gomes, Carla P. and Sellman, Meinolf (éds.), . Springer, 2013.
      https://hal.inria.fr/hal-00874286
    • [39] J. Monette, N. Beldiceanu, P. Flener, J. Pearson. A Parametric Propagator for Discretely Convex Pairs of Sum Constraints. In 19th International Conference on Principles and Practice of Constraint Programming (CP'13), septembre 2013, Uppsala, Suède.In Christian Schulte (éds.), . Springer, 2013.
      https://hal.inria.fr/hal-00874309
    • [40] N. Beldiceanu, I. Georgiana, A. Lenoir, H. Simonis. Describing and Generating Solutions for the EDF Unit Commitment Problem with the ModelSeeker. In 19th International Conference on Principles and Practice of Constraint Programming (CP'13), septembre 2013, Uppsala, Suède.In Christian Schulte (éds.), . Springer, 2013.
      https://hal.inria.fr/hal-00874326
    • [41] H. Simonis, N. Beldiceanu. A Model Seeker: Extracting Global Constraint Models From Positive Examples. In First workshop on COmbining COnstraint solving with MIning and LEarning (CoCoMile'12), août 2012, Montpellier, France.
      https://hal.archives-ouvertes.fr/hal-00754341
    • [42] N. Beldiceanu, P. Flener, J. Monette, J. Pearson, H. Simonis. Some Research Challenges and Remarks on CP. In 18th International Conference on Principles and Practice of Constraint Programming (CP'12), octobre 2012, Quebec, Canada.
      https://hal.archives-ouvertes.fr/hal-00754356
    • [43] N. Beldiceanu, M. Carlsson, T. Petit, J. Régin. An O(n log n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization. In 20th European Conference on Artificial Intelligence (ECAI'12), août 2012, Montpellier, France.In Luc De Raedt and Christian Bessière and Didier Dubois and Patrick Doherty and Paolo Frasconi and Fredrik Heintz and Peter J. F. Lucas (éds.), . IOS Press, 2012.
      https://hal.archives-ouvertes.fr/hal-00754079
    • [44] A. Letort, N. Beldiceanu, M. Carlsson. A Scalable Sweep Algorithm for the cumulative Constraint. In 18th International Conference on Principles and Practice of Constraint Programming (CP'12), octobre 2012, Quebec, Canada.In Springer-Verlag (éds.), . , 2012.
      https://hal.archives-ouvertes.fr/hal-00754043
    • [45] N. Beldiceanu, H. Simonis. A Model Seeker: Extracting Global Constraint Models from Positive Examples. In 18th International Conference on Principles and Practice of Constraint Programming (CP'12), octobre 2012, Quebec, Canada.In Springer-Verlag (éds.), 18th International Conference on Principles and Practice of Constraint Programming (CP'12). , 2012.
      https://hal.archives-ouvertes.fr/hal-00754044
    • [46] A. De Clercq, N. Beldiceanu, N. Jussien. Algorithmes de filtrage pour des problèmes cumulatifs discrets avec dépassements de ressource. In 7ièmes Journées Francophones de Programmation par Contraintes (JFPC'11), 2011, Lyon, France.
      https://hal.archives-ouvertes.fr/hal-00754020
    • [47] A. De Clercq, T. Petit, N. Beldiceanu, N. Jussien. Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource. In Principles and Practice of Constraint Programming - CP 2011, septembre 2011, Perugia, Italie.
      https://hal.archives-ouvertes.fr/hal-00753375
    • [48] N. Beldiceanu, H. Simonis. Using the Global Constraint Seeker for Learning Structured Constraint Models: A First Attempt. In The 10th International Workshop on Constraint Modelling and Reformulation (ModRef'11) held at CP'11, septembre 2011, Perugia, Italie.
      https://hal.archives-ouvertes.fr/hal-00754023
    • [49] T. Petit, J. Régin, N. Beldiceanu. A Theta(n) Bound-Consistency Algorithm for the Increasing Sum Constraint. In 17th International Conference on Principles and Practice of Constraint Programming (CP'11), septembre 2011, Perugia, Italie.
      https://hal.archives-ouvertes.fr/hal-00753385
    • [50] T. Petit, N. Beldiceanu, X. Lorca. A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints. In 22th International Joint Conference on Artificial Intelligence (IJCAI'11), août 2011, Barcelona, Espagne.In IJCAI/AAAI (éds.), . , 2011.
      https://hal.archives-ouvertes.fr/hal-00754017
    • [51] N. Beldiceanu, H. Simonis. A Constraint Seeker: Finding and Ranking Global Constraints from Examples. In 17th International Conference on Principles and Practice of Constraint Programming (CP'11), septembre 2011, Perrugia, Italie.In Springer-Verlag (éds.), . , 2011.
      https://hal.archives-ouvertes.fr/hal-00754010
    • [52] N. Beldiceanu, F. Hermenier, X. Lorca, T. Petit. The Increasing Nvalue Constraint. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, juin 2010, Bologna, Italie.In Andrea Lodi and Michela Milano and Paolo Toth (éds.), . Springer, 2010.
      https://hal.inria.fr/hal-00915800
    • [53] N. Beldiceanu, M. Carlsson, P. Flener, J. Pearson. On Matrices, Automata, and Double Counting. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010. Proceedings, juin 2010, Bologna, Italie.In Andrea Lodi and Michela Milano and Paolo Toth (éds.), . Springer, 2010.
      https://hal.inria.fr/hal-00915717
    • [54] G. Chabert, N. Beldiceanu. Sweeping with Continuous Domains.. In Principles and Practice of Constraint Programming - CP 2010, octobre 2010, St. Andrews, Royaume-Uni.In David Cohen (éds.), . Springer, 2010.
      https://hal.inria.fr/hal-00915701
    • [55] N. Beldiceanu, M. Carlsson, M. Sbihi, C. Truchet, S. Zampelli, M. Agren. Six Ways of Integrating Symmetries within Non-Overlapping Constraints. In 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), 2009, , états-Unis.In Springer-Verlag (éds.), 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09). , 2009.
      https://hal.archives-ouvertes.fr/hal-00481521
    • [56] N. Beldiceanu, E. Poder. Filtering for a Continuous Multi-Resources cumulative Constraint with Resource Consumption and Production. In International Conference on Automated Planning and Scheduling (ICAPS'08), 2008, Sidney, Australie.
      https://hal.archives-ouvertes.fr/hal-00481545
    • [57] N. Beldiceanu, M. Carlsson, E. Poder. New Filtering for the cumulative Constraint in the Context of Non-Overlapping Rectangles. In 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'08), 2008, Paris, France.In Springer-Verlag (éds.), 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'08). , 2008.
      https://hal.archives-ouvertes.fr/hal-00481541
    • [58] N. Beldiceanu, M. Carlsson, J. Martin. A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules. In 14th International Conference on Principles and Practice of Constraint Programming (CP'08), 2008, , Australie.In Springer-Verlag (éds.), 14th International Conference on Principles and Practice of Constraint Programming (CP'08). , 2008.
      https://hal.archives-ouvertes.fr/hal-00481539
    • [59] N. Beldiceanu, M. Carlsson, E. Poder, R. Sadek, C. Truchet. A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects. In 13th International on Principles and Practice of Constraint Programming (CP'07), 2007, Brown, états-Unis.
      https://hal.archives-ouvertes.fr/hal-00481558
    • [60] N. Beldiceanu, E. Poder. A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production. In 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'07), 2007, Brussels, Belgique.In Springer-Verlag (éds.), 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'07). , 2007.
      https://hal.archives-ouvertes.fr/hal-00481560
    • [61] N. Beldiceanu, X. Lorca. Necessary Condition for Path Partitioning Constraints. In 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'07), 2007, Brussels, Belgique.In Springer-Verlag (éds.), 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'07). , 2007.
      https://hal.archives-ouvertes.fr/hal-00481563
    • [62] N. Beldiceanu, M. Carlsson, S. Demassey, T. Petit. Graph-Based Filtering. In 12th International Conference on Principles and Practice of Constraint Programming (CP'06), 2006, Nantes, France.
      https://hal.archives-ouvertes.fr/hal-00481570
    • [63] N. Beldiceanu, I. Katriel, X. Lorca. Undirected Forest Constraints. In Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'06), 2006, Cork, Irlande.In Lecture Notes in Computer Science (éds.), 3rd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'06). , 2006.
      https://hal.archives-ouvertes.fr/hal-00481573
    • [64] N. Beldiceanu, P. Flener, X. Lorca. The Tree Constraint. In International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'05), 2005, Prague, Czech Republic, République tchèque.In Roman Bartak and Michela Milano (éds.), Proceedings of the second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'05). Springer Verlag, 2005.
      https://hal.archives-ouvertes.fr/hal-00445174

Conférences nationales avec comité de lecture et actes (COMM_NAT)

    • [65] H. Simonis, N. Beldiceanu. Building global constraint models from positive examples. In 21th International Symposium on Mathematical Programming (ISMP'12), août 2012, Berlin, Allemagne.
      https://hal.archives-ouvertes.fr/hal-00754354
    • [66] N. Beldiceanu, H. Simonis. Learning Structured Constraint Models: a First Attempt. In The 22nd Irish Conference on Artificial Intelligence and Cognitive Science, AICS'11, 2011, Ulster, Irlande.
      https://hal.archives-ouvertes.fr/hal-00754027
    • [67] N. Beldiceanu, F. Hermenier, X. Lorca, T. Petit. La contrainte Increasing NValue. In JFPC 2010 - Sixièmes Journées Francophones de Programmation par Contraintes, juin 2010, Caen, France.
      https://hal.inria.fr/inria-00520296v2
    • [68] N. Beldiceanu, E. Poder. Une contrainte cumulative continue multi-ressources avec des conso mmations - Productions en ressources Positives - Négatives. In Troisièmes Journées Francophones de Programmationpar Contraintes (JFPC07), juin 2007, INRIA, Domaine de Voluceau, Rocquencourt, Yvelines France.
      https://hal.inria.fr/inria-00151193
    • [69] N. Beldiceanu, X. Lorca. Condition nécessaire pour la contrainte de partitionnement de graphes par des chemins. In Troisièmes Journées Francophones de Programmationpar Contraintes (JFPC07), juin 2007, Rocquencourt / France.
      https://hal.inria.fr/inria-00151230
    • [70] N. Beldiceanu, M. Carlsson, S. Demassey, T. Petit. Filtrage basé sur des propriétés de graphe. In Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC06), 2006, Nîmes - Ecole des Mines d'Alès / France, France.
      https://hal.inria.fr/inria-00085796
    • [71] N. Beldiceanu, M. Carlsson, S. Demassey, T. Petit. Filtrage basé sur des propriétés de graphes. In 2èmes Journées Francophones de Programmation par Contraintes ({JFPC'06}, 2006, Nîmes, France.
      https://hal.archives-ouvertes.fr/hal-00481575
    • [72] N. Beldiceanu, P. Flener, X. Lorca. Partitionnement de graphes par des arbres sous contraintes de degré. In Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC06), 2006, Nîmes - Ecole des Mines d'Alès / France.
      https://hal.inria.fr/inria-00085802
    • [73] N. Beldiceanu, X. Lorca, I. Katriel. Contraintes de Partitionnement par des Arbres. In Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC06), 2006, Nîmes - Ecole des Mines d'Alès / France.
      https://hal.inria.fr/inria-00085803
    • [74] N. Beldiceanu, T. Petit, G. Rochart. Bornes de Caractéristiques de Graphes. In Premières Journées Francophones de Programmation par Contraintes, juin 2005, Lens.In Christine Solnon (éds.), . Université d'Artois, 2005.
      https://hal.inria.fr/inria-00000088

Ouvrages - Chapitres d‘ouvrages et directions d‘ouvrages (OUV)

    • [76] N. Beldiceanu, N. Jussien, E. Pinson. 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12). 05-2012
      https://hal.archives-ouvertes.fr/hal-00754042

Autres publications (AUTRES)

    • [77] E. Arafailova, N. Beldiceanu, M. Carlsson, P. Flener, M. Francisco Rodríguez, J. Pearson, H. Simonis. Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints.
      https://hal.inria.fr/hal-01370317
    • [78] E. Arafailova, N. Beldiceanu, R. Douence, M. Carlsson, P. Flener, M. Francisco Rodríguez, J. Pearson, H. Simonis. Global Constraint Catalog, Volume II, Time-Series Constraints.
      https://hal.inria.fr/hal-01374721
    • [79] A. Letort, M. Carlsson, N. Beldiceanu. Synchronized sweep algorithms for scalable scheduling constraints. Rapport technique, 2013 ; .
      https://hal.inria.fr/hal-00874331
    • [80] N. Beldiceanu, P. Flener, J. Pearson, P. Van Hentenryck. Propagating regular counting constraints. Rapport technique, 2013 ; .
      https://hal.inria.fr/hal-00874338
    • [83] T. Petit, N. Beldiceanu, X. Lorca. A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints:Revised Edition that Incorporates One Correction. Rapport technique, 2011 ; .
      https://hal.archives-ouvertes.fr/hal-00754032
    • [86] N. Beldiceanu, M. Agren, M. Carlsson, M. Sbihi, C. Truchet, S. Zampelli. Six Ways of Integrating Symmetries within Non-Overlapping Constraints, SICS Technical report T2009-01.
      https://hal.archives-ouvertes.fr/hal-00481532
    • [89] N. Beldiceanu, E. Poder, R. Sadek, M. Carlsson, C. Truchet. A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects. SICS technical report T2007-08..
      https://hal.archives-ouvertes.fr/hal-00481565
    • [91] N. Beldiceanu, P. Flener, X. Lorca. Combining Tree Partitioning, Precedence, Incomparability, and Degree Constraints, with an Application to Phylogenetic and Ordered-Path Problems, Technical report 2006-20 of Uppsala University..
      https://hal.archives-ouvertes.fr/hal-00481578
    • [92] N. Beldiceanu. Global Constraints: Introduction and Graph-Based Representation. Second International Summer School of the Association for Constraint Programming. Samos, Greece..
      https://hal.archives-ouvertes.fr/hal-00481582
Copyright : LS2N 2017 - Mentions Légales - 
 -