Kyle Fox

415 total citations
27 papers, 144 citations indexed

About

Kyle Fox is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Kyle Fox has authored 27 papers receiving a total of 144 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computer Networks and Communications, 11 papers in Computational Theory and Mathematics and 9 papers in Computer Vision and Pattern Recognition. Recurrent topics in Kyle Fox's work include Computational Geometry and Mesh Generation (8 papers), Optimization and Search Problems (6 papers) and Data Management and Algorithms (6 papers). Kyle Fox is often cited by papers focused on Computational Geometry and Mesh Generation (8 papers), Optimization and Search Problems (6 papers) and Data Management and Algorithms (6 papers). Kyle Fox collaborates with scholars based in United States, Israel and Canada. Kyle Fox's co-authors include Pankaj K. Agarwal, Kamesh Munagala, Sungjin Im, Benjamin Moseley, Madhukar Korupolu, Amir Nayyeri, Jeff Erickson, Rex Ying, Yusu Wang and Anastasios Sidiropoulos and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Algorithmica.

In The Last Decade

Kyle Fox

22 papers receiving 142 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Kyle Fox United States 8 45 41 40 37 30 27 144
Christiane Lammersen Germany 4 79 1.8× 41 1.0× 18 0.5× 34 0.9× 150 5.0× 7 208
Johannes Singler Germany 8 27 0.6× 152 3.7× 16 0.4× 42 1.1× 73 2.4× 12 256
Barun Chandra United States 7 18 0.4× 100 2.4× 107 2.7× 30 0.8× 56 1.9× 12 254
Toshinobu Kashiwabara Japan 7 13 0.3× 86 2.1× 115 2.9× 18 0.5× 38 1.3× 23 256
Roberto Asín‐Achá Chile 8 12 0.3× 68 1.7× 74 1.9× 35 0.9× 73 2.4× 21 188
Joachim Kneis Germany 10 9 0.2× 101 2.5× 154 3.9× 21 0.6× 29 1.0× 17 220
H.-W. Six Germany 9 177 3.9× 114 2.8× 20 0.5× 50 1.4× 105 3.5× 17 282
Mingxuan Yuan Hong Kong 11 30 0.7× 110 2.7× 29 0.7× 71 1.9× 23 0.8× 24 310
Pino Persiano Italy 8 15 0.3× 126 3.1× 48 1.2× 37 1.0× 83 2.8× 15 223
Leszek Siwik Poland 7 7 0.2× 23 0.6× 48 1.2× 8 0.2× 74 2.5× 24 141

Countries citing papers authored by Kyle Fox

Since Specialization
Citations

This map shows the geographic impact of Kyle Fox'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 Kyle Fox with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kyle Fox more than expected).

Fields of papers citing papers by Kyle Fox

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Kyle Fox. 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 Kyle Fox. The network helps show where Kyle Fox may publish in the future.

Co-authorship network of co-authors of Kyle Fox

This figure shows the co-authorship network connecting the top 25 collaborators of Kyle Fox. A scholar is included among the top collaborators of Kyle Fox 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 Kyle Fox. Kyle Fox is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Fox, Kyle, et al.. (2022). Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions. ACM Transactions on Algorithms. 19(2). 1–22.
2.
Daescu, Ovidiu, et al.. (2018). Trajectory Planning for an Articulated Probe.. Canadian Conference on Computational Geometry. 296–303. 1 indexed citations
3.
Fox, Kyle, Sungjin Im, & Benjamin Moseley. (2018). Energy efficient scheduling of parallelizable jobs. Theoretical Computer Science. 726. 30–40. 8 indexed citations
4.
Agarwal, Pankaj K., et al.. (2018). Computing the Gromov-Hausdorff Distance for Metric Trees. ACM Transactions on Algorithms. 14(2). 1–20. 16 indexed citations
5.
Agarwal, Pankaj K., et al.. (2018). Subtrajectory Clustering. 75–87. 20 indexed citations
6.
Agarwal, Pankaj K., et al.. (2017). Faster Algorithms for the Geometric Transportation Problem. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
7.
8.
Agarwal, Pankaj K., et al.. (2016). Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures. 429–440. 15 indexed citations
9.
Agarwal, Pankaj K., et al.. (2016). Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 8 indexed citations
10.
Ying, Rex, et al.. (2016). A simple efficient approximation algorithm for dynamic time warping. 1–10. 9 indexed citations
11.
Fox, Kyle, Philip N. Klein, & Shay Mozes. (2015). A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection. 841–850. 5 indexed citations
12.
Fox, Kyle, et al.. (2014). Spanning Paths in Fibonacci-Sum Graphs. ˜The œFibonacci quarterly. 52(1). 46–49.
13.
Fox, Kyle & Madhukar Korupolu. (2013). Weighted flowtime on capacitated machines. Symposium on Discrete Algorithms. 129–143. 4 indexed citations
14.
Fox, Kyle. (2013). Shortest non-trivial cycles in directed and undirected surface graphs. Symposium on Discrete Algorithms. 352–364. 4 indexed citations
15.
Chambers, Erin Wolf, Kyle Fox, & Amir Nayyeri. (2013). Counting and sampling minimum cuts in genus g graphs. 249–258.
16.
Fox, Kyle & Madhukar Korupolu. (2013). Weighted Flowtime on Capacitated Machines. 5 indexed citations
17.
Erickson, Jeff, Kyle Fox, & Amir Nayyeri. (2012). Global minimum cuts in surface embedded graphs. Symposium on Discrete Algorithms. 1309–1318. 8 indexed citations
18.
Erickson, Jeff, Kyle Fox, & Amir Nayyeri. (2012). Global Minimum Cuts in Surface Embedded Graphs. 1309–1318. 4 indexed citations
19.
Fox, Kyle. (2011). Faster Shortest Non-contractible Cycles in Directed Surface Graphs. arXiv (Cornell University). 2 indexed citations
20.
Fox, Kyle, et al.. (2007). A unified platform for archival description and access. 157–166. 7 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

Breakdown of academic impact, for papers by Christiane Lammersen Breakdown of academic impact, for papers by Johannes Singler Breakdown of academic impact, for papers by Barun Chandra Breakdown of academic impact, for papers by Toshinobu Kashiwabara Breakdown of academic impact, for papers by Roberto Asín‐Achá Breakdown of academic impact, for papers by Joachim Kneis Breakdown of academic impact, for papers by H.-W. Six Breakdown of academic impact, for papers by Mingxuan Yuan Breakdown of academic impact, for papers by Pino Persiano Breakdown of academic impact, for papers by Leszek Siwik
Rankless by CCL
2026