^ "Love of music guides fledgling ensemble", Kitchener Record, Novem.1, 2 (PDF), Amsterdam: Elsevier, pp. 1447–1540, 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?. ^ Lubiw (1981) Babai, László (1995), "Automorphism groups, isomorphism, reconstruction", Handbook of combinatorics, Vol. National Semiconductor June 2003 Revision 1.^ Bose, Buss & Lubiw (1998) Brignall, Robert (2010), "A survey of simple permutations", in Linton, Steve Ruškuc, Nik Vatter, Vincent (eds.), Permutation Patterns, London Mathematical Society Lecture Note Series, vol. 376, Cambridge University Press, pp. 41–66, ISBN 9781139488846, MR 2732823.(1998), "Optimal Upward Planarity Testing of Single-Source Digraphs", Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, pp. 195–200, ISBN 978-0-13-301615-4. ^ Hutton & Lubiw (1996) Di Battista, Giuseppe Eades, Peter Tamassia, Roberto Tollis, Ioannis G.^ "Maths star from outside the fold", Times Higher Education, Ma.^ Anna Lubiw at the Mathematics Genealogy Project.
^ Faculty profile Archived at the Wayback Machine, University of Waterloo, retrieved.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.
#Texworks undefined control sequence install#
First presented at the 2nd ACM-SIAM Symposium on Discrete Algorithms, 1991. A common mistake is to install an editor such as TeXworks or TeXShop but without installing a TeX system such as TeX Live or. She is married to Jeffrey Shallit, also a computer scientist. Personal life Īs well her academic work, Lubiw is an amateur violinist, and chairs the volunteer council in charge of the University of Waterloo orchestra. Lubiw was named an ACM Distinguished Member in 2009. Other contributions of Lubiw include proving the NP-completeness of finding permutation patterns, and of finding derangements in permutation groups. In graph drawing, Hutton and Lubiw found a polynomial time algorithm for upward planar drawing of graphs with a single source vertex. Research Īt Waterloo, Lubiw's students have included both Erik Demaine and his father Martin Demaine, with whom she published the first proof of the fold-and-cut theorem in mathematical origami. Lubiw received her Ph.D from the University of Toronto in 1986 under the joint supervision of Rudolf Mathon and Stephen Cook.