Chris Harrelson
- Signal Processing top 2%
- Computer Networks and Communications top 5%
- Computer Vision and Pattern Recognition top 5%
- Computational Theory and Mathematics top 5%
- Artificial Intelligence top 10%
- Co-authors
- Andrew V. GoldbergJittat FakcharoenpholSatish RaoKirsten HildrumKunal TalwarAaron ArcherÉva TardosRobert Krauthgamer
- Topics
- Complexity and Algorithms in Graphs (6 papers)Advanced Graph Theory Research (5 papers)Optimization and Search Problems (4 papers)
- Cited by
- Signal ProcessingComputer Graphics and Computer-Aided DesignComputer Networks and Communications
- Journals
- ACM Transactions on AlgorithmsSymposium on Discrete Algorithms
- Partner nations
- United StatesThailand
In The Last Decade
Chris Harrelson
7 papers receiving 606 citations
Hit Papers
Peers
Comparison fields: 5 of 57
- Signal Processing 286
- Computer Networks and Communications 271
- Computer Vision and Pattern Recognition 164
- Computational Theory and Mathematics 150
- Artificial Intelligence 105
Countries citing papers authored by Chris Harrelson
This map shows the geographic impact of Chris Harrelson'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 Chris Harrelson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chris Harrelson more than expected).
Fields of papers citing papers by Chris Harrelson
This network shows the impact of papers produced by Chris Harrelson. 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 Chris Harrelson. The network helps show where Chris Harrelson may publish in the future.
Co-authorship network of co-authors of Chris Harrelson
This figure shows the co-authorship network connecting the top 25 collaborators of Chris Harrelson. A scholar is included among the top collaborators of Chris Harrelson 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 Chris Harrelson. Chris Harrelson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 45 | |
| 3 | Computing the shortest path: A search meets graph theorybreakdown → | 450 |
| 4 | 16 | |
| 5 | 40 | |
| 6 | 31 | |
| 7 | 2 | |
| 8 | 71 |
About Chris Harrelson
Chris Harrelson is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Signal Processing, having authored 8 papers that have together received 655 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (6 papers), Advanced Graph Theory Research (5 papers) and Optimization and Search Problems (4 papers). The work is most often cited by research in Signal Processing (286 citations), Computer Graphics and Computer-Aided Design (62 citations) and Computer Networks and Communications (271 citations). Chris Harrelson has collaborated with scholars based in United States and Thailand. Frequent co-authors include Andrew V. Goldberg, Jittat Fakcharoenphol, Satish Rao, Kirsten Hildrum, Satish Rao, Kunal Talwar, Aaron Archer, Éva Tardos, Robert Krauthgamer and Pavel Panchekha. Their work appears in journals such as ACM Transactions on Algorithms and Symposium on Discrete Algorithms.
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.