| Anna Lubiw | |
| Nationality: | Canadian |
| Alma Mater: | University of Toronto |
| Known For: | Computational geometry, graph theory |
| Spouse: | Jeffrey Shallit |
| Awards: | ACM Distinguished Member, 2009 |
| Website: | https://cs.uwaterloo.ca/~alubiw/Site/Anna_Lubiw.html |
Anna Lubiw is a computer scientistknown for her work in computational geometry and graph theory. She is currently a professor at the University of Waterloo.[1]
Lubiw received her Ph.D from the University of Toronto in 1986 under the joint supervision of Rudolf Mathon and Stephen Cook.
At Waterloo, Lubiw's students have included both Erik Demaine and his father Martin Demaine,[2] with whom she published the first proof of the fold-and-cut theorem in mathematical origami.[3] In graph drawing, Hutton and Lubiw found a polynomial time algorithm for upward planar drawing of graphs with a single source vertex.[4] Other contributions of Lubiw include proving the NP-completeness of finding permutation patterns,[5] and of finding derangements in permutation groups.[6]
Lubiw was named an ACM Distinguished Member in 2009.[7]
As well her academic work, Lubiw is an amateur violinist,[8] and chairs the volunteer council in charge of the University of Waterloo orchestra.[9] She is married to Jeffrey Shallit, also a computer scientist.