Chris Harrelson
Impact in
- Signal Processing top 2%
- Data Management and Algorithms
-
- Computational Geometry and Mesh Generation
Papers in
-
- Complexity and Algorithms in Graphs 6
- Advanced Graph Theory Research 5
-
- Optimization and Search Problems 4
- Co-authors
- Andrew V. Goldberg (1 shared paper)Satish Rao (2 shared papers)Jittat Fakcharoenphol (4 shared papers)Kirsten Hildrum (2 shared papers)Kunal Talwar (2 shared papers)Aaron Archer (1 shared paper)Robert Krauthgamer (1 shared paper)Éva Tardos (1 shared paper)
- Journals
- ACM Transactions on Algorithms (1 paper)Symposium on Discrete Algorithms (4 papers)
- Partner nations
- United StatesThailand
In The Last Decade
Chris Harrelson
7 papers receiving 608 citations
Chris Harrelson's Hit Papers
Peers
Comparison fields: 5 of 57
- Signal Processing 288
- Computer Graphics and Computer-Aided Design 62
- Computer Networks and Communications 271
- Transportation 74
- Industrial and Manufacturing Engineering 96
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-authors
The 10 scholars most cited alongside Chris Harrelson, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Computing the shortest path: A search meets graph theory Hit paper breakdown → | 2005 | 452 |
| 2 | 2003 | 71 | |
| 3 | 2007 | 45 | |
| 4 | 2003 | 40 | |
| 5 | 2003 | 31 | |
| 6 | 2004 | 16 | |
| 7 | 2003 | 2 | |
| 8 | 2024 | 0 |
About Chris Harrelson
Chris Harrelson is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Signal Processing, Ecology and Ocean Engineering, having authored 8 papers that have together received 657 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (6 papers), Advanced Graph Theory Research (5 papers), Optimization and Search Problems (4 papers), Data Management and Algorithms (2 papers), Automated Road and Building Extraction (1 paper), Wildlife-Road Interactions and Conservation (1 paper), Cryptography and Data Security (1 paper) and Computational Geometry and Mesh Generation (1 paper). The work is most often cited by research in Signal Processing (288 citations), Computer Graphics and Computer-Aided Design (62 citations), Computer Networks and Communications (271 citations), Transportation (74 citations) and Industrial and Manufacturing Engineering (96 citations). Chris Harrelson has collaborated with scholars based in United States and Thailand. Frequent co-authors include Andrew V. Goldberg, Satish Rao, Jittat Fakcharoenphol, Kirsten Hildrum, Satish Rao, Kunal Talwar, Aaron Archer, Robert Krauthgamer, Éva Tardos 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.