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.
Ant colony optimization
20063.6k citationsMarco Dorigo, Mauro Birattari et al.profile →
– Ant System
20001.8k citationsThomas Stützle, Holger H. Hoosprofile →
Ant Colony Optimization
20041.7k citationsMarco Dorigo, Thomas Stützleprofile →
Ant Colony Optimization
20061.3k citationsMarco Dorigo, Mauro Birattari et al.profile →
Empirical Scoring Functions for Advanced Protein−Ligand Docking with PLANTS
Countries citing papers authored by Thomas Stützle
Since
Specialization
Citations
This map shows the geographic impact of Thomas Stützle'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 Thomas Stützle with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Stützle more than expected).
This network shows the impact of papers produced by Thomas Stützle. 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 Thomas Stützle. The network helps show where Thomas Stützle may publish in the future.
Co-authorship network of co-authors of Thomas Stützle
This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Stützle.
A scholar is included among the top collaborators of Thomas Stützle 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 Thomas Stützle. Thomas Stützle is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Pellegrini, Paola, Thomas Stützle, & Mauro Birattari. (2010). Off-line vs. on-line tuning: a study on MAX–MIN ant system for the TSP. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 239–250.8 indexed citations
4.
López‐Ibáñez, Manuel & Thomas Stützle. (2010). Automatic Configuration of Multi-Objective ACO Algorithms. Lecture notes in computer science. 6234. 94–105.17 indexed citations
5.
Peña, Jorge, et al.. (2009). Heterogeneous Particle Swarm Optimizers. IEEE Transactions on Evolutionary Computation. 698–705.17 indexed citations
6.
Hutter, Frank, Holger H. Hoos, & Thomas Stützle. (2007). Automatic algorithm configuration based on local search. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 1152–1157.138 indexed citations
7.
Balaprakash, Prasanna, Mauro Birattari, & Thomas Stützle. (2007). Improvement strategies for the F-Race algorithm: sampling design and iterative refinement. Lecture notes in computer science. 108–122.100 indexed citations
8.
Balaprakash, Prasanna, Mauro Birattari, Thomas Stützle, et al.. (2007). An experimental study of estimation-based metaheuristics for the probabilistic traveling salesman problem. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles).3 indexed citations
9.
Dorigo, Marco, Luca Maria Gambardella, Mauro Birattari, et al.. (2006). Ant Colony Optimization and Swarm Intelligence: 5th International Workshop, ANTS 2006, Brussels, Belgium, September 4-7, 2006, Proceedings (Lecture Notes in Computer Science). Springer eBooks.9 indexed citations
10.
Hutter, Frank, Holger H. Hoos, & Thomas Stützle. (2005). Efficient stochastic local search for MPE solving. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 169–174.25 indexed citations
11.
Sampels, Michaël, Mauro Birattari, Marco Chiarandini, et al.. (2003). A comparison of the performance of different metaheuristics on the timetabling problem. Lecture notes in computer science. 2740. 329–351.101 indexed citations
12.
Dorigo, Marco, Luca Maria Gambardella, Martin Middendorf, & Thomas Stützle. (2002). Special Issue on Aut algorithms. IEEE Transactions on Evolutionary Computation. 6(4). 317–365.1 indexed citations
13.
Paquete, Luís & Thomas Stützle. (2002). Empirical analysis of tabu search for the lexicographic optimization of the examination timetabling problem. Lecture notes in computer science. 2740. 413–420.18 indexed citations
14.
Birattari, Mauro, et al.. (2002). A Racing Algorithm for Configuring Metaheuristics. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 11–18.291 indexed citations
15.
Dorigo, Marco, Thomas Stützle, & Nikos E. Mastorakis. (2001). An Experimental Study of the Simple Ant Colony Optimization Algorithm. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 253–258.32 indexed citations
16.
Hoos, Holger H., Thomas Stützle, Ian P. Gent, Hans van Maaren, & Toby Walsh. (2000). SATLIB: An Online Resource for Research on SAT. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 283–292.159 indexed citations
17.
Stützle, Thomas & Marco Dorigo. (1999). ACO algorithms for the quadratic assignment problem. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 33–50.180 indexed citations
18.
Stützle, Thomas, et al.. (1998). Ameisenalgorithmen zur L¨osung kombinatorischer Optimierungsprobleme. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 15. 45–51.1 indexed citations
19.
Stützle, Thomas. (1997). Lokale Suchverfahren für Constrain Satisfaction Probleme: die min conflicts Heuristik und Tabu Search.. Künstliche Intell.. 11. 14–20.1 indexed citations
20.
Stützle, Thomas. (1995). A Neural Network Approach to Quality Control Charts. Lecture notes in computer science. 930. 1135–1141.
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.