Anna Lubiw

University of Waterloo — Canada

Computer Science · Physical Sciences

27h-index3.1kcitations232works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(157), Advanced Graph Theory Research(63), Advanced Materials and Mechanics(35), Digital Image Processing Techniques(26), Data Management and Algorithms(23)

Publications232 total

The Geodesic Edge Center of a Simple Polygon
Discrete & Computational Geometry·2025Open Access
When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
arXiv (Cornell University)·2025Open Access
Deltahedral Domes over Equiangular Polygons
arXiv (Cornell University)·2024Open Access
Super Guarding and Dark Rays in Art Galleries
arXiv (Cornell University)·2024Open Access
Morphing Planar Graph Drawings via Orthogonal Box Drawings
arXiv (Cornell University)·2024Open Access
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)
Algorithmica·2023Open Access
Token Swapping on Trees
Discrete Mathematics & Theoretical Computer Science·2023· 4 citedOpen Access
The Geodesic Edge Center of a Simple Polygon
arXiv (Cornell University)·2023Open Access
Preface
Computational Geometry·2022
The Complexity of Drawing a Graph in a Polygonal Region
Journal of Graph Algorithms and Applications·2022· 13 citedOpen Access
Reconfiguration of Non-crossing Spanning Trees
arXiv (Cornell University)·2022· 1 citedOpen Access
Forbidding Edges between Points in the Plane to Disconnect the Triangulation Flip Graph
arXiv (Cornell University)·2022Open Access
Correction to: Algorithms and Data Structures
Lecture notes in computer science·2022· 1 cited
Bounded-Angle Minimum Spanning Trees
Algorithmica·2021· 2 cited
Distant Representatives for Rectangles in the Plane
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 1 citedOpen Access
Hardness of Token Swapping on Trees
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 4 citedOpen Access
Algorithms and Data Structures
Lecture notes in computer science·2021· 72 cited
The Visibility Center of a Simple Polygon
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021Open Access
Dispersion for Intervals: A Geometric Approach
Society for Industrial and Applied Mathematics eBooks·2021· 3 citedOpen Access
Distant Representatives for Rectangles in the Plane
arXiv (Cornell University)·2021Open Access
page 1 of 12Next →

Frequent Co-authors

Erik D. Demaine(11), Martin L. Demaine(9), Thérèse Biedl(7), Joseph O’Rourke(7), Prosenjit Bose(6), Alon Efrat(6), Sue Whitesides(6), Stephen Kobourov(5), Joseph S. B. Mitchell(4), Timothy M. Chan(4), Krishnam Raju Jampani(4), Vinayak Pathak(3), Sylvain Lazard(3), Ileana Streinu(3), Godfried Toussaint(3), Soroush Alamdari(3), Jonathan F. Buss(2), Moshe Dror(2), Peter Braß(2), Eowyn Čenek(2)