Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarChristine Solnon
Person information
- affiliation: LIRS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j21]David Gérault, Pascal Lafourcade, Marine Minier, Christine Solnon:
Revisiting AES related-key differential attacks with constraint programming. Inf. Process. Lett. 139: 24-29 (2018)- [j20]Ciaran McCreesh, Patrick Prosser, Christine Solnon, James Trimble:
When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases. J. Artif. Intell. Res. 61: 723-759 (2018) - [c59]Ruth Hoffmann, Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Craig Reilly, Christine Solnon, James Trimble:
Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. CPAIOR 2018: 298-315 - [c58]Julien Salotti, Serge Fenet, Romain Billot, Nour-Eddin El Faouzi, Christine Solnon:
Comparison of Traffic Forecasting Methods in Urban and Suburban Context. ICTAI 2018: 846-853 - 2017
- [c57]Maxime Chabert, Christine Solnon:
Constraint Programming for Multi-criteria Conceptual Clustering. CP 2017: 460-476 - [c56]Maël Minot, Samba Ndojh Ndiaye, Christine Solnon:
Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem. CPAIOR 2017: 359-375 - [c55]Michael Saint-Guillain, Christine Solnon, Yves Deville:
The Static and Stochastic VRP with Time Windows and both Random Customers and Reveal Times. EvoApplications (2) 2017: 110-127 - [c54]Romain Deville, Élisa Fromont, Baptiste Jeudy, Christine Solnon:
Mining Frequent Patterns in 2D+t Grid Graphs for Cellular Automata Analysis. GbRPR 2017: 177-186 - [c53]David Gerault, Marine Minier, Christine Solnon:
Using Constraint Programming to solve a Cryptanalytic Problem. IJCAI 2017: 4844-4848 - [i3]Michael Saint-Guillain, Christine Solnon, Yves Deville:
The Static and Stochastic VRPTW with both random Customers and Reveal Times: algorithms and recourse strategies. CoRR abs/1708.03151 (2017) - [i2]David Gérault, Pascal Lafourcade, Marine Minier, Christine Solnon:
Revisiting AES Related-Key Differential Attacks with Constraint Programming. IACR Cryptology ePrint Archive 2017: 139 (2017) - 2016
- [c52]Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Christine Solnon:
Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. CP 2016: 350-368 - [c51]David Gerault, Marine Minier, Christine Solnon:
Constraint Programming Models for Chosen Key Differential Cryptanalysis. CP 2016: 584-601 - [c50]Lars Kotthoff, Ciaran McCreesh, Christine Solnon:
Portfolios of Subgraph Isomorphism Algorithms. LION 2016: 107-122 - [c49]Romain Deville, Élisa Fromont, Baptiste Jeudy, Christine Solnon:
GriMa: A Grid Mining Algorithm for Bag-of-Grid-Based Classification. S+SSPR 2016: 132-142 - 2015
- [j19]Christine Solnon, Guillaume Damiand, Colin de la Higuera, Jean-Christophe Janodet:
On the complexity of submap isomorphism and maximum common submap problems. Pattern Recognition 48(2): 302-316 (2015) - [j18]Marco Dorigo, Mauro Birattari, Simon Garnier, Heiko Hamann, Marco Antonio Montes de Oca, Christine Solnon, Thomas Stützle:
ANTS 2014 special issue: Editorial. Swarm Intelligence 9(2-3): 71-73 (2015) - [c48]Penélope Aguiar Melgarejo, Philippe Laborie, Christine Solnon:
A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems. CPAIOR 2015: 1-17 - [c47]Michael Saint-Guillain, Yves Deville, Christine Solnon:
A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW. CPAIOR 2015: 357-374 - [c46]Maël Minot, Samba Ndojh Ndiaye, Christine Solnon:
A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem. ICTAI 2015: 461-468 - [i1]Michael Saint-Guillain, Yves Deville, Christine Solnon:
A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW - Extended version. CoRR abs/1502.01972 (2015) - 2014
- [j17]Steven Gay, François Fages, Thierry Martinez, Sylvain Soliman, Christine Solnon:
On the subgraph epimorphism problem. Discrete Applied Mathematics 162: 214-228 (2014) - [c45]Loïc Blet, Samba Ndojh Ndiaye, Christine Solnon:
Experimental Comparison of BTD and Intelligent Backtracking: Towards an Automatic Per-instance Algorithm Selector. CP 2014: 190-206 - [c44]Guillaume Damiand, Tristan Roussillon, Christine Solnon:
2D Topological Map Isomorphism for Multi-Label Simple Transformation Definition. DGCI 2014: 39-50 - [e2]Marco Dorigo, Mauro Birattari, Simon Garnier, Heiko Hamann, Marco Antonio Montes de Oca, Christine Solnon, Thomas Stützle:
Swarm Intelligence - 9th International Conference, ANTS 2014, Brussels, Belgium, September 10-12, 2014. Proceedings. Lecture Notes in Computer Science 8667, Springer 2014, ISBN 978-3-319-09951-4 [contents] - 2013
- [j16]François Fages, Simon de Givry, Christine Solnon:
Preface. RAIRO - Operations Research 47(2): 89-90 (2013) - [j15]Colin de la Higuera, Jean-Christophe Janodet, Émilie Samuel, Guillaume Damiand, Christine Solnon:
Polynomial algorithms for open plane graph and subgraph isomorphisms. Theor. Comput. Sci. 498: 76-99 (2013) - [c43]Christine Solnon, Guillaume Damiand, Colin de la Higuera, Jean-Christophe Janodet:
On the Complexity of Submap Isomorphism. GbRPR 2013: 21-30 - [c42]Camille Combier, Guillaume Damiand, Christine Solnon:
Map Edit Distance vs. Graph Edit Distance for Matching Images. GbRPR 2013: 152-161 - 2012
- [j14]Camille Combier, Guillaume Damiand, Christine Solnon:
From maximum common submaps to edit distances of generalized maps. Pattern Recognition Letters 33(15): 2020-2028 (2012) - [c41]Vianney le Clément de Saint-Marcq, Yves Deville, Christine Solnon, Pierre-Antoine Champin:
Castor: A Constraint-Based SPARQL Engine with Active Filter Processing. ESWC 2012: 391-405 - 2011
- [j13]Guillaume Damiand, Christine Solnon, Colin de la Higuera, Jean-Christophe Janodet, Émilie Samuel:
Polynomial algorithms for subisomorphism of nD open combinatorial maps. Computer Vision and Image Understanding 115(7): 996-1010 (2011) - [j12]Stéphane Gosselin, Guillaume Damiand, Christine Solnon:
Efficient search of combinatorial maps using signatures. Theor. Comput. Sci. 412(15): 1392-1405 (2011) - [c40]Vianney le Clément de Saint-Marcq, Yves Deville, Christine Solnon:
An Efficient Light Solver for Querying the Semantic Web. CP 2011: 145-159 - [c39]Samba Ndojh Ndiaye, Christine Solnon:
CP Models for Maximum Common Subgraph Problems. CP 2011: 637-644 - [c38]Stéphane Gosselin, Guillaume Damiand, Christine Solnon:
Frequent Submap Discovery. CPM 2011: 429-440 - [c37]Camille Combier, Guillaume Damiand, Christine Solnon:
Measuring the Distance of Generalized Maps. GbRPR 2011: 82-91 - 2010
- [j11]Christine Solnon:
AllDifferent-based filtering for subgraph isomorphism. Artif. Intell. 174(12-13): 850-864 (2010) - [j10]Stéphane Zampelli, Yves Deville, Christine Solnon:
Solving subgraph isomorphism problems with constraint programming. Constraints 15(3): 327-353 (2010) - [c36]Madjid Khichane, Patrick Albert, Christine Solnon:
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization. CPAIOR 2010: 232-245
2000 – 2009
- 2009
- [c35]Marc Mouret, Christine Solnon, Christian Wolf:
Classification of Images Based on Hidden Markov Models. CBMI 2009: 169-174 - [c34]Vianney le Clément de Saint-Marcq, Yves Deville, Christine Solnon:
Constraint-Based Graph Matching. CP 2009: 274-288 - [c33]Guillaume Damiand, Colin de la Higuera, Jean-Christophe Janodet, Émilie Samuel, Christine Solnon:
A Polynomial Algorithm for Submap Isomorphism. GbRPR 2009: 102-112 - [c32]Stéphane Gosselin, Guillaume Damiand, Christine Solnon:
Signatures of Combinatorial Maps. IWCIA 2009: 370-382 - [c31]Madjid Khichane, Patrick Albert, Christine Solnon:
An ACO-Based Reactive Framework for Ant Colony Optimization: First Experiments on Constraint Satisfaction Problems. LION 2009: 119-133 - [e1]Yves Deville, Christine Solnon:
Proceedings 6th International Workshop on Local Search Techniques in Constraint Satisfaction, LSCS 2009, Lisbon, Portugal, 20 September 2009. EPTCS 5, 2009 [contents] - 2008
- [j9]Sébastien Sorlin, Christine Solnon:
A parametric filtering algorithm for the graph isomorphism problem. Constraints 13(4): 518-537 (2008) - [j8]Christine Solnon, Van-Dat Cung, Alain Nguyen, Christian Artigues:
The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem. European Journal of Operational Research 191(3): 912-927 (2008) - [j7]Christine Solnon:
Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization. European Journal of Operational Research 191(3): 1043-1055 (2008) - [c30]Madjid Khichane, Patrick Albert, Christine Solnon:
Integration of ACO in a Constraint Programming Language. ANTS Conference 2008: 84-95 - [c29]
- [c28]Renaud Lenne, Christine Solnon, Thomas Stützle, Eric Tannier, Mauro Birattari:
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem. EvoCOP 2008: 266-276 - 2007
- [j6]Inès Alaya, Christine Solnon, Khaled Ghédira:
Optimisation par colonies de fourmis pour le problème du sac à dos multidimensionnel. Technique et Science Informatiques 26(3-4): 371-390 (2007) - [c27]Stéphane Zampelli, Yves Deville, Christine Solnon, Sébastien Sorlin, Pierre Dupont:
Filtering for Subgraph Isomorphism. CP 2007: 728-742 - [c26]Christine Solnon, Jean-Michel Jolion:
Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain. GbRPR 2007: 404-414 - [c25]Inès Alaya, Christine Solnon, Khaled Ghédira:
Ant Colony Optimization for Multi-Objective Optimization Problems. ICTAI (1) 2007: 450-457 - [p1]Sébastien Sorlin, Christine Solnon, Jean-Michel Jolion:
A Generic Graph Distance Measure Based on Multivalent Matchings. Applied Graph Theory in Computer Vision and Pattern Recognition 2007: 151-181 - 2006
- [j5]Christine Solnon, Serge Fenet:
A study of ACO capabilities for solving the maximum clique problem. J. Heuristics 12(3): 155-180 (2006) - [j4]François Fages, Narendra Jussien, Christine Solnon:
Editorial. RAIRO - Operations Research 40(4): 325-326 (2006) - [c24]Olfa Sammoud, Sébastien Sorlin, Christine Solnon, Khaled Ghédira:
A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems. EvoCOP 2006: 234-246 - 2005
- [c23]Claudia Zepeda, Mauricio Osorio, Juan Carlos Nieves, Christine Solnon, David Sol:
Applications of Preferences using Answer Set Programming. Answer Set Programming 2005 - [c22]Olfa Sammoud, Christine Solnon, Khaled Ghédira:
Ant Algorithm for the Graph Matching Problem. EvoCOP 2005: 213-223 - [c21]Sébastien Sorlin, Christine Solnon:
Reactive Tabu Search for Measuring Graph Similarity. GbRPR 2005: 172-182 - 2004
- [c20]Sébastien Sorlin, Christine Solnon:
A Global Constraint for Graph Isomorphism Problems. CPAIOR 2004: 287-302 - [c19]Jano I. van Hemert, Christine Solnon:
A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems. EvoCOP 2004: 114-123 - [c18]Sébastien Sorlin, Christine Solnon:
Une contrainte globale pour le problème de l'isomorphisme de graphes. JFPLC 2004 - [c17]Claudia Zepeda, Christine Solnon, David Sol:
Planning Operation: An Extensio'n of a Geographical Information System. LA-NMR 2004 - 2003
- [j3]Christine Solnon:
Un cours "électronique" sur la programmation par contraintes. Technique et Science Informatiques 22(1): 77-80 (2003) - [c16]Serge Fenet, Christine Solnon:
Searching for Maximum Cliques with Ant Colony Optimization. EvoWorkshops 2003: 236-245 - [c15]Jens Gottlieb, Markus Puchta, Christine Solnon:
A Study of Greedy, Local Search, and Ant Colony Optimization Approaches for Car Sequencing Problems. EvoWorkshops 2003: 246-257 - [c14]Pierre-Antoine Champin, Christine Solnon:
Measuring the Similarity of Labeled Graphs. ICCBR 2003: 80-95 - [c13]
- 2002
- [j2]Christine Solnon:
Ants can solve constraint satisfaction problems. IEEE Trans. Evolutionary Computation 6(4): 347-357 (2002) - [c12]
- 2001
- [c11]
- 2000
- [c10]Christine Solnon:
Solving Permutation Constraint Satisfaction Problems with Artificial Ants. ECAI 2000: 118-122 - [c9]Christine Solnon:
Ant-P-Solveur: un solveur de contraintes à base de fourmis artificielles. JFPLC 2000: 189-204
1990 – 1999
- 1997
- [j1]Michel Rueher, Christine Solnon:
Concurrent Cooperating Solvers over Reals. Reliable Computing 3(3): 325-333 (1997) - [c8]
- [c7]Christine Solnon:
Coopération de solveurs linéaires sur les réels pour la résolution de problèmes linéaires sur les entiers. JFPLC 1997: 211- - 1994
- [c6]Christine Solnon, Michel Rueher:
Inférence de contraintes ensemblistes à partir de programmes Prolog - Application à la deduction de relations d'héritage. JFPLC 1994: 239- - [c5]Christine Solnon, Michel Rueher:
Propagation of Inter-argument Dependencies in "Tuple-distributive" Type Inference Systems. LOPSTR 1994: 199-214 - 1993
- [c4]Christine Solnon, Michel Rueher:
Extracting Inheritance Hierarchies from Prolog Programs: A System Based on the Inference of Type Relations. LPAR 1993: 309-320 - 1992
- [c3]Christine Solnon, Michel Rueher:
Du prototype Prolog vers un modèle objet: une approche basée sur l'inférence des relations inter-types. JFPL 1992: 284- - [c2]Christine Solnon, Michel Rueher:
Inference of Inheritance Relationships from Prolog Programs: a System Developed with PrologIII. PLILP 1992: 489-490 - 1991
- [c1]Christine Solnon, Michel Rueher:
Using a Prolog Prototype for Designing an Object Oriented Scheme. LOPSTR 1991: 300-317
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-01-23 00:28 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
