This map shows the geographic impact of John Iacono'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 John Iacono with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Iacono more than expected).
This network shows the impact of papers produced by John Iacono. 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 John Iacono. The network helps show where John Iacono may publish in the future.
Co-authorship network of co-authors of John Iacono
This figure shows the co-authorship network connecting the top 25 collaborators of John Iacono.
A scholar is included among the top collaborators of John Iacono 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 John Iacono. John Iacono is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Iacono, John & Mihai Pǎtraşcu. (2012). Using hashing to solve the dictionary problem. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles).5 indexed citations
Chen, Dan, Olivier Devillers, John Iacono, Stefan Langerman, & Pat Morin. (2010). Oja Medians and Centers of Mass. Canadian Conference on Computational Geometry.1 indexed citations
Demaine, Erik D., Martin L. Demaine, John Iacono, & Stefan Langerman. (2009). Wrapping spheres with flat paper. Computational Geometry. 42(8). 748–757.13 indexed citations
11.
Collette, Sébastien, Vida Dujmović, John Iacono, Stefan Langerman, & Pat Morin. (2007). Distribution-sensitive point location in convex subdivisions. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 2–921.7 indexed citations
12.
Aloupis, Greg, Jean Cardinal, Sébastien Collette, John Iacono, & Stefan Langerman. (2006). Where to build a temple, and where to dig to find one. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 1–4.2 indexed citations
13.
Demaine, Erik D., John Iacono, & Stefan Langerman. (2004). Worst-Case Optimal Tree Layout in a Memory Hierarchy. arXiv (Cornell University).7 indexed citations
14.
Demaine, Erik D., John Iacono, & Stefan Langerman. (2004). Retroactive data structures. Symposium on Discrete Algorithms. 15. 281–290.6 indexed citations
15.
Aronov, Boris & John Iacono. (2004). Detecting duplicates among similar bit vectors.
Iacono, John & Stefan Langerman. (2003). Proximate point location. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 220–226.4 indexed citations
Iacono, John & Stefan Langerman. (2000). Dynamic point location in fat hyperrectangles with integer coordinates.. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 181–186.6 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.