Anna Lubiw

3.1k citations
97 papers · 1.1k indexed · h-index 18

Anna Lubiw

92 papers receiving 967 citations

Peers

Anna Lubiw
Comparison fields: 5 of 76
  • Computer Graphics and Computer-Aided Design 533
  • Discrete Mathematics and Combinatorics 98
  • Computational Theory and Mathematics 447
  • Computer Vision and Pattern Recognition 288
  • Signal Processing 142
Replace Ferrán Hurtado with:
Ferrán Hurtado Spain
Adrian Dumitrescu United States
Thérèse Biedl Canada
Iyad Kanj United States
Yoji Kajitani Japan
Michiel Smid Canada
Matthew J. Katz Israel
Christopher J. Van Wyk United States
David Rappaport Canada
Diane L. Souvaine United States
Anna Lubiw relative to Ferrán Hurtado Spain Ferrán Hurtado's profile →
Citations per field
00.5×1.5×
Ferrán Hurtado · 1×
Citations per year

Countries citing papers authored by Anna Lubiw

Since Specialization
Citations

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).

Fields of papers citing papers by Anna Lubiw

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

The 25 scholars most cited alongside Anna Lubiw, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Anna Lubiw Line = papers co-authored together Anna Lubiw links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1
Graph drawing and network visualization : 23rd international symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015 : revised selected papers
20151
2
Refold rigidity of convex polyhedra
20131
3
Convexifying Polygons Without Losing Visibilities
20111
4
Zipper Unfoldings of Polyhedral Complexes
20106
5 20081
6
Optimal schedules for 2-guard room search
20070
7
A Lower Bound on the Area of a 3-Coloured Disc Packing.
20072
8
Shortest Descending Paths through Given Faces.
20061
9 200623
10
Parallel morphing of trees and cycles.
20032
11
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract)
20001
12
Folding and one straight cut suffice
199911
13
Hiding disks in folded polygons.
19984
14 199827
15
Unfolding Some Classes of Orthogonal Polyhedra
199828
16
Recovery of Convex Hulls From External Visibility Graphs.
19936
17
Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs.
19937
18 199119
19
A weighted min-max relation for intervals
19901
20 19813

About Anna Lubiw

Anna Lubiw is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Architecture, having authored 97 papers that have together received 1.1k indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (66 papers), Advanced Graph Theory Research (24 papers), Advanced Materials and Mechanics (20 papers), Computer Graphics and Visualization Techniques (10 papers), Data Management and Algorithms (10 papers), graph theory and CDMA systems (10 papers), Digital Image Processing Techniques (9 papers) and Robotic Path Planning Algorithms (9 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (533 citations), Discrete Mathematics and Combinatorics (98 citations) and Computational Theory and Mathematics (447 citations). Anna Lubiw has collaborated with scholars based in Canada, United States and Japan. Frequent co-authors include Prosenjit Bose, Erik D. Demaine, Alon Efrat, Thérèse Biedl, Martin L. Demaine, Jonathan F. Buss, Joseph S. B. Mitchell, Joseph O’Rourke, Moshe Dror and Sue Whitesides. Their work appears in journals such as Computational Geometry, Journal of Graph Algorithms and Applications, SIAM Journal on Computing, Discrete & Computational Geometry and SIAM Journal on Discrete Mathematics.

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