| Anna Lubiw
Professor Joined School 1987 BSc (Toronto),
|
Professor Lubiw's research is in the area of algorithms, specifically computational geometry and graph algorithms.
She has worked on shortest path problems, morphing of graph drawings, algorithms for polyhedra, folding and unfolding problems (including mathematics of origami), map labelling, and music information retrieval.
ACM Distinguished Scientist (2009)
Professor Lubiw worked on circuit extraction at Bell Northern Research before beginning graduate studies, and has had sabbaticals at U. Wisconsin, Madison, Rutgers, U. of Arizona, and MIT.
Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw, Testing Simultaneous Planarity when the Common Graph is 2-Connected, 21st International Symposium on Algorithms and Computation (ISAAC), 2010.
Peter Brass, Ferran Hurtado, Benjamin Lafreniere, Anna Lubiw, A Lower Bound on the Area of a 3-Coloured Disk Packing, International Journal on Computational Geometry, Volume 20, No. 3, 341–360, 2010.
Mustaq Ahmed and Anna Lubiw, Shortest Paths Avoiding Forbidden Subpaths, 26th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 63-74, 2009
Anna Lubiw, Mark Petrick, and Michael Spriggs. Morphing orthogonal planar graph drawings. Symposium on Discrete Algorithms (SODA), 2006.
M. Dror, A. Efrat, A. Lubiw, and J. Mitchell. Touring a sequence of polygons. ACM Symp. on Theory of Computing (STOC), pp. 473-482, 2003.

David R. Cheriton School of Computer Science
University of Waterloo
Waterloo, Ontario, Canada N2L 3G1
Tel: 519-888-4567 x33293
Fax: 519-885-1208
Contact | Feedback: cs-webmaster@cs.uwaterloo.ca | David R. Cheriton School of Computer Science | Faculty of Mathematics