Anna Lubiw

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

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]

Education

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

Research

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]

Awards

Lubiw was named an ACM Distinguished Member in 2009.[8]

Personal life

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, another computer scientist.

Selected publications

  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found.. First presented at the 2nd ACM-SIAM Symposium on Discrete Algorithms, 1991.
  • Lua error in package.lua at line 80: module 'strict' not found.. First presented at WADS 1993.
  • Lua error in package.lua at line 80: module 'strict' not found..

References

<templatestyles src="Reflist/styles.css" />

Cite error: Invalid <references> tag; parameter "group" is allowed only.

Use <references />, or <references group="..." />

External links