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.
A Computational Study of the Job-Shop Scheduling Problem
1991584 citationsDavid Applegate, William J. Cookprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by David Applegate
Since
Specialization
Citations
This map shows the geographic impact of David Applegate'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 David Applegate with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Applegate more than expected).
This network shows the impact of papers produced by David Applegate. 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 David Applegate. The network helps show where David Applegate may publish in the future.
Co-authorship network of co-authors of David Applegate
This figure shows the co-authorship network connecting the top 25 collaborators of David Applegate.
A scholar is included among the top collaborators of David Applegate 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 David Applegate. David Applegate is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Cook, William J., David Applegate, Robert E. Bixby, & Vašek Chvátal. (2011). The Traveling Salesman Problem. Princeton University Press eBooks.208 indexed citations
7.
Balakrishnan, Suhrid, Carlos Scheidegger, Yifan Hu, et al.. (2011). Combining predictors for recommending music: the false positives' approach to KDD Cup track 2. 199–213.2 indexed citations
8.
Applegate, David, Robert E. Bixby, Vašek Chvátal, & William J. Cook. (2007). The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press eBooks.284 indexed citations
9.
Applegate, David & Jeffrey C. Lagarias. (2005). The 3x+1 semigroup. Journal of Number Theory. 117(1). 146–159.3 indexed citations
Applegate, David, William J. Cook, Sanjeeb Dash, & André Rohe. (2002). Solution of a Min-Max Vehicle Routing Problem. INFORMS journal on computing. 14(2). 132–143.95 indexed citations
Applegate, David, Robert E. Bixby, Vašek Chvátal, & William J. Cook. (1999). Finding Tours in the TSP. Rice Digital Scholarship Archive (Rice University).40 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.