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.
This map shows the geographic impact of Toby Walsh'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 Toby Walsh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Toby Walsh more than expected).
This network shows the impact of papers produced by Toby Walsh. 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 Toby Walsh. The network helps show where Toby Walsh may publish in the future.
Co-authorship network of co-authors of Toby Walsh
This figure shows the co-authorship network connecting the top 25 collaborators of Toby Walsh.
A scholar is included among the top collaborators of Toby Walsh 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 Toby Walsh. Toby Walsh 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.
Loreggia, Andrea, Nina Narodytska, Francesca Rossi, Kristen Brent Venable, & Toby Walsh. (2015). Controlling Elections by Replacing Candidates or Votes. Adaptive Agents and Multi-Agents Systems. 1737–1738.6 indexed citations
2.
Harabor, Daniel, et al.. (2012). TRANSIT Routing on Video Game Maps. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. 8(1). 2–7.15 indexed citations
3.
Walsh, Toby, et al.. (2012). Finding Multi-criteria Optimal Paths in Multi-modal Public Transportation Networks using the Transit Algorithm. 19th ITS World CongressERTICO - ITS EuropeEuropean CommissionITS AmericaITS Asia-Pacific.13 indexed citations
4.
Brafman, Ronen I., Francesca Rossi, Domenico Salvagnin, Kristen Brent Venable, & Toby Walsh. (2010). Finding the next solution in constraint- and preference-based knowledge representation formalisms. Research Padua Archive (University of Padua). 425–433.13 indexed citations
Prestwich, Steven, Francesca Rossi, Kristen Brent Venable, & Toby Walsh. (2005). Constraint-based preferential optimization. Research Padua Archive (University of Padua). 461–466.22 indexed citations
9.
Hnich, Brahim, Zeynep Kiziltan, & Toby Walsh. (2004). Combining Symmetry Breaking with Other Constraints: lexicographic ordering with sums. Annals of Mathematics and Artificial Intelligence. 93–100.9 indexed citations
10.
Flener, Pierre, Alan M. Frisch, Brahim Hnich, et al.. (2002). Breaking Row and Column Symmetries in Matrix Models. White Rose Research Online (University of Leeds, The University of Sheffield, University of York).1 indexed citations
Walsh, Toby. (2001). Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming.21 indexed citations
13.
Colton, Simon, Alan Bundy, & Toby Walsh. (2000). Automatic Invention of Integer Sequences. Edinburgh Research Explorer (University of Edinburgh). 558–563.15 indexed citations
14.
Gent, Ian P., Holger H. Hoos, Patrick Prosser, & Toby Walsh. (1999). Morphing: combining structure and randomness. National Conference on Artificial Intelligence. 654–660.35 indexed citations
15.
Smith, Barbara M., Kostas Stergiou, & Toby Walsh. (1999). Modelling the Golomb Ruler Problem. OpenGrey (Institut de l'Information Scientifique et Technique).7 indexed citations
16.
Colton, Simon, Alan Bundy, & Toby Walsh. (1999). Automatic concept formation in pure mathematics. ERA. 786–793.24 indexed citations
17.
Gent, Ian P. & Toby Walsh. (1995). Phase Transitions from Real Computational Problems.11 indexed citations
18.
Bundy, Alan, et al.. (1994). Coloured Rippling: An Extension of a Theorem Proving Heuristic. Max Planck Institute for Plasma Physics. 85–89.6 indexed citations
19.
Giunchiglia, Fausto & Toby Walsh. (1992). Tree subsumption: reasoning with outlines. Institutional Research Information System (Università degli Studi di Trento). 77–81.4 indexed citations
20.
Giunchiglia, Fausto & Toby Walsh. (1989). Theorem proving with definitions. Institutional Research Information System (Università degli Studi di Trento). 175–183.7 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.