Christine Solnon

2.7k total citations
37 papers, 673 citations indexed

About

Christine Solnon is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, Christine Solnon has authored 37 papers receiving a total of 673 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Artificial Intelligence, 13 papers in Computer Networks and Communications and 13 papers in Computer Vision and Pattern Recognition. Recurrent topics in Christine Solnon's work include Graph Theory and Algorithms (10 papers), Constraint Satisfaction and Optimization (10 papers) and Vehicle Routing Optimization Methods (9 papers). Christine Solnon is often cited by papers focused on Graph Theory and Algorithms (10 papers), Constraint Satisfaction and Optimization (10 papers) and Vehicle Routing Optimization Methods (9 papers). Christine Solnon collaborates with scholars based in France, Belgium and United States. Christine Solnon's co-authors include Christian Artigues, Serge Fenet, Yves Deville, Guillaume Damiand, Colin de la Higuera, Pascal Lafourcade, Marine Minier, David Gérault, Patrick Prosser and Ciaran McCreesh and has published in prestigious journals such as European Journal of Operational Research, Pattern Recognition and Artificial Intelligence.

In The Last Decade

Christine Solnon

33 papers receiving 634 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Christine Solnon France 13 285 261 184 156 100 37 673
Zhang-Hua Fu China 16 261 0.9× 299 1.1× 130 0.7× 90 0.6× 198 2.0× 45 749
Heiko Röglin Germany 14 207 0.7× 100 0.4× 66 0.4× 100 0.6× 110 1.1× 49 511
Peter Merz Germany 13 506 1.8× 275 1.1× 55 0.3× 205 1.3× 262 2.6× 32 882
Chung Keung Poon Hong Kong 14 149 0.5× 216 0.8× 47 0.3× 323 2.1× 88 0.9× 69 605
Tania Querido Brazil 7 147 0.5× 270 1.0× 118 0.6× 106 0.7× 78 0.8× 8 583
Una Benlic China 17 257 0.9× 407 1.6× 56 0.3× 161 1.0× 133 1.3× 32 772
Vicente Campos Spain 15 262 0.9× 569 2.2× 61 0.3× 167 1.1× 188 1.9× 29 895
Chu-Min Li France 17 318 1.1× 152 0.6× 61 0.3× 276 1.8× 313 3.1× 58 629
Dalila Boughaci Algeria 13 251 0.9× 84 0.3× 80 0.4× 148 0.9× 44 0.4× 64 512

Countries citing papers authored by Christine Solnon

Since Specialization
Citations

This map shows the geographic impact of Christine Solnon's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Christine Solnon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Christine Solnon more than expected).

Fields of papers citing papers by Christine Solnon

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Christine Solnon. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Christine Solnon. The network helps show where Christine Solnon may publish in the future.

Co-authorship network of co-authors of Christine Solnon

This figure shows the co-authorship network connecting the top 25 collaborators of Christine Solnon. A scholar is included among the top collaborators of Christine Solnon based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Christine Solnon. Christine Solnon is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Xiao, Peng, François Schwarzentruber, Olivier Simonin, & Christine Solnon. (2025). Spanning-Tree Based Coverage for a Tethered Robot. IEEE Robotics and Automation Letters. 10(2). 1888–1895.
2.
Solnon, Christine, et al.. (2025). On the Phase Transition of the Euclidean Travelling Salesman Problem with Time Windows. Journal of Artificial Intelligence Research. 82. 2167–2188.
3.
Dibangoye, Jilles, et al.. (2023). Exact and anytime approach for solving the time dependent traveling salesman problem with time windows. European Journal of Operational Research. 311(3). 833–844. 1 indexed citations
4.
Xiao, Peng, Olivier Simonin, & Christine Solnon. (2023). Non-Crossing Anonymous MAPF for Tethered Robots. Journal of Artificial Intelligence Research. 78. 357–384. 2 indexed citations
5.
Chiabaut, Nicolas, et al.. (2020). On the impact of spatio-temporal granularity of traffic conditions on the quality of pickup and delivery optimal tours. Transportation Research Part E Logistics and Transportation Review. 142. 102085–102085. 12 indexed citations
6.
Solnon, Christine, et al.. (2020). A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering. Journal of Artificial Intelligence Research. 67. 509–547. 3 indexed citations
7.
McCreesh, Ciaran, et al.. (2018). When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases. Journal of Artificial Intelligence Research. 61. 723–759. 25 indexed citations
8.
Gérault, David, Pascal Lafourcade, Marine Minier, & Christine Solnon. (2018). Revisiting AES related-key differential attacks with constraint programming. Information Processing Letters. 139. 24–29. 22 indexed citations
9.
Higuera, Colin de la, et al.. (2013). Polynomial algorithms for open plane graph and subgraph isomorphisms. Theoretical Computer Science. 498. 76–99. 6 indexed citations
10.
Solnon, Christine. (2013). Ant Colony Optimization and Constraint Programming. HAL (Le Centre pour la Communication Scientifique Directe). 26 indexed citations
11.
Fages, François, et al.. (2013). On the subgraph epimorphism problem. Discrete Applied Mathematics. 162. 214–228. 9 indexed citations
12.
Damiand, Guillaume, et al.. (2012). From maximum common submaps to edit distances of generalized maps. Pattern Recognition Letters. 33(15). 2020–2028. 3 indexed citations
13.
Solnon, Christine. (2010). AllDifferent-based filtering for subgraph isomorphism. Artificial Intelligence. 174(12-13). 850–864. 83 indexed citations
14.
Solnon, Christine, et al.. (2007). 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. 132 indexed citations
15.
Solnon, Christine, et al.. (2006). Comparaison de l'optimisation par colonies de fourmis et d'une recherche réactive sur des problèmes d'appariement de graphes. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
16.
Solnon, Christine. (2002). Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation. 6(4). 347–357. 109 indexed citations
17.
Solnon, Christine. (2002). Cooperation of LP solvers for solving MILPs. 3. 240–247. 2 indexed citations
18.
Solnon, Christine. (2000). Solving permutation constraint satisfaction problems with Artificial Ants. European Conference on Artificial Intelligence. 118–122. 35 indexed citations
19.
Solnon, Christine. (2000). Ant-P-Solveur: un solveur de contraintes à base de fourmis artificielles.. 79(18). 189–204. 1 indexed citations
20.
Solnon, Christine. (1997). Coopération de solveurs linéaires sur les réels pour la résolution de problèmes linéaires sur les entiers.. 211. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026