This map shows the geographic impact of Jeff Erickson'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 Jeff Erickson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jeff Erickson more than expected).
This network shows the impact of papers produced by Jeff Erickson. 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 Jeff Erickson. The network helps show where Jeff Erickson may publish in the future.
Co-authorship network of co-authors of Jeff Erickson
This figure shows the co-authorship network connecting the top 25 collaborators of Jeff Erickson.
A scholar is included among the top collaborators of Jeff Erickson 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 Jeff Erickson. Jeff Erickson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Burton, Benjamin A., Herbert Edelsbrunner, Jeff Erickson, & Stephan Tillmann. (2016). Computational Geometric and Algebraic Topology. Oberwolfach Reports. 12(4). 2637–2699.1 indexed citations
3.
Erickson, Jeff, et al.. (2015). Detecting weakly simple polygons. Symposium on Discrete Algorithms. 1655–1670.7 indexed citations
Cabello, Sergio, Matt DeVos, Jeff Erickson, & Bojan Mohar. (2008). Finding one tight cycle. Symposium on Discrete Algorithms. 527–531.6 indexed citations
7.
Devillers, Olivier, Jeff Erickson, & Xavier Goaoc. (2008). Empty-ellipse graphs. HAL (Le Centre pour la Communication Scientifique Directe). 1249–1257.2 indexed citations
Guoy, Damrong & Jeff Erickson. (2004). Automatic Blocking Scheme for Structured Meshing in 2d Multiphase Flow Simulation.. IMR. 121–132.7 indexed citations
11.
Agarwal, Pankaj K., Lars Arge, & Jeff Erickson. (2003). Indexing Moving Points. Journal of Computer and System Sciences. 66(1). 207–243.142 indexed citations
12.
Erickson, Jeff, Damrong Guoy, John M. Sullivan, & Alper Üngör. (2002). Building Space-Time Meshes Over Arbitrary Spatial Domains.. IMR. 391–402.17 indexed citations
Aichholzer, Oswin, Erik D. Demaine, Jeff Erickson, et al.. (2000). Reconfiguring Convex Polygons.. Utrecht University Repository (Utrecht University).2 indexed citations
Erickson, Jeff. (1995). On the relative complexities of some geometric problems.. Canadian Conference on Computational Geometry. 85–90.23 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.