Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
On the min-cost Traveling Salesman Problem with Drone
2017421 citationsQuang Minh Ha, Yves Deville et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Yves Deville'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 Yves Deville with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yves Deville more than expected).
This network shows the impact of papers produced by Yves Deville. 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 Yves Deville. The network helps show where Yves Deville may publish in the future.
Co-authorship network of co-authors of Yves Deville
This figure shows the co-authorship network connecting the top 25 collaborators of Yves Deville.
A scholar is included among the top collaborators of Yves Deville 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 Yves Deville. Yves Deville 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.
Ha, Quang Minh, et al.. (2015). Heuristic methods for the Traveling Salesman Problem with Drone.. arXiv (Cornell University).17 indexed citations
2.
Thắng, Huỳnh Quyết, et al.. (2014). Proceedings of the Fifth Symposium on Information and Communication Technology.9 indexed citations
3.
Deville, Yves, et al.. (2013). A Multi-Stage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time-Windows.21 indexed citations
4.
Duluc, Claire-Marie, et al.. (2013). Use of historical information in extreme storm surges frequency analysis. EGU General Assembly Conference Abstracts.2 indexed citations
Schaus, Pierre, et al.. (2010). Generic adaptive heuristics for large neighborhood search. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).1 indexed citations
7.
Quesada, Luis, Peter Van Roy, & Yves Deville. (2008). Speeding up constrained path solvers with a reachability propagator.
8.
Schaus, Pierre & Yves Deville. (2008). A global constraint for bin-packing with precedences: application to the assembly line balancing problem. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 369–374.7 indexed citations
9.
Tan, Aik Choon, David Gilbert, & Yves Deville. (2003). Integrative machine learning approach for multi-class SCOP protein fold classification. Brunel University Research Archive (BURA) (Brunel University London). 153–159.1 indexed citations
10.
Hentenryck, Pascal Van, et al.. (2001). A Constraint Satisfaction Approach to Parametric Differential Equations. International Joint Conference on Artificial Intelligence. 297–302.12 indexed citations
11.
Deville, Yves, et al.. (2001). Acceptance driven Local Search and Evolutionary Algorithms. Genetic and Evolutionary Computation Conference. 1173–1180.1 indexed citations
12.
Deville, Yves, et al.. (2000). Simulated Annealing with estimated temperature. AI Communications. 13(1). 19–26.16 indexed citations
Deville, Yves, et al.. (1998). Consistency Techniques in Ordinary Differential Equations.2 indexed citations
15.
Quesada, Luis, et al.. (1994). Using dominators for solving constrained path problems.6 indexed citations
16.
Deville, Yves & Kung-Kiu Lau. (1994). Logic program synthesis. The Journal of Logic Programming. 19-20. 321–350.30 indexed citations
17.
Hentenryck, Pascal Van, et al.. (1993). DESIGN, IMPLEMENTATION, AND EVALUATION OF THE CONSTRAINT LANGUAGE cc(FD).
18.
Deville, Yves & Pascal Van Hentenryck. (1991). An efficient arc consistency algorithm for a class of CSP problems. International Joint Conference on Artificial Intelligence. 325–330.44 indexed citations
19.
Hentenryck, Pascal Van & Yves Deville. (1990). The Cardinality Operator: A New Logical Connective for Constraint Logic Programming. International Conference on Lightning Protection. 383–403.4 indexed citations
20.
Deville, Yves. (1990). Logic programming: systematic program development. Addison-Wesley Longman Publishing Co., Inc. eBooks.39 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.