Anna Lubiw

[1] Lubiw received her Ph.D from the University of Toronto in 1986 under the joint supervision of Rudolf Mathon and Stephen Cook.

[2] At Waterloo, Lubiw's students have included both Erik Demaine and his father Martin Demaine,[3] with whom she published the first proof of the fold-and-cut theorem in mathematical origami.

[4] In graph drawing, Hutton and Lubiw found a polynomial time algorithm for upward planar drawing of graphs with a single source vertex.

[5] Other contributions of Lubiw include proving the NP-completeness of finding permutation patterns,[6] and of finding derangements in permutation groups.

[8] As well her academic work, Lubiw is an amateur violinist,[9] and chairs the volunteer council in charge of the University of Waterloo orchestra.