This map shows the geographic impact of Amr Elmasry'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 Amr Elmasry with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Amr Elmasry more than expected).
This network shows the impact of papers produced by Amr Elmasry. 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 Amr Elmasry. The network helps show where Amr Elmasry may publish in the future.
Co-authorship network of co-authors of Amr Elmasry
This figure shows the co-authorship network connecting the top 25 collaborators of Amr Elmasry.
A scholar is included among the top collaborators of Amr Elmasry 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 Amr Elmasry. Amr Elmasry is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Edelkamp, Stefan, Amr Elmasry, & Jyrki Katajainen. (2013). Weak heaps engineered. Journal of Discrete Algorithms. 23. 83–97.1 indexed citations
9.
Edelkamp, Stefan, Amr Elmasry, & Jyrki Katajainen. (2012). The weak-heap family of priority queues in theory and praxis. Research at the University of Copenhagen (University of Copenhagen). 103–112.4 indexed citations
Elmasry, Amr, et al.. (2007). On the power of structural violations in priority queues. Research at the University of Copenhagen (University of Copenhagen). 45–53.1 indexed citations
13.
Elmasry, Amr & Kazuhisa Makino. (2007). Finding Intersections of Bichromatic Segments Defined by Points.. Canadian Conference on Computational Geometry. 269–272.1 indexed citations
Elmasry, Amr & Khaled Elbassioni. (2005). Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane. MPG.PuRe (Max Planck Society). 248–251.2 indexed citations
16.
Elmasry, Amr, et al.. (2005). Relaxed weak queues: an alternative to run-relaxed heaps. Research at the University of Copenhagen (University of Copenhagen).1 indexed citations
17.
Elbassioni, Khaled, Amr Elmasry, & Vladimir Gurvich. (2004). A stronger version of Bárány's theorem in the plane.. Canadian Conference on Computational Geometry. 4–6.
18.
Elmasry, Amr, et al.. (2004). A framework for speeding up priorityqueue operations. Research at the University of Copenhagen (University of Copenhagen).3 indexed citations
Elbassioni, Khaled, Amr Elmasry, & Ibrahim Kamel. (2002). Efficient answering of polyhedral queries in r d using bbs-trees.. Canadian Conference on Computational Geometry. 54–57.1 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.