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 scientist known 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. [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. [7]
Lubiw was named an ACM Distinguished Member in 2009. [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. [10] She is married to Jeffrey Shallit, also a computer scientist.
A surprising result of Anna Lubiw asserts that the following problem is NP-complete: Does a given permutation group have a fixed-point-free element?.
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 scientist known 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. [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. [7]
Lubiw was named an ACM Distinguished Member in 2009. [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. [10] She is married to Jeffrey Shallit, also a computer scientist.
A surprising result of Anna Lubiw asserts that the following problem is NP-complete: Does a given permutation group have a fixed-point-free element?.