معرفی
Anna Lubiw is a Professor at the David R. Cheriton School of Computer Science, University of Waterloo. Her research focuses on algorithms, computational geometry, graph algorithms, and graph drawing, with notable contributions to reconfiguration problems, geometric optimization, and visibility algorithms. She has authored over 200 peer-reviewed articles, including influential work on polygon decomposition, shortest paths, and morphing graph drawings.
Her work bridges theoretical computer science and discrete mathematics, emphasizing geometric algorithms and their applications. Recent studies explore topics like quasigeodesics on polyhedra, terrain reconstruction from imprecise data, and non-crossing spanning tree reconfiguration. Lubiw collaborates widely, with co-authors including Erik Demaine and Therese Biedl.
Awards and recognition include sustained contributions to ACM Symposium on Computational Geometry and editorial roles in top journals. She advises graduate students in geometric algorithms and reconfiguration complexity.
