Christine Solnon

J. Math. Cryptol., February, 2024

2023

Exact and anytime approach for solving the time dependent traveling salesman problem with time windows.

[BibT_eX]

[DOI]

Romain Fontaine

Jilles Dibangoye

Eur. J. Oper. Res., December, 2023

Non-Crossing Anonymous MAPF for Tethered Robots.

[BibT_eX]

[DOI]

Xiao Peng

Olivier Simonin

J. Artif. Intell. Res., 2023

A CP-based Automatic Tool for Instantiating Truncated Differential Characteristics - Extended Version.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

A CP-Based Automatic Tool for Instantiating Truncated Differential Characteristics.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - INDOCRYPT 2023, 2023

Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming.

[BibT_eX]

[DOI]

Xiao Peng

Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022

And Rijndael?: Automatic Related-Key Differential Analysis of Rijndael.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2022

2021

Solving the Non-Crossing MAPF with CP.

[BibT_eX]

[DOI]

Xiao Peng

Olivier Simonin

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Automatic Generation of Declarative Models For Differential Cryptanalysis.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

An asymptotic approximation of the traveling salesman problem with uniform non-overlapping time windows.

[BibT_eX]

[DOI]

Omar Rifki

Thierry Garaix

Proceedings of the 17th IEEE International Conference on Automation Science and Engineering, 2021

2020

Constraint Programming and Local Search Heuristic: a Matheuristic Approach for Routing and Scheduling Feeder Vessels in Multi-terminal Ports.

[BibT_eX]

[DOI]

David Sacramento

David Pisinger

Oper. Res. Forum, 2020

A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering.

[BibT_eX]

[DOI]

Maxime Chabert

J. Artif. Intell. Res., 2020

Computing AES related-key differential characteristics with constraint programming.

[BibT_eX]

[DOI]

Artif. Intell., 2020

ACO with automatic parameter selection for a scheduling problem with a group cumulative constraint.

[BibT_eX]

[DOI]

Lucas Groleaz

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

abstractXOR: A global constraint dedicated to differential cryptanalysis.

[BibT_eX]

[DOI]

Loïc Rouquette

Proceedings of the Principles and Practice of Constraint Programming, 2020

Solving the Group Cumulative Scheduling Problem with CPO and ACO.

[BibT_eX]

[DOI]

Lucas Groleaz

Proceedings of the Principles and Practice of Constraint Programming, 2020

2019

Progressive Focus Search for the Static and Stochastic VRPTW with both Random Customers and Reveal Times.

[BibT_eX]

[DOI]

CoRR, 2019

Experimental Evaluation of Subgraph Isomorphism Solvers.

[BibT_eX]

[DOI]

Proceedings of the Graph-Based Representations in Pattern Recognition, 2019

2018

When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

Revisiting AES related-key differential attacks with constraint programming.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

Comparison of Traffic Forecasting Methods in Urban and Suburban Context.

[BibT_eX]

[DOI]

Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017

The Static and Stochastic VRPTW with both random Customers and Reveal Times: algorithms and recourse strategies.

[BibT_eX]

[DOI]

CoRR, 2017

Using Constraint Programming to solve a Cryptanalytic Problem.

[BibT_eX]

[DOI]

David Gérault

Marine Minier

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Mining Frequent Patterns in 2D+t Grid Graphs for Cellular Automata Analysis.

[BibT_eX]

[DOI]

Proceedings of the Graph-Based Representations in Pattern Recognition, 2017

The Static and Stochastic VRP with Time Windows and both Random Customers and Reveal Times.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computation - 20th European Conference, 2017

Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem.

[BibT_eX]

[DOI]

Maël Minot

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

Constraint Programming for Multi-criteria Conceptual Clustering.

[BibT_eX]

[DOI]

Maxime Chabert

Proceedings of the Principles and Practice of Constraint Programming, 2017

2016

GriMa: A Grid Mining Algorithm for Bag-of-Grid-Based Classification.

[BibT_eX]

[DOI]

Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2016

Portfolios of Subgraph Isomorphism Algorithms.

[BibT_eX]

[DOI]

Lars Kotthoff

Ciaran McCreesh

Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016

Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

Constraint Programming Models for Chosen Key Differential Cryptanalysis.

[BibT_eX]

[DOI]

David Gérault

Marine Minier

Marco Antonio Montes de Oca

Proceedings of the Principles and Practice of Constraint Programming, 2016

2015

ANTS 2014 special issue: Editorial.

[BibT_eX]

[DOI]

Thomas Stützle

Swarm Intell., 2015

On the complexity of submap isomorphism and maximum common submap problems.

[BibT_eX]

[DOI]

Pattern Recognit., 2015

A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW - Extended version.

[BibT_eX]

[DOI]

CoRR, 2015

A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem.

[BibT_eX]

[DOI]

Maël Minot

Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW.

[BibT_eX]

[DOI]

Penélope Aguiar-Melgarejo

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems.

[BibT_eX]

[DOI]

Philippe Laborie

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014

On the subgraph epimorphism problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2D Topological Map Isomorphism for Multi-Label Simple Transformation Definition.

[BibT_eX]

[DOI]

Tristan Roussillon

Proceedings of the Discrete Geometry for Computer Imagery, 2014

Experimental Comparison of BTD and Intelligent Backtracking: Towards an Automatic Per-instance Algorithm Selector.

[BibT_eX]

[DOI]

Loïc Blet

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Polynomial algorithms for open plane graph and subgraph isomorphisms.

[BibT_eX]

[DOI]

Émilie Samuel

Theor. Comput. Sci., 2013

Preface.

[BibT_eX]

[DOI]

François Fages

Simon de Givry

RAIRO Oper. Res., 2013

On the Complexity of Submap Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the Graph-Based Representations in Pattern Recognition, 2013

Map Edit Distance vs. Graph Edit Distance for Matching Images.

[BibT_eX]

[DOI]

Camille Combier

Proceedings of the Graph-Based Representations in Pattern Recognition, 2013

2012

From maximum common submaps to edit distances of generalized maps.

[BibT_eX]

[DOI]

Camille Combier

Vianney le Clément de Saint-Marcq

Pattern Recognit. Lett., 2012

Castor: A Constraint-Based SPARQL Engine with Active Filter Processing.

[BibT_eX]

[DOI]

Pierre-Antoine Champin

Proceedings of the Semantic Web: Research and Applications, 2012

2011

Efficient search of combinatorial maps using signatures.

[BibT_eX]

[DOI]

Stéphane Gosselin

Theor. Comput. Sci., 2011

Polynomial algorithms for subisomorphism of nD open combinatorial maps.

[BibT_eX]

[DOI]

Émilie Samuel

Comput. Vis. Image Underst., 2011

Measuring the Distance of Generalized Maps.

[BibT_eX]

[DOI]

Camille Combier

Proceedings of the Graph-Based Representations in Pattern Recognition, 2011

Frequent Submap Discovery.

[BibT_eX]

[DOI]

Stéphane Gosselin

Vianney le Clément de Saint-Marcq

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

An Efficient Light Solver for Querying the Semantic Web.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

CP Models for Maximum Common Subgraph Problems.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010

Solving subgraph isomorphism problems with constraint programming.

[BibT_eX]

[DOI]

Stéphane Zampelli

Constraints An Int. J., 2010

AllDifferent-based filtering for subgraph isomorphism.

[BibT_eX]

[DOI]

Artif. Intell., 2010

Strong Combination of Ant Colony Optimization with Constraint Programming Optimization.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

2009

An ACO-Based Reactive Framework for Ant Colony Optimization: First Experiments on Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization, Third International Conference, 2009

Signatures of Combinatorial Maps.

[BibT_eX]

[DOI]

Stéphane Gosselin

Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

A Polynomial Algorithm for Submap Isomorphism.

[BibT_eX]

[DOI]

Émilie Samuel

Vianney le Clément de Saint-Marcq

Proceedings of the Graph-Based Representations in Pattern Recognition, 2009

Constraint-Based Graph Matching.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

Classification of Images Based on Hidden Markov Models.

[BibT_eX]

[DOI]

Marc Mouret

Christian Wolf

Proceedings of the Seventh International Workshop on Content-Based Multimedia Indexing, 2009

2008

The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

A parametric filtering algorithm for the graph isomorphism problem.

[BibT_eX]

[DOI]

Constraints An Int. J., 2008

Reactive Stochastic Local Search Algorithms for the Genomic Median Problem.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

CP with ACO.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Integration of ACO in a Constraint Programming Language.

[BibT_eX]

[DOI]

Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2008

2007

A Generic Graph Distance Measure Based on Multivalent Matchings.

[BibT_eX]

[DOI]

Jean-Michel Jolion

Proceedings of the Applied Graph Theory in Computer Vision and Pattern Recognition, 2007

Optimisation par colonies de fourmis pour le problème du sac à dos multidimensionnel.

[BibT_eX]

[DOI]

Inès Alaya

Khaled Ghédira

Tech. Sci. Informatiques, 2007

Ant Colony Optimization for Multi-Objective Optimization Problems.

[BibT_eX]

[DOI]

Inès Alaya

Khaled Ghédira

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain.

[BibT_eX]

[DOI]

Jean-Michel Jolion

Proceedings of the Graph-Based Representations in Pattern Recognition, 2007

Filtering for Subgraph Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2007

2006

Editorial.

[BibT_eX]

[DOI]

François Fages

Narendra Jussien

RAIRO Oper. Res., 2006

A study of ACO capabilities for solving the maximum clique problem.

[BibT_eX]

[DOI]

Serge Fenet

J. Heuristics, 2006

A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

2005

Reactive Tabu Search for Measuring Graph Similarity.

[BibT_eX]

[DOI]

Proceedings of the Graph-Based Representations in Pattern Recognition, 2005

Ant Algorithm for the Graph Matching Problem.

[BibT_eX]

[DOI]

Olfa Sammoud

Khaled Ghédira

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2005

Applications of Preferences using Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the Answer Set Programming, 2005

Contributions à la résolution pratique de problèmes combinatoires: des fourmis et des graphes.

[BibT_eX]

[DOI]

, 2005

2004

Planning Operation: An Extensio'n of a Geographical Information System.

[BibT_eX]

[DOI]

Claudia Zepeda

David Sol

Proceedings of the Latin-American Workshop on Non-Monotonic Reasoning, 2004

Une contrainte globale pour le problème de l'isomorphisme de graphes.

[BibT_eX]

Proceedings of the Programmation en logique avec contraintes, 2004

A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Jano I. van Hemert

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2004

A Global Constraint for Graph Isomorphism Problems.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

2003

Un cours "électronique" sur la programmation par contraintes.

[BibT_eX]

[DOI]

Tech. Sci. Informatiques, 2003

Measuring the Similarity of Labeled Graphs.

[BibT_eX]

[DOI]

Pierre-Antoine Champin

Proceedings of the Case-Based Reasoning Research and Development, 2003

A Study of Greedy, Local Search, and Ant Colony Optimization Approaches for Car Sequencing Problems.

[BibT_eX]

[DOI]

Jens Gottlieb

Markus Puchta

Proceedings of the Applications of Evolutionary Computing, 2003

Searching for Maximum Cliques with Ant Colony Optimization.

[BibT_eX]

[DOI]

Serge Fenet

Proceedings of the Applications of Evolutionary Computing, 2003

2002

Ants can solve constraint satisfaction problems.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2002

Boosting ACO with a Preprocessing Step.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computing, 2002

2001

Boosting Local Search with Artificial Ants.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

Ant-P-Solveur: un solveur de contraintes à base de fourmis artificielles.

[BibT_eX]

Proceedings of the Programmation en logique avec contraintes, 2000

Solving Permutation Constraint Satisfaction Problems with Artificial Ants.

[BibT_eX]

Proceedings of the ECAI 2000, 2000

1997

Concurrent Cooperating Solvers over Reals.

[BibT_eX]

[DOI]

Reliab. Comput., 1997

Coopération de solveurs linéaires sur les réels pour la résolution de problèmes linéaires sur les entiers.

[BibT_eX]

Proceedings of the JFPLC'97, 1997

Cooperation of LP Solvers for Solving MILPs.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Tools with Artificial Intelligence, 1997

1994

Propagation of Inter-argument Dependencies in "Tuple-distributive" Type Inference Systems.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1994

Inférence de contraintes ensemblistes à partir de programmes Prolog - Application à la deduction de relations d'héritage.

[BibT_eX]

Proceedings of the JFPLC'94, 1994

1993

Extracting Inheritance Hierarchies from Prolog Programs: A System Based on the Inference of Type Relations.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Automated Reasoning,4th International Conference, 1993

1992

Inference of Inheritance Relationships from Prolog Programs: a System Developed with PrologIII.

[BibT_eX]

[DOI]

Proceedings of the Programming Language Implementation and Logic Programming, 1992

Du prototype Prolog vers un modèle objet: une approche basée sur l'inférence des relations inter-types.

[BibT_eX]

Proceedings of the JFPL'92, 1992

1991

Using a Prolog Prototype for Designing an Object Oriented Scheme.

[BibT_eX]

[DOI]