- Anna
Lubiw is a
computer scientist known for her work in com****tional
geometry and
graph theory. She is
currently a
professor at the
University of Waterloo...
- was
completed at the
University of
Waterloo under the
supervision of Anna
Lubiw and Ian Munro. This work was
awarded the
Canadian Governor General's Gold...
- problem, was
published in 1999 by Erik Demaine,
Martin Demaine, and Anna
Lubiw and was
solved using straight skeleton method.
There are two
general methods...
- 10
August 2010. Demaine, Erik D.; Demaine,
Martin L.; Eisenstat, Sarah;
Lubiw, Anna; Winslow,
Andrew (2011). "Algorithms for
Solving Rubik's Cubes". arXiv:1106...
- doi:10.1017/S0305004100052154. S2CID 122311800.
Retrieved 27
December 2011.
Lubiw, Anna (1981). "Some NP-complete
problems similar to
graph isomorphism"....
-
theorist and a
noted critic of
intelligent design. He is
married to Anna
Lubiw, also a
computer scientist.
Shallit was born in Philadelphia, Pennsylvania...
- "Graph
isomorphisms in quasi-polynomial time". arXiv:1710.04574 [math.GR].
Lubiw, Anna (1981), "Some NP-complete
problems similar to
graph isomorphism",...
-
proofs of this result, none of them simple: by Kahn, Klawe, and Kleitman; by
Lubiw; and by Sack and Toussaint. A
related problem asks for the
number of guards...
- Com****tion Time of
Functions (1966)
Doctoral advisor Hao Wang
Doctoral students Mark
Braverman Toniann Pit****i
Walter Savitch Arvind Gupta Anna
Lubiw...
- the
longest common subpattern of two
separable permutations. Bose, Buss &
Lubiw (1998)
define a
separable permutation to be a
permutation that has a separating...
