Anna Lubiw

Edit links
Source: Wikipedia, the free encyclopedia.
Anna Lubiw
NationalityCanadian
Alma materUniversity of Toronto
Known forComputational geometry, graph theory
SpouseJeffrey Shallit
AwardsACM Distinguished Member, 2009
Websitehttps://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]

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

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

Selected publications

  • Lubiw, Anna (1981), "Some NP-complete problems similar to graph isomorphism",
    MR 0605600
    .
  • Hutton, Michael D.; Lubiw, Anna (1996), "Upward planar drawing of single-source acyclic digraphs",
    S2CID 207078756
    . First presented at the 2nd ACM-SIAM Symposium on Discrete Algorithms, 1991.
  • MR 1620935
    . First presented at WADS 1993.
  • Demaine, Erik D.; Demaine, Martin L.; Lubiw, Anna (1999), "Folding and one straight cut suffice", Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '99), pp. 891–892.

References

  1. ^ Faculty profile Archived 2013-07-22 at the Wayback Machine, University of Waterloo, retrieved 2013-10-16.
  2. ^ Anna Lubiw at the Mathematics Genealogy Project
  3. ^ "Maths star from outside the fold", Times Higher Education, March 29, 2002.
  4. ISBN 9781139498548
    .
  5. ISBN 978-0-13-301615-4
    .
  6. MR 2732823
    . See in particular pp. 61–62.
  7. MR 1373683
    , 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?.
  8. ^ ACM Distinguished member page: http://awards.acm.org/award_winners/lubiw_2950848.cfm
  9. ^ "Love of music guides fledgling ensemble", Kitchener Record, November 29, 2005.
  10. ^ About the orchestra Archived 2013-06-05 at the Wayback Machine, Univ. of Waterloo, retrieved 2013-10-16.

External links

Retrieved from "https://en.wikipedia.org/w/index.php?title=Anna_Lubiw&oldid=1160980312"