Countries citing papers authored by Andrew Davenport
Since
Specialization
Citations
This map shows the geographic impact of Andrew Davenport'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 Andrew Davenport with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrew Davenport more than expected).
Fields of papers citing papers by Andrew Davenport
This network shows the impact of papers produced by Andrew Davenport. 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 Andrew Davenport. The network helps show where Andrew Davenport may publish in the future.
Co-authorship network of co-authors of Andrew Davenport
This figure shows the co-authorship network connecting the top 25 collaborators of Andrew Davenport.
A scholar is included among the top collaborators of Andrew Davenport 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 Andrew Davenport. Andrew Davenport is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
15 of 15 papers shown
1.
Davenport, Andrew, et al.. (2014). Slack-Based Techniques for Robust Schedules.34 indexed citations
Conitzer, Vincent, Andrew Davenport, & Jayant Kalagnanam. (2006). Improved bounds for computing Kemeny rankings. National Conference on Artificial Intelligence. 620–626.82 indexed citations
4.
Davenport, Andrew & Jayant Kalagnanam. (2004). A computational study of the Kemeny rule for preference aggregation. National Conference on Artificial Intelligence. 697–702.52 indexed citations
Beck, J. Christopher, Andrew Davenport, & Maria Fox. (1997). Five Pitfalls of Empirical Scheduling Research.4 indexed citations
12.
Beck, J. Christopher, et al.. (1997). Beyond contention: extending texture-based scheduling heuristics. National Conference on Artificial Intelligence. 233–240.12 indexed citations
13.
Beck, J. Christopher, et al.. (1997). Texture-based heuristics for scheduling revisited. National Conference on Artificial Intelligence. 241–248.36 indexed citations
14.
Davenport, Andrew & Edward Tsang. (1995). An Empirical Investigation Into the Exceptionally Hard Problems.4 indexed citations
15.
Davenport, Andrew, et al.. (1994). GENET: a connectionist architecture for solving constraint satisfaction problems by iterative improvement. OpenGrey (Institut de l'Information Scientifique et Technique). 325–330.77 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.