Chris Harrelson

1.2k total citations · 1 hit paper
8 papers, 655 citations indexed

About

Chris Harrelson is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Signal Processing. According to data from OpenAlex, Chris Harrelson has authored 8 papers receiving a total of 655 indexed citations (citations by other indexed papers that have themselves been cited), including 6 papers in Computational Theory and Mathematics, 4 papers in Computer Networks and Communications and 2 papers in Signal Processing. Recurrent topics in Chris Harrelson's work include Complexity and Algorithms in Graphs (6 papers), Advanced Graph Theory Research (5 papers) and Optimization and Search Problems (4 papers). Chris Harrelson is often cited by papers focused on Complexity and Algorithms in Graphs (6 papers), Advanced Graph Theory Research (5 papers) and Optimization and Search Problems (4 papers). Chris Harrelson collaborates with scholars based in United States and Thailand. Chris Harrelson's 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 and has published in prestigious journals such as ACM Transactions on Algorithms and Symposium on Discrete Algorithms.

In The Last Decade

Chris Harrelson

7 papers receiving 606 citations

Hit Papers

align trajectories

What are hit papers?

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.

Computing the shortest path: A search meets graph theory

2005 450 citations Andrew V. Goldberg, Chris Harrelson Symposium on Discrete Algorithms profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Chris Harrelson United States	6	286	271	164	150	105	8	655
Dominik Schultes Germany	9	370 1.3×	247 0.9×	156 1.0×	75 0.5×	117 1.1×	16	706
Riko Jacob Denmark	12	127 0.4×	254 0.9×	103 0.6×	95 0.6×	141 1.3×	38	607
Daniele Frigioni Italy	14	140 0.5×	253 0.9×	112 0.7×	151 1.0×	132 1.3×	57	581
Karsten Weihe Germany	10	100 0.3×	108 0.4×	62 0.4×	92 0.6×	58 0.6×	53	381
Thomas Willhalm Germany	16	242 0.8×	799 2.9×	175 1.1×	42 0.3×	173 1.6×	34	1.1k
Sergio Cabello Slovenia	18	172 0.6×	116 0.4×	197 1.2×	382 2.5×	86 0.8×	75	762
William Yeoh United States	16	269 0.9×	531 2.0×	165 1.0×	68 0.5×	347 3.3×	97	921
Raphaël Rom Israel	12	191 0.7×	845 3.1×	50 0.3×	55 0.4×	54 0.5×	32	1.2k
Cid C. de Souza Brazil	18	45 0.2×	277 1.0×	58 0.4×	246 1.6×	100 1.0×	82	1.1k
Sanjiv Kapoor United States	17	158 0.6×	269 1.0×	184 1.1×	327 2.2×	85 0.8×	68	917

Countries citing papers authored by Chris Harrelson

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Sort: Min cites: Since: Top N: Style:

8 of 8 papers shown

1.

Panchekha, Pavel & Chris Harrelson. (2024). Web Browser Engineering.

2.

Fakcharoenphol, Jittat, Chris Harrelson, & Satish Rao. (2007). The k -traveling repairmen problem. ACM Transactions on Algorithms. 3(4). 40–40. 45 indexed citations

3.

Goldberg, Andrew V. & Chris Harrelson. (2005). Computing the shortest path: A search meets graph theory. Symposium on Discrete Algorithms. 156–165. 450 indexed citations breakdown →

4.

Archer, Aaron, Jittat Fakcharoenphol, Chris Harrelson, et al.. (2004). Approximate classification via earthmover metrics. Symposium on Discrete Algorithms. 1079–1087. 16 indexed citations

5.

Fakcharoenphol, Jittat, Chris Harrelson, & Satish Rao. (2003). The k-traveling repairman problem. Symposium on Discrete Algorithms. 655–664. 40 indexed citations

6.

Fakcharoenphol, Jittat, Chris Harrelson, Satish Rao, & Kunal Talwar. (2003). An improved approximation algorithm for the 0-extension problem. Symposium on Discrete Algorithms. 257–265. 31 indexed citations

7.

Harrelson, Chris, et al.. (2003). A polynomial-time tree decomposition to minimize congestion. 2 indexed citations

8.

Harrelson, Chris, Kirsten Hildrum, & Satish Rao. (2003). A polynomial-time tree decomposition to minimize congestion. 34–43. 71 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.

Explore authors with similar magnitude of impact