Glencora Borradaile

789 total citations
31 papers, 293 citations indexed

About

Glencora Borradaile is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications. According to data from OpenAlex, Glencora Borradaile has authored 31 papers receiving a total of 293 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 13 papers in Computer Graphics and Computer-Aided Design and 10 papers in Computer Networks and Communications. Recurrent topics in Glencora Borradaile's work include Complexity and Algorithms in Graphs (18 papers), Computational Geometry and Mesh Generation (13 papers) and Advanced Graph Theory Research (13 papers). Glencora Borradaile is often cited by papers focused on Complexity and Algorithms in Graphs (18 papers), Computational Geometry and Mesh Generation (13 papers) and Advanced Graph Theory Research (13 papers). Glencora Borradaile collaborates with scholars based in United States, Canada and Denmark. Glencora Borradaile's co-authors include Philip N. Klein, Claire Mathieu, Christian Wulff‐Nilsen, Shay Mozes, Yahav Nussbaum, Gordon Wilfong, Erik D. Demaine, Pascal Van Hentenryck, Joshua Reeves and Piotr Sankowski and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and Mathematical Programming.

In The Last Decade

Glencora Borradaile

28 papers receiving 276 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Glencora Borradaile United States 11 193 94 75 42 41 31 293
Naonori Kakimura Japan 8 171 0.9× 78 0.8× 14 0.2× 28 0.7× 48 1.2× 61 262
Ran Duan United States 7 153 0.8× 138 1.5× 14 0.2× 30 0.7× 67 1.6× 18 274
Ewald Speckenmeyer Germany 8 341 1.8× 199 2.1× 57 0.8× 32 0.8× 129 3.1× 26 446
Thomas Andreae Germany 10 275 1.4× 78 0.8× 37 0.5× 42 1.0× 32 0.8× 39 365
Ravi Sundaram United States 8 123 0.6× 190 2.0× 12 0.2× 54 1.3× 24 0.6× 13 289
Yuval Filmus Israel 10 157 0.8× 78 0.8× 32 0.4× 37 0.9× 122 3.0× 53 300
Christoph Ambühl Switzerland 9 114 0.6× 171 1.8× 20 0.3× 17 0.4× 56 1.4× 15 279
Ariel Kulik Israel 6 115 0.6× 145 1.5× 37 0.5× 28 0.7× 68 1.7× 11 254
Barun Chandra United States 7 107 0.6× 100 1.1× 60 0.8× 29 0.7× 56 1.4× 12 254
Kiyohito Nagano Japan 8 104 0.5× 113 1.2× 16 0.2× 57 1.4× 69 1.7× 11 224

Countries citing papers authored by Glencora Borradaile

Since Specialization
Citations

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

Fields of papers citing papers by Glencora Borradaile

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Glencora Borradaile

This figure shows the co-authorship network connecting the top 25 collaborators of Glencora Borradaile. A scholar is included among the top collaborators of Glencora Borradaile 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 Glencora Borradaile. Glencora Borradaile 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.
Borradaile, Glencora. (2021). What Is Encryption. 1 indexed citations
2.
Borradaile, Glencora, William Maxwell, & Amir Nayyeri. (2020). Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15.
3.
Borradaile, Glencora, et al.. (2020). Whose Tweets are Surveilled for the Police: An Audit of Social-Media Monitoring Tool via Log Files. arXiv (Cornell University). 1 indexed citations
4.
Borradaile, Glencora & Joshua Reeves. (2020). Sousveillance Capitalism. Surveillance & Society. 18(2). 272–275. 10 indexed citations
5.
Borradaile, Glencora, et al.. (2017). Egalitarian Graph Orientations. Journal of Graph Algorithms and Applications. 21(4). 687–708. 8 indexed citations
6.
Borradaile, Glencora, Erin Wolf Chambers, Kyle Fox, & Amir Nayyeri. (2017). Minimum cycle and homology bases of surface-embedded graphs. arXiv (Cornell University). 8(2). 58–79. 1 indexed citations
7.
Borradaile, Glencora, Philip N. Klein, Shay Mozes, Yahav Nussbaum, & Christian Wulff‐Nilsen. (2017). Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. SIAM Journal on Computing. 46(4). 1280–1303. 21 indexed citations
8.
Borradaile, Glencora & Philip N. Klein. (2016). The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs. ACM Transactions on Algorithms. 12(3). 1–29. 1 indexed citations
9.
Borradaile, Glencora, Philip N. Klein, & Claire Mathieu. (2015). A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. ACM Transactions on Algorithms. 11(3). 1–20. 8 indexed citations
10.
Borradaile, Glencora, et al.. (2015). Planar Induced Subgraphs of Sparse Graphs. Journal of Graph Algorithms and Applications. 19(1). 281–297.
11.
Borradaile, Glencora & Erin Wolf Chambers. (2014). Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls. Discrete & Computational Geometry. 51(4). 979–996. 3 indexed citations
12.
Borradaile, Glencora, et al.. (2012). Planted-model evaluation of algorithms for identifying differences between spreadsheets. 7–14. 7 indexed citations
13.
Borradaile, Glencora, et al.. (2012). The knapsack problem with neighbour constraints. Journal of Discrete Algorithms. 16. 224–235. 17 indexed citations
14.
Azimi, Javad, et al.. (2012). Batch Active Learning via Coordinated Matching. arXiv (Cornell University). 307–314. 13 indexed citations
15.
Borradaile, Glencora, James R. Lee, & Anastasios Sidiropoulos. (2010). Randomly removing g handles at once. Computational Geometry. 43(8). 655–662. 1 indexed citations
16.
Borradaile, Glencora, et al.. (2009). Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 7 indexed citations
17.
Borradaile, Glencora & Philip N. Klein. (2009). An O ( n log n ) algorithm for maximum st -flow in a directed planar graph. Journal of the ACM. 56(2). 1–30. 39 indexed citations
18.
Borradaile, Glencora, et al.. (2009). Approximation Algorithms for Constrained Knapsack Problems. 2 indexed citations
19.
Borradaile, Glencora, Philip N. Klein, & Claire Mathieu. (2008). A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. 115–124. 11 indexed citations
20.
Borradaile, Glencora & Philip N. Klein. (2006). An O (n log n) algorithm for maximum st-flow in a directed planar graph. 524–533. 4 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

Rankless by CCL
2026