Rechercher
Menu
Je me connecte
Rechercher
  • Accueil
Photo of Yves Deville

Yves Deville

Maître de conférences invité, Professeur ordinaire émérite
yves.deville@uclouvain.be

SST/EPL Ecole polytechnique de Louvain (EPL)

SST/EPL Ecole polytechnique de Louvain (EPL)

SST/ICTM Institute of Information and Communication Technologies, Electronics and Applied Mathematics (ICTEAM)

AS/AUST/ATUC/RECT Rectrice (RECT)

Unités d'enseignement pour 2026

Libellé Code
Calculabilité et complexité LINFO1123
Industrial seminar in computer science LINFO2399

Les publications sont également disponibles sur Google Scholar.

2026
Papier de conférence

Zander, L., Vangrunderbeeck, P., Deville, Y., Decamps, S., Meunier, F., & Wertz, V. (2026). Co-concevoir une réflexion sur l’usage de l’IA : retour croisé sur les stratégies rédactionnelles dans trois cours de master à l’UCLouvain. AUPTIC·éducation, Lausanne.

https://research.dial.uclouvain.be/handle/2078.5/271972


2025
Rapport

Deville, Y. (2025). Plan stratéfique UCLouvain : Intelligence Artificielle générative.

https://research.dial.uclouvain.be/handle/2078.5/276231


2024
Rapport

Deville, Y., & et al. (2024). Utilisation Responsable de l’Intelligence Artificielle Générative.

https://research.dial.uclouvain.be/handle/2078.5/238591


Papier de conférence

Deville, Y., & Depoterre, S. (2024). Les différentes formes d’ouverture au service de la qualité de l’éducation, des ODD, de la flexibilité et de l’hybridation. Association internationale de pédagogie universitaire (AIPU), Université de Sherbrooke, Canada.

https://research.dial.uclouvain.be/handle/2078.5/238576


Chapitre de livre

Deville, Y. (2024). Solve problems by searching, including with constraints, a fundamental pillar. In Gelain Emmanuel (Editor) (ed.), Demystifying Artificial Intelligence: Symbolic, Data-Driven, Statistical and Ethical AI. De Gruyter. https://doi.org/10.1515/9783111426143-003

https://research.dial.uclouvain.be/handle/2078.5/238588


2023
Document de travail

Jacqmot, C., Deville, Y., & et al. (2023). Open Science Recommandations to Stakeholders.

https://research.dial.uclouvain.be/handle/2078.5/99890


Jacqmot, C., Deville, Y., & et al. (2023). Shared Guidelines for Open Science : Guidelines for Researchers.

https://research.dial.uclouvain.be/handle/2078.5/99889


Rapport

Deville, Y., & Jacqmot, C. (2023). Shared Guidelines for Open Education.

https://research.dial.uclouvain.be/handle/2078.5/238590


Deville, Y., & jacquemot, C. (2023). Open Education Recommendations for Stakeholders.

https://research.dial.uclouvain.be/handle/2078.5/238589


2022
Rapport

De Munck, J., Aujoulat, I., Capelle, V., Demoulin, J. B., Deville, Y., Geerts, M., Montedoro, C., Pigeon, E., Raucent, B., Thirion, B., & Traversa, E. (2022). Rebondir. enjeux et défis de l’épidémie Covid-19 à l’UCLouvain.

https://research.dial.uclouvain.be/handle/2078.5/105005


2020
Papier de conférence

Deville, Y., Jacqmot, C., & Pereira, O. (2020). Quand le numérique facilite la correction des questions d’examens : expérimentation de Gradescope à l’UCLouvain. 32ème Colloque de l’Admee-Europe, Casablanca.

https://research.dial.uclouvain.be/handle/2078.5/238566


Jacqmot, C., Docq, F., & Deville, Y. (2020). A Framework to Understand, Analyse and Describe Online and Open Education in Higher Education : In H. Chad Lane; Susan Zvacek; James Uhomoibhi (ed.), Proceedings of the 12th International Conference on Computer Supported Education - Volume 1: CSEDU (p. p. 458-465). SCITEPRESS - Science and Technology Publications. https://doi.org/10.5220/0009470704580465

https://research.dial.uclouvain.be/handle/2078.5/238568


2019
Papier de conférence

Gillard, X., Schaus, P., Deville, Y., & et al. (2019). SolverCheck: Declarative Testing of Constraints. Principles and Practice of Constraint Programming. Published. The 25th International Conference on Principles and Practice of Constraint Programming, Stamford, CT, USA. https://doi.org/10.1007/978-3-030-30048-7_33

https://research.dial.uclouvain.be/handle/2078.5/269958


Rapport

Saint-Guillain, M., Christine Solnon, & Deville, Y. (2019). Progressive Focus Search for the Static and Stochastic VRPTW with both Random Customers and Reveal Times.

https://research.dial.uclouvain.be/handle/2078.5/124761


Article de journal

Ha, Q. M., Deville, Y., Pham, Q. D., & Hà, M. H. (2019). A hybrid genetic algorithm for the traveling salesman problem with drone. Journal of Heuristics, 26(2), 219-247. https://doi.org/10.1007/s10732-019-09431-y (Original work published 2019)

https://research.dial.uclouvain.be/handle/2078.5/111885


2018
Papier de conférence

Deville, Y., & Jacqmot, C. (2018). Digital strategy at UCLouvain : openness matters,. Open Education Global Conference 2018, Delft.

https://research.dial.uclouvain.be/handle/2078.5/227483


Aubry, F., Vissicchio, S., Bonaventure, O., & Deville, Y. (2018). Robustly disjoint paths with segment routing. Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies - CoNEXT ’18. Published. the 14th International Conference on emerging Networking EXperiments and Technologies, Heraklion, Greece. https://doi.org/10.1145/3281411.3281424

https://research.dial.uclouvain.be/handle/2078.5/256520


Verhaeghe, H., Lecoutre Christophe, Deville, Y., & Schaus, P. (2018). Extension de Compact-Table aux Tables Simplement Intelligentes. Quatorzième journées Francophones de Programmation par Contraintes (JFPC18), Amiens, France.

https://research.dial.uclouvain.be/handle/2078.5/219254


Khong, M. T., Lecoutre, C., Schaus, P., & Deville, Y. (2018). Soft-regular with a Prefix-size Violation Measure. Soft-regular with a Prefix-size Violation Measure. Accepted/in-press. 15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Delft, The Netherlands. https://doi.org/10.1007/978-3-319-93031-2_24 (Original work published 2018)

https://research.dial.uclouvain.be/handle/2078.5/172982


Chapitre de livre

Deville, Y., Docq, F., Swaen, V., Blondel, V., Agarwal, A., & et al. (2018). Online learning: a wake-up call for Higher Education. In Directeur éditorial Vincent Blondel. (ed.), L’Université en dialogues. University Conversations. (p. p. 74 - 83). Presses Universitaires de Louvain (PUL).

https://research.dial.uclouvain.be/handle/2078.5/173429


2017
Papier de conférence

Saint-Guillain, M., Solnon, C., & Deville, Y. (2017). Un nouveau VRPTW static et stochastique: vers une modélisation en deux étapes plus réaliste. Treizièmes journées Francophones de Programmation par Contraintes.

https://research.dial.uclouvain.be/handle/2078.5/227167


Le Charlier, B., Khong, M. T., Lecoutre, C., & Deville, Y. (2017). Automatic Synthesis of Smart Table Constraints by Abstraction of Table Constraints. International Joint Conference on Artificial Intelligence. Proceedings, 1, 681-687. https://doi.org/10.24963/ijcai.2017/95 (Original work published 2017)

https://research.dial.uclouvain.be/handle/2078.5/175499


Verhaeghe, H., Lecoutre, C., Deville, Y., Schaus, P., & et al. (2017). Extending Compact-Table to Basic Smart Tables. Principles and Practice of Constraint Programming, p. 297-307.

https://research.dial.uclouvain.be/handle/2078.5/269964


Saint-Guillain, M., Solnon, C., & Deville, Y. (2017). The Static and Stochastic VRP with Time Windows and both random Customers and Reveal Times. Applications of Evolutionary Computation: 20th European Conference, EvoApplications 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings, Part II, p. 110-127. https://doi.org/10.1007/978-3-319-55792-2_8

https://research.dial.uclouvain.be/handle/2078.5/227256


Khong, M. T., Deville, Y., Schaus, P., & Lecoutre, C. (2017). Efficient Reification of Table Constraints. International Conference on Tools with Artificial Intelligence. Proceedings. Published. International Conference on Tools with Artificial Intelligence, Boston, MA, US. (Original work published 2017)

https://research.dial.uclouvain.be/handle/2078.5/175482


Article de journal

Ha, Q. M., Deville, Y., Quang Dung Pham, & et al. (2017). On the Min-cost Traveling Salesman Problem with Drone. Transportation Research. Part C: Emerging Technologies. Accepted/in-press. https://doi.org/10.1016/j.trc.2017.11.015 (Original work published 2017)

https://research.dial.uclouvain.be/handle/2078.5/175442


2016
Article de journal

Bui, Q. T., Deville, Y., & Pham, Q. D. (2016). Exact methods for solving the elementary shortest and longest path problems. Annals of Operations Research, 238(1), 1-36. https://doi.org/10.1007/s10479-016-2116-5 (Original work published 2016)

https://research.dial.uclouvain.be/handle/2078.5/183987


Papier de conférence

Saint-Guillain, M., Papavasiliou, A., Deville, Y., & Solnon, C. (2016). The Static and Stochastic VRP with Time Windows and both random Customers and Reveal Times (abstract). XIV International Conference on Stochastic Programming, Buzios, Brezil.

https://research.dial.uclouvain.be/handle/2078.5/229335


Aubry, F., Lebrun, D., Vissicchio, S., Khong, M. T., Deville, Y., & Bonaventure, O. (2016). SCMon: Leveraging Segment Routing to Improve Network Monitoring. INFOCOM 2016. Published. INFOCOM, San Francisco, California, US. https://doi.org/10.1109/INFOCOM.2016.7524410

https://research.dial.uclouvain.be/handle/2078.5/256505


2015
Papier de conférence

Mairy, J.-B., Deville, Y., & Lecoutre, C. (2015). The Smart Table Constraint. Proceedings of 12th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Published. 12th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2015), Barcelona. https://doi.org/10.1007/978-3-319-18008-3_19

https://research.dial.uclouvain.be/handle/2078.5/227280


Aubry, F., Lebrun, D., Deville, Y., & Bonaventure, O. (2015). Traffic duplication through segmentable disjoint paths. IFIP Networking 2015. Published. Networking 2015.

https://research.dial.uclouvain.be/handle/2078.5/255028


Saint-Guillain, M., Deville, Y., & Solnon, C. (2015). Une approche basée sur la programmation stochastique multi-étapes pour résoudre le VRPTW dynamique et stochastique. Onzièmes Journées Francophones de Programmation par Contraintes (JFPC 2015).

https://research.dial.uclouvain.be/handle/2078.5/229580


Durvaux, F., Standaert, F.-X., Veyrat-Charvillon, N., Mairy, J.-B., & Deville, Y. (2015). Efficient Selection of Time Samples for Higher-Order DPA with Projection Pursuits. In Stefan Mangard, Axel Y.Poschmann (ed.), Constructive Side-Channel Analysis and Secure Design (p. p. 34-50). Springer. https://doi.org/10.1007/978-3-319-21476-4

https://research.dial.uclouvain.be/handle/2078.5/227165


Saint-Guillain, M., Deville, Y., & Solnon, C. (2015). A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW. Twelfth International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR′15), Barcelone, Espagne.

https://research.dial.uclouvain.be/handle/2078.5/227308


Deville, Y., Dejemeppe, C., & Schaus, P. (2015). Derivative-Free Optimization: Lifting Single-Objective to Multi-Objective Algorithm. Lecture Notes in Computer Science, 9075(9075), 124-140. https://doi.org/10.1007/978-3-319-18008-3_9 (Original work published 2015)

https://research.dial.uclouvain.be/handle/2078.5/185041


Article de journal

Mouthuy, S., Massen, F., Van Hentenryck, P., & Deville, Y. (2015). A Multi-Stage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time-Windows. Transportation science, 49(2), 223-238. https://doi.org/10.1287/trsc.2014.0558 (Original work published 2015)

https://research.dial.uclouvain.be/handle/2078.5/183988


2014
Papier de conférence

Houndji, V. R., Schaus, P., Wolsey, L., & Deville, Y. (2014). The Stocking Cost Constraint. International Conference on Principles and Practice of Constraint Programming (CP2014), Lyon.

https://research.dial.uclouvain.be/handle/2078.5/230346


Mairy, J.-B., Deville, Y., & Lecoutre, C. (2014). Domain k-Wise Consistency Made as Simple as Generalized Arc Consistency. 11th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2014), Cork, Ireland.

https://research.dial.uclouvain.be/handle/2078.5/253956


Dejemeppe, C., & Deville, Y. (2014). Continuously degrading resource and interval dependent activity durations in nuclear medicine patient scheduling. 11th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2014), Cork, Ireland.

https://research.dial.uclouvain.be/handle/2078.5/253889


Deville, Y., & Wouters, P. (2014). Pédagogie active pour l’apprentissage de la programmation. 28ème congrès de l’Association Internationale de Pédagogie Universitaire (AIPU 2014), Mons, Belgique.

https://research.dial.uclouvain.be/handle/2078.5/253893


Bui, Q. T., Pham, Q. D., & Deville, Y. (2014). Solving the quorumcast routing problem as a mixed integer program. 11th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2014), Cork, Ireland.

https://research.dial.uclouvain.be/handle/2078.5/253739


Document de travail

Aubry, F., Lebrun, D., Deville, Y., & Bonaventure, O. (2014). Traffic duplication through segmentable disjoint paths.

https://research.dial.uclouvain.be/handle/2078.5/256490


Article de journal

Ho, T. V., Deville, Y., & Bonaventure, O. (2014). Multi-objective traffic engineering for data center networks. Computer Networks, 65, 167-182. https://doi.org/10.1016/j.comnet.2014.03.018 (Original work published 2014)

https://research.dial.uclouvain.be/handle/2078.5/255364


Mairy, J.-B., van Hentenryck, P., & Deville, Y. (2014). Optimal and efficient filtering algorithms for table constraints. Constraints : an international journal, 19(1), 77-120. https://doi.org/10.1007/s10601-013-9156-0 (Original work published 2014)

https://research.dial.uclouvain.be/handle/2078.5/253950


2013
Papier de conférence

Massen, F., López-Ibáñez, M., Stützle, T., & Deville, Y. (2013). Experimental analysis of pheromone-based heuristic column generation using irace. In María J. Blesa, Christian Blum, Paola Festa, Andrea Roli, Michael Sampels (ed.), Hybrid Metaheuristics (p. p. 92-106). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-38516-2_8

https://research.dial.uclouvain.be/handle/2078.5/253902


Bui, Q. T., Pham, Q. D., & Deville, Y. (2013). Solving the agricultural land allocation problem by constraint-based local search. In Editors: Christian Schulte (ed.), Principles and Practice of Constraint Programming (p. p. 749-757). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-40627-0_55

https://research.dial.uclouvain.be/handle/2078.5/254190


Article de journal

Deville, Y., Van Hentenryck, P., & Mairy, J.-B. (2013). Domain consistency with forbidden values. Constraints : an international journal, 18(3), 377-403. https://doi.org/10.1007/s10601-012-9135-x (Original work published 2013)

https://research.dial.uclouvain.be/handle/2078.5/254091


2012
Article de journal

Pham Quang, ,. D., & Deville, Y. (2012). Solving the quorumcast routing problem by constraint programming. Constraints : an international journal, 17, 1-23. https://doi.org/10.1007/s10601-012-9125-z (Original work published 2012)

https://research.dial.uclouvain.be/handle/2078.5/159493


Pham Quang, D., Deville, Y., & Van Hentenryck, P. (2012). LS(Graph): a constraint-based local search for constraint optimization on trees and paths. Constraints : an international journal, 17, 1-52. https://doi.org/10.1007/s10601-012-9124-0 (Original work published 2012)

https://research.dial.uclouvain.be/handle/2078.5/159482


Mouthuy, S., Van Hentenryck, P., & Deville, Y. (2012). Constraint-Based Very Large-Scale Neighborhood Search. Constraints : an international journal, 17(2), 87-122. (Original work published 2012)

https://research.dial.uclouvain.be/handle/2078.5/253997


Papier de conférence

Mairy, J.-B., Van Hentenryck, P., & Deville, Y. (2012). An optimal filtering algorithm for table constraints. International Conference on Principles and Practice of Constraint Programming, Québec City, Canada.

https://research.dial.uclouvain.be/handle/2078.5/219257


le Clément de Saint Marcq, V., Deville, Y., Solnon, C., & Champin, P.-A. (2012). Un solveur léger efficace pour interroger le Web sémantique. Journées Francophones de Programmation par Contraintes (JFPC 2012), Toulouse France.

https://research.dial.uclouvain.be/handle/2078.5/225182


Pham, Q. D., & Deville, Y. (2012). Solving the longest simple path problem with constraint-based techniques. CPAIOR′12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, p. 292-306. https://doi.org/10.1007/978-3-642-29828-8_19

https://research.dial.uclouvain.be/handle/2078.5/224956


Massen, F., Deville, Y., & Van Hentenryck, P. (2012). Une heuristique de génération de colonnes pour le problème de tournees de vehicules avec faisabilité boite noire,. Journées Francophones de Programmation par Contraintes (JFPC 2012), Toulouse France.

https://research.dial.uclouvain.be/handle/2078.5/224797


le Clément de Saint Marcq, V., Deville, Y., Solnon, C., & Champin, P.-A. (2012). Castor: a constraint-based SPARQL engine with active filter processing. Extended Semantic Web Conference, Heraklion, Crete, GR.

https://research.dial.uclouvain.be/handle/2078.5/225725


Massen, F., Deville, Y., & Van Hentenryck, P. (2012). Pheromone-based heuristic column generation for vehicle routing problems with black box feasibility. In Beldiceanu, Nicolas; Jussien, Narendra; Pinson, Eric (ed.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (p. p. 260-274). Springer New York LLC. https://doi.org/10.1007/978-3-642-29828-8_17

https://research.dial.uclouvain.be/handle/2078.5/224900


Chapitre de livre

Milgrom, E., & Deville, Y. (2012). L’informatique en FSA / à l’EPL. In Directeur éditorial Marcel Crochet (ed.), Des Écoles Spéciales à l’EPL 50 ans de science et de technologie à l’UCL.

https://research.dial.uclouvain.be/handle/2078.5/254087


2011
Papier de conférence

le Clément de Saint Marcq, V., Deville, Y., & Solnon, C. (2011). An efficient light solver for querying the semantic web. Lecture Notes in Computer Science, 6876, 145-159. https://doi.org/10.1007/978-3-642-23786-7_13 (Original work published 2011)

https://research.dial.uclouvain.be/handle/2078.5/161237


Massen, F., Deville, Y., & Van Hentenryck, P. (2011). A relaxation-guided approach for vehicle routing problems with black box feasibility. Eigth International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS2011). A Satellite Workshop of CP 2011, Italy.

https://research.dial.uclouvain.be/handle/2078.5/254070


Mouthuy, S., Deville, Y., & Van Hentenryck, P. (2011). A multi-stage very large-scale neighborhood search for the vehicle routing problem with soft time-windows. 9th Metaheuristics International Conference (MIC 2011), Udine, Italy, July 2011.

https://research.dial.uclouvain.be/handle/2078.5/253786


Mairy, J.-B., Deville, Y., & Van Hentenryck, P. (2011). Reinforced Adaptive Large Neighborhood Search. Eightth International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS2011), Perugia, Italy.

https://research.dial.uclouvain.be/handle/2078.5/253807


Deville, Y., Van Hentenryck, P., & Mairy, J.-B. (2011). Domaine consistance et valeurs interdites. Journées Francophones de Programmation par Contraintes (JFPC 2011), Lyon France, June 8-10, 2011.

https://research.dial.uclouvain.be/handle/2078.5/253957


HO, T. V., Deville, Y., Bonaventure, O., & François, P. (2011). Traffic engineering for multiple spanning tree protocol in large data centers. 23rd International Teletraffic Congress (ITC 2011), San Francisco, USA.

https://research.dial.uclouvain.be/handle/2078.5/256526


2010
Papier de conférence

Dupuis, J., Schaus, P., & Deville, Y. (2010). Vérification de consistence pour la constrainte de bin packing. Sixièmes journées Francophones de programmation par contraintes (JFPC 2010), Caen, France.

https://research.dial.uclouvain.be/handle/2078.5/253846


Pham, Q. D., Deville, Y., & Van Hentenryck, P. (2010). Constraint-based Local Search for Constrained Optimum Paths Problems. In Lodi, A.; Milano, M.; Toth, P.; (ed.), Integration of AI and OR Techniques in Constraint Programming for Cominatorial Optimization Problems. 7th International Conference, CPAIOR 2010 (p. p. 234-248). Springer.

https://research.dial.uclouvain.be/handle/2078.5/253840


Pham, Q. D., DO, P. T., Deville, Y., & HO, T. V. (2010). Constraint-based local search for solving non-simple paths problems on graphs: Application to the Routing for Network Covering Problems. In Proceedings of Symposium on Information and Communication Technology, SoICT2010, Hanoi, Vietnam.

https://research.dial.uclouvain.be/handle/2078.5/219243


Mairy, J.-B., Schaus, P., & Deville, Y. (2010). Generic adaptive heuristics for large neighborhood search. International conference on principles and practice of constraint programming, St Andrews, Scotland.

https://research.dial.uclouvain.be/handle/2078.5/253958


Ho, T. V., François, P., Deville, Y., Dung, P. Q., & Bonaventure, O. (2010). Using local search for traffic engineering in switched ethernet networks. Proceedings of ITC, p. 1-8.

https://research.dial.uclouvain.be/handle/2078.5/255090


Dupuis, J., Schaus, P., & Deville, Y. (2010). Consistency Check for the Bin Packing Constraint Revisited. In Lodi, A.; Milano, M.; Toth, P.; (ed.), Integration of AI and OR Techniques in Constraint Programming for Cominatorial Optimization Problems. 7th International Conference, CPAIOR 2010 (p. p. 117-122). Springer. https://doi.org/10.1007/978-3-642-13520-0_15

https://research.dial.uclouvain.be/handle/2078.5/254116


Pham, Q. D., Deville, Y., Do, P.-T., & Ho, T. V. (2010). Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering problem. In Nguyen Trong Giang, Nguyen Thuc Hai, Huynh Quyet Thang (ed.), Proceedings of the 2010 Symposium on Information and Communication Technology (p. p. 1-8).

https://research.dial.uclouvain.be/handle/2078.5/254121


Deville, Y., & Van Hentenryck, P. (2010). Domain consistency with forbidden values. 16th International Conference on Principles and Practice of Constraint Programming (CP 2010), St Andrew.

https://research.dial.uclouvain.be/handle/2078.5/254093


PHAM, Q. D. (2010). Constraint-Based Local Search for Constrained Optimum Paths Problems. 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010), Lecture Notes in Computer Science, Springer, Bologna, Italy.

https://research.dial.uclouvain.be/handle/2078.5/219262


Article de journal

Zampelli, S., Deville, Y., & Solnon, C. (2010). Solving subgraph isomorphism problems with constraint programming. Constraints : an international journal, 15(3), 327-353. https://doi.org/10.1007/s10601-009-9074-3 (Original work published 2010)

https://research.dial.uclouvain.be/handle/2078.5/253982


Schaus, P., Van Hentenryck, P., Monette, J.-N., Coffrin, C., Michel, L., & Deville, Y. (2010). Solving steel mill slab problems with constraint-based techniques: CP, LNS, and CBLS. Constraints : an international journal, 16(2), 125-147. https://doi.org/10.1007/s10601-010-9100-5 (Original work published 2011)

https://research.dial.uclouvain.be/handle/2078.5/253851


2009
Papier de conférence

Monette, J.-N., Deville, Y., & Van Hentenryck, P. (2009). Aeon: Synthesizing Scheduling Algorithms from High-Level Models. INFORMS computing society conference, Charleston, South Carolina.

https://research.dial.uclouvain.be/handle/2078.5/253978


Pham, Q. D., Deville, Y., & Van Hentenryck, P. (2009). LS(Graph) : a local search framework for constraint optimization on graphs and trees. The 2009 ACM Symposium on Applied Computing, Honolulu, HI, USA.

https://research.dial.uclouvain.be/handle/2078.5/254142


Monette, J.-N., Deville, Y., & Van Hentenryck, P. (2009). Just-In-Time Scheduling with Constraint Programming. International conference on automated planning and scheduling (ICAPS), Tessaloniki, Greece.

https://research.dial.uclouvain.be/handle/2078.5/253683


le Clément de Saint Marcq, V., Deville, Y., & Solnon, C. (2009). Constraint-based graph matching. In Gent, I.P.; (ed.), Principles and Practice of Constraint Programming. 15th International Conference, CP 2009 (p. p. 274-288). Springer-verlag.

https://research.dial.uclouvain.be/handle/2078.5/253926


Ho, T. V., François, P., Deville, Y., & Bonaventure, O. (2009). Implementation of a traffic engineering technique that preserves IP Fast Reroute inCOMET. Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Carry Le Rouet (Bouches-du-Rhône).

https://research.dial.uclouvain.be/handle/2078.5/255128


Pham, Q. D. (2009). LS(Graph & Tree): A Local Search Framework for Constraint Optimization on Graphs and Trees. Proceedings of the 2009 ACM Symposium on Applied Computing (SAC′09), Honolulu, Hawaii, USA.

https://research.dial.uclouvain.be/handle/2078.5/219240


2008
Papier de conférence

Schaus, P., & Deville, Y. (2008). Une contrainte globale de bin-packing avec précédences: Application au problème d’équilibrage de lignes d’assemblage. Journées Francophones de Programmation par Contraintes (JFPC′08), Nantes, France.

https://research.dial.uclouvain.be/handle/2078.5/254083


Pham, Q. D., Deville, Y., & Van Hentenryck, P. (2008). LS(Graph): Un cadre de recherche locale pour des problèmes d’optimisation sous contraintes sur des graphes. Journées Francophones de Programmation par Contraintes (JFPC′08), Nantes, France.

https://research.dial.uclouvain.be/handle/2078.5/219259


Deville, Y., Dooms, G., & Zampelli, S. (2008). Combining two structured domains for modeling various graph matching problems. Recent Advances in Constraints. 12th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2007, 76-90. https://doi.org/10.1007/978-3-540-89812-2_6

https://research.dial.uclouvain.be/handle/2078.5/230320


Schaus, P., & Deville, Y. (2008). A Global Constraint for Bin-Packing with Precedences: Application to the Assembly Line Balancing Problem. AAAI-08, Twenty-Third AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, Chicago, USA.

https://research.dial.uclouvain.be/handle/2078.5/254075


Schaus, P., & Deville, Y. (2008). Hybridization of CP and VLNS for Eternity II. JFPC′08 Quatrième Journées Francophones de Programmation par Contraintes, Nantes, France.

https://research.dial.uclouvain.be/handle/2078.5/253676


Schaus, P., & Deville, Y. (2008). Global Constraints for the Mean Absolute Deviation and the Variance: Application to the Vertical Line Balancing. 22nd national conference of the Belgian Operations Research Society, Brussels, Belgium.

https://research.dial.uclouvain.be/handle/2078.5/253974


Zampelli, S., Mann, M., Deville, Y., & Backofen, R. (2008). Techniques de Décomposition pour l’Isomorphisme de Sous-Graphe. Ournées Francophones de Programmation par Contraintes (JFPC′08), Nantes, France.

https://research.dial.uclouvain.be/handle/2078.5/253738


Mouthuy, S., Deville, Y., & Van Hentenryck, ,. P. (2008). Toward a Generic Comet Implementation of Very Large-Scale Neighborhoods. 22nd national conference of the Belgian Operations Research Society, Brussels, Belgium.

https://research.dial.uclouvain.be/handle/2078.5/253874


Schaus, P., & Deville, Y. (2008). Hybridation de la programmation par contraintes et d’un voisinage à très grande taille pour Eternity II. Journées Francophones de Programmation par Contraintes (JFPC′08), Nantes, France.

https://research.dial.uclouvain.be/handle/2078.5/253967


Article de journal

Brohée, S., Faust, K., Lima Mendez, G., Sand, O., Janky, R., Vanderstocken, G., Deville, Y., & van Helden, J. (2008). NeAT: a toolbox for the analysis of biological networks, clusters, classes and pathways. Nucleic acids research, 36(Web Server issue), W444-51. https://doi.org/10.1093/nar/gkn336 (Original work published 2008)

https://research.dial.uclouvain.be/handle/2078.5/254059


2007
Papier de conférence

Zampelli, S., Deville, Y., Saïdi, M. R., & Benhamou, B. (2007). Symmetry Breaking in Subgraph Isomorphism. SymCon′07, the Seventh International Workshop on Symmetry and Constraint Satisfaction Problem, Providence, USA.

https://research.dial.uclouvain.be/handle/2078.5/253896


Deville, Y., Dupont, P., Dooms, G., Monette, J.-N., Schaus, P., Zampelli, S., & Wodak, S. (2007). BioEdge: a tool box for advanced analyses of biochemical networks. Benelux Bioinformatics Conference (BBC′07), Leuven, Belgium.

https://research.dial.uclouvain.be/handle/2078.5/253769


Monette, J.-N., Deville, Y., & Dupont, P. (2007). A position-based propagator for the open-shop problem. In Van Hentenryck, P.; Wolsey, L.; (ed.), Integration of AI and OR Techniques in Constraint Programming forCombinatorial Optimization Problems. Proceedings 4th InternationalConference, CPAIOR 2007 (p. p. 186-199). Springer.

https://research.dial.uclouvain.be/handle/2078.5/253708


Schaus, P., Deville, Y., Dupont, P., & Régin, J.-C. (2007). Simplification and extension of the SPREAD Constraint. Third international workshop on constraint propagation and implementation, Nantes, France.

https://research.dial.uclouvain.be/handle/2078.5/254129


Schaus, P., Deville, Y., Dupont, P., & Regin, J.-C. (2007). The deviation constraint. In Van Hentenryck, P.; Wolsey, L.; (ed.), Integration of AI and OR Techniques in Constraint Programming forCombinatorial Optimization Problems. Proceedings 4th InternationalConference, CPAIOR 2007 (p. p. 260-274). Springer.

https://research.dial.uclouvain.be/handle/2078.5/253806


Mouthuy, S., Deville, Y., & Dooms, G. (2007). Contrainte globale pour le problème de recouvrement d’ensembles. Journées Francophones de Programmation par Contraintes (JFPC′07), Rocquencourt, France,.

https://research.dial.uclouvain.be/handle/2078.5/219249


Zampelli, S., Deville, Y., Solnon, C., Sorlin, S., & Dupont, P. (2007). Filtrage pour l’isomorphisme de sous-graphe. Journées Francophones de Programmation par Contraintes (JFPC′07), Rocquencourt, France,.

https://research.dial.uclouvain.be/handle/2078.5/226071


Schaus, P., Deville, Y., Dupont, P., & Régin, J.-C. (2007). La Contrainte Déviation. Journées Francophones de Programmation par Contraintes (JFPC′07), Rocquencourt, France.

https://research.dial.uclouvain.be/handle/2078.5/226353


Monette, J.-N., Deville, Y., & Dupont, P. (2007). Un propagateur basé sur les positions pour le problème d’Open-Shop. Journées Francophones de Programmation par Contraintes (JFPC′07), Rocquencourt, France,.

https://research.dial.uclouvain.be/handle/2078.5/226067


Monette, J.-N., Schaus, P., Zampelli, S., Deville, Y., & Dupont, P. (2007). A CP Approach to the Balanced Academic Curriculum Problem. Symcon′07, The Seventh International Workshop on Symmetry and Constraint Satisfaction Problems, Providence, USA.

https://research.dial.uclouvain.be/handle/2078.5/253867


Zampelli, S., Deville, Y., Solnon, C., Sorlin, S., & Dupont, P. (2007). Filtering for subgraph isomorphism. Principles and Practice of Constraint Programming. 13th International Conference, CP 2007, p. 728-742.

https://research.dial.uclouvain.be/handle/2078.5/253895


Chapitre de livre

Zampelli, S., Deville, Y., & Dupont, P. (2007). Symmetry breaking in subgraph pattern matching. In Frédéric Benhamou,Narendra Jussien,Barry O’Sullivan (ed.), Trends in Constraint Programming (p. p. 203-218).

https://research.dial.uclouvain.be/handle/2078.5/161632


Schaus, P., Deville, Y., & Dupont, P. (2007). Bound-Consistent Deviation Constraint. In Bessiere, Christian (ed.), Principles and Practice of Constraint Programming, CP 2007 (p. p. 620-634). Springer.

https://research.dial.uclouvain.be/handle/2078.5/270632


Deville, Y., Lemer, C., & wodak, S. (2007). Representing and Analyzing Biochemical Networks Using BioMaze. In Sangdun Choi (ed.), Introduction to System Biology (p. p. 484-507). Humana Press.

https://research.dial.uclouvain.be/handle/2078.5/253672


Schaus, P., Deville, Y., Dupont, P., & Regin, J.-C. (2007). Simplification and extension of the SPREAD Constraint. In Benhamou, Frédéric; Jussien, Narendra; O’Sullivan, Barry (Ed. by) (ed.), Trends in Constraint Programming (p. p. 95-99).

https://research.dial.uclouvain.be/handle/2078.5/161626


2006
Papier de conférence

Quesada, L., Van Roy, P., Deville, Y., & Collet, R. (2006). Using dominators for solving constrained path problems. Lecture Notes in Computer Science, 3819, 73-87. https://doi.org/10.1007/11603023_6 (Original work published 2006)

https://research.dial.uclouvain.be/handle/2078.5/140180


Schaus, P., Deville, Y., Dupont, P., & Régin, J.-C. (2006). Simplification and extension of the SPREAD Constraint. Third International Workshop on Constraint Propagation And Implementation (CPAI′06), Nantes, France.

https://research.dial.uclouvain.be/handle/2078.5/254089


Zampelli, S., Deville, Y., & Dupont, P. (2006). Symmetry Breaking in Subgraph Pattern Matching. In Frédéric Benhamou,Narendra Jussien, Barry O’Sullivan (ed.), Trends in Constraint Programming (p. p. 203-218). Wiley.

https://research.dial.uclouvain.be/handle/2078.5/254159


Zampelli, S., Deville, Y., & Dupont, P. (2006). Elimination des symétries pour l’appariement de graphes. JFPC′06, Deuxièmes Journées Francophones de Programmation par Contraintes, Nîmes, France.

https://research.dial.uclouvain.be/handle/2078.5/254079


Document de travail

Dupont, P., Callut, J., Dooms, G., Monette, J.-N., & Deville, Y. (2006). Relevant subgraph extraction from random walks in a graph.

https://research.dial.uclouvain.be/handle/2078.5/254006


2005
Papier de conférence

Deville, Y., Dooms, G., Zampelli, S., & Dupont, P. (2005). CP(Graph+Map) for Approximate Graph Matching. 1st International Workshop on Constraint Programming Beyond Finate Integer Domains, Stiges, Spain.

https://research.dial.uclouvain.be/handle/2078.5/254110


Dooms, G., Deville, Y., & Dupont, P. (2005). Constrained metabolic network analysis: discovering pathways using CP(Graph). Workshop on Constraint Based Methods for Bioinformatics, CP2005, Sitges, Spain.

https://research.dial.uclouvain.be/handle/2078.5/253965


Quesada, L., Van Roy, P., & Deville, Y. (2005). Speeding up constrained path solvers with a reachability propagator. Lecture Notes in Computer Science, 3709, 866. https://doi.org/10.1007/11564751_104 (Original work published 2005)

https://research.dial.uclouvain.be/handle/2078.5/140321


Zampelli, S., Deville, Y., & Dupont, P. (2005). Declarative Approximate Graph Matching Using a Constraint Approach. Second International Workshop on Constraint Propagation and Implementation, Stiges, Spain.

https://research.dial.uclouvain.be/handle/2078.5/254061


Dooms, G., Deville, Y., & Dupont, P. (2005). CP(graph): Introducing a graph computation domain in constraint programming. Lecture Notes in Computer Science, 3709, 211-225. https://doi.org/10.1007/11564751_18 (Original work published 2005)

https://research.dial.uclouvain.be/handle/2078.5/140313


Dooms, G., Deville, Y., & Dupont, P. (2005). A Mozart implementation of CP(BioNet). Lecture Notes in Computer Science, 3389, 237-250. https://doi.org/10.1007/978-3-540-31845-3_20 (Original work published 2005)

https://research.dial.uclouvain.be/handle/2078.5/140604


Vast, S., Dupont, P., & Deville, Y. (2005). Automatic extraction of relevant nodes in biochemical networks. Atelier Apprentissage et Bioinformatique, CAp 2005, Conférence d’Apprentissage, Nice, France.

https://research.dial.uclouvain.be/handle/2078.5/253839


Zampelli, S., Deville, Y., & Dupont, P. (2005). Approximate constrained subgraph matching. Lecture Notes in Computer Science, 3709, 832-836. https://doi.org/10.1007/11564751_74 (Original work published 2005)

https://research.dial.uclouvain.be/handle/2078.5/140317


2004
Article de journal

Lemer, C., Antezana, E., Couche, F., Fays, F., Santolaria, X., Janky, R., Deville, Y., Richelle, J., & Wodak, S. (2004). The aMAZE LightBench: a web interface to a relational database of cellular processes. Nucleic Acids Research, 32, D443-D448. https://doi.org/10.1093/nar/gkh139 (Original work published 2004)

https://research.dial.uclouvain.be/handle/2078.5/136580


Basin, D., Deville, Y., Flener, P., Hamfelt, A., & Nilsson, J. (2004). Synthesis of programs in computational logic. Lecture Notes in Computer Science, 3049, 30-65. https://doi.org/10.1007/978-3-540-25951-0_2 (Original work published 2004)

https://research.dial.uclouvain.be/handle/2078.5/136131


Papier de conférence

Dooms, G., Deville, Y., & Dupont, P. (2004). Recherche de chemins contraints dans les réseaux biochimiques. Treizièmes Journées Francophones de Programmation en Logique et de Programmation par contraintes (JFPLC 2004), Angers, France.

https://research.dial.uclouvain.be/handle/2078.5/254080


Zampelli, S., Deville, Y., & Dupont, P. (2004). Finding Patterns in Biochemical Networks. 5h Open Days in Biology, Computer Science and Mathematics (JOBIM 2004), Montreal, Canada.

https://research.dial.uclouvain.be/handle/2078.5/226256


Dooms, G., Deville, Y., & Dupont, P. (2004). Constrained Path Finding in Biochemical Networks: a Constraint Programming Approach. 5th Open Days in Biology, Computer Science and Mathematics (JOBIM 2004), Montreal, Canada.

https://research.dial.uclouvain.be/handle/2078.5/253869


2003
Article de journal

Deville, Y., Gilbert, D., van Helden, J., & Wodak, S. J. (2003). An overview of data models for the analysis of biochemical pathways. Briefings in Bioinformatics, 4(3), 246-259. https://doi.org/10.1093/bib/4.3.246 (Original work published 2003)

https://research.dial.uclouvain.be/handle/2078.5/132032


Papier de conférence

Nguyen Tran Sy, & Deville, Y. (2003). Consistency techniques for interprocedural test data generation. Software Engineering Notes, Vol. 28, p. 108-117. https://doi.org/10.1145/949952.940087

https://research.dial.uclouvain.be/handle/2078.5/230088


2002
Article de journal

Janssen, M., Van Hentenryck, P., & Deville, Y. (2002). A constraint satisfaction approach for enclosing solutions to parametric ordinary differential equations. SIAM Journal on Numerical Analysis, 40(5), 1896-1939. https://doi.org/10.1137/S0036142901392316 (Original work published 2002)

https://research.dial.uclouvain.be/handle/2078.5/137403


2001
Papier de conférence

Janssen, M., Van Hentenryck, P., & Deville, Y. (2001). Optimal pruning in parametric differential equations. In Walsh, T.; (ed.), Principles and Practice of Constraint Programming - CP 2002. 7thInternational Conference, CP 2001. Proceedings (Lecture Notes inComputer Science Vol.2239) (p. p. 539-553). Springer-verlag.

https://research.dial.uclouvain.be/handle/2078.5/225598


Sy, N. T., & Deville, Y. (2001). Automatic test data generation for programs with integer and float variables. Proceedings 16th Annual International Conference on Automated SoftwareEngineering (ASE 2001), p. 13-21. https://doi.org/10.1109/ASE.2001.989786

https://research.dial.uclouvain.be/handle/2078.5/230998


Article de journal

Vermaut, F., Deville, Y., Marichal, X., & Macq, B. (2001). A distributed adaptive block matching algorithm: Dis-ABMA. Signal Processing: Image Communication, 16(5), 431-444. https://doi.org/10.1016/S0923-5965(00)00008-4 (Original work published 2001)

https://research.dial.uclouvain.be/handle/2078.5/139118


2000
Papier de conférence

Poupaert, E., & Deville, Y. (2000). Simulated Annealing with estimated temperature. A I Communications : the European journal on artificial intelligence, 13(1), 19-26. (Original work published 2000)

https://research.dial.uclouvain.be/handle/2078.5/142728


1999
Papier de conférence

Janssen, M., Deville, Y., & Van Hentenryck, P. (1999). Multistep filtering operators for ordinary differential equations. Lecture Notes in Computer Science, 1713, 246-260. https://doi.org/10.1007/978-3-540-48085-3_18 (Original work published 1999)

https://research.dial.uclouvain.be/handle/2078.5/142686


Article de journal

Deville, Y., Barette, O., & Van Hentenryck, P. (1999). Constraint satisfaction over connected row-convex constraints. Artificial Intelligence, 109(1-2), 243-271. https://doi.org/10.1016/S0004-3702(99)00012-0 (Original work published 1999)

https://research.dial.uclouvain.be/handle/2078.5/140722


Bossi, A., & Deville, Y. (1999). Special issue: synthesis, transformation and analysis of logic programs 2. Journal of Logic Programming, 41(2-3), 139-140. https://doi.org/10.1016/S0743-1066(99)00027-8 (Original work published 1999)

https://research.dial.uclouvain.be/handle/2078.5/140439


Bossi, A., & Deville, Y. (1999). Guest editors’ introduction - Special issue: synthesis, transformation and analysis of logic programs. Journal of Logic Programming, 39(1-3), 1-2. https://doi.org/10.1016/S0743-1066(98)10031-6 (Original work published 1999)

https://research.dial.uclouvain.be/handle/2078.5/140892


1998
Papier de conférence

Nguyen, T., & Deville, Y. (1998). A distributed arc-consistency algorithm. Science of Computer Programming, 30(1-2), 227-250. https://doi.org/10.1016/S0167-6423(97)00012-9 (Original work published 1998)

https://research.dial.uclouvain.be/handle/2078.5/143504


Legat, J.-D., de Saint Moulin, R., & Deville, Y. (1998). An adaptive pre-processing for on-line hand-written character recognition by blind people. Proc. of ICAPR′98, p. 287-296.

https://research.dial.uclouvain.be/handle/2078.5/252626


Deville, Y., Janssen, M., & Van Hentenryck, P. (1998). Consistency techniques in ordinary differential equations. Lecture Notes in Computer Science, 1520, 162-176. https://doi.org/10.1007/3-540-49481-2_13 (Original work published 1998)

https://research.dial.uclouvain.be/handle/2078.5/142754


Legat, J.-D., de Saint Moulin, R., & Deville, Y. (1998). An on-line hand-written character recognition system dedicated to blind people. Proc. of the IEE 3d European Workshop on Handwriting Analysis and Recognition, p. 22.1-22.4.

https://research.dial.uclouvain.be/handle/2078.5/252439


Article de journal

Van Hentenryck, P., Saraswat, V., & Deville, Y. (1998). Design, implementation, and evaluation of the constraint language cc (FD). Journal of Logic Programming, 37(1-3), 139-164. https://doi.org/10.1016/S0743-1066(98)10006-7 (Original work published 1998)

https://research.dial.uclouvain.be/handle/2078.5/141566


1994
Article de journal

Deville, Y., & Lau, KK. (1994). Logic Program Synthesis. Journal of Logic Programming, 20, 321-350. https://doi.org/10.1016/0743-1066(94)90029-9 (Original work published 1994)

https://research.dial.uclouvain.be/handle/2078.5/145935


1993
Article de journal

Flener, P., & Deville, Y. (1993). Logic Program Synthesis From Incomplete Specifications. Journal of Symbolic Computation, 15(5-6), 775-805. https://doi.org/10.1016/S0747-7171(06)80012-X (Original work published 1993)

https://research.dial.uclouvain.be/handle/2078.5/146895


1992
Article de journal

Vanhentenryck, P., Deville, Y., & Teng, CM. (1992). A Generic Arc-consistency Algorithm and its Specializations. Artificial Intelligence, 57(2-3), 291-321. https://doi.org/10.1016/0004-3702(92)90020-X (Original work published 1992)

https://research.dial.uclouvain.be/handle/2078.5/137322