Anna Lubiw

Papers

Total Citations

H-Index

About

Anna Lubiw is a leading figure in computational geometry and graph theory, renowned for her deep contributions to the study of geometric algorithms, graph drawing, and combinatorial reconfiguration. Her work often bridges the gap between theoretical computer science and practical applications, particularly in understanding the structure and complexity of geometric and discrete problems. Among her notable contributions, Lubiw has explored the hardness of fundamental problems like token swapping on trees, where she and her co-authors established the computational difficulty of minimizing swap sequences to permute tokens on a graph—a problem with implications for routing and logistics. She has also advanced the study of shortest paths and convex hulls in 2D complexes with non-positive curvature, providing algorithmic insights into spaces with hyperbolic-like geometry. While her most-cited papers currently show modest citation counts, reflecting their recent publication, Lubiw’s broader body of work—including seminal results on graph planarity and the "Lubiw’s theorem" on simultaneous embeddings—has earned her widespread recognition. A professor at the University of Waterloo, she continues to shape the field with her rigorous, elegant approach to algorithmic geometry.