This map shows the geographic impact of Anna Lubiw'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 Anna Lubiw with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anna Lubiw more than expected).
This network shows the impact of papers produced by Anna Lubiw. 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 Anna Lubiw. The network helps show where Anna Lubiw may publish in the future.
Co-authorship network of co-authors of Anna Lubiw
This figure shows the co-authorship network connecting the top 25 collaborators of Anna Lubiw.
A scholar is included among the top collaborators of Anna Lubiw 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 Anna Lubiw. Anna Lubiw 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.
Giacomo, Emilio Di & Anna Lubiw. (2015). Graph drawing and network visualization : 23rd international symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015 : revised selected papers. CERN Document Server (European Organization for Nuclear Research).1 indexed citations
2.
Demaine, Erik D., et al.. (2013). Refold rigidity of convex polyhedra. DSpace@MIT (Massachusetts Institute of Technology).1 indexed citations
Lubiw, Anna, et al.. (2007). Optimal schedules for 2-guard room search. Canadian Conference on Computational Geometry. 245–248.
5.
Braß, Peter, Ferrán Hurtado, Benjamin Lafreniere, & Anna Lubiw. (2007). A Lower Bound on the Area of a 3-Coloured Disc Packing.. Canadian Conference on Computational Geometry. 101–104.2 indexed citations
6.
Lubiw, Anna, et al.. (2006). Shortest Descending Paths through Given Faces.. Canadian Conference on Computational Geometry.1 indexed citations
Biedl, Thérèse, et al.. (2003). Parallel morphing of trees and cycles.. Canadian Conference on Computational Geometry. 29–34.2 indexed citations
10.
Battista, Giuseppe Di, Giuseppe Liotta, Anna Lubiw, & Sue Whitesides. (2000). Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). 272–283.1 indexed citations
11.
Demaine, Erik D., Martin L. Demaine, & Anna Lubiw. (1999). Folding and one straight cut suffice. Symposium on Discrete Algorithms. 891–892.11 indexed citations
Biedl, Thérèse, Erik D. Demaine, Martin L. Demaine, et al.. (1999). Locked and Unlocked Polygonal Chains in Three Dimensions. HAL (Le Centre pour la Communication Scientifique Directe). 866–867.1 indexed citations
14.
Biedl, Thérèse, Erik D. Demaine, Martin L. Demaine, et al.. (1998). Unfolding Some Classes of Orthogonal Polyhedra.28 indexed citations
15.
Biedl, Thérèse, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, & Godfried T. Toussaint. (1998). Hiding disks in folded polygons.. Canadian Conference on Computational Geometry.4 indexed citations
16.
Everett, Hazel, Anna Lubiw, & Joseph O’Rourke. (1993). Recovery of Convex Hulls From External Visibility Graphs.. Canadian Conference on Computational Geometry. 309–314.6 indexed citations
17.
Lubiw, Anna, et al.. (1993). Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs.. Canadian Conference on Computational Geometry. 198–203.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.