| Simplified o (n) planarity by edge addition JM Boyer, WJ Myrvold Graph Algorithms Appl 5, 241, 2006 | 315 | 2006 |
| Small Latin squares, quasigroups, and loops BD McKay, A Meynert, W Myrvold Journal of Combinatorial Designs 15 (2), 98-119, 2007 | 232 | 2007 |
| Ranking and unranking permutations in linear time W Myrvold, F Ruskey Information Processing Letters 79 (6), 281-284, 2001 | 158 | 2001 |
| Uniformly‐most reliable networks do not always exist W Myrvold, KH Cheung, LB Page, JE Perry Networks 21 (4), 417-419, 1991 | 107 | 1991 |
| Stop Minding Your p's and q's: A Simplified O (n) Planar Embedding Algorithm. JM Boyer, WJ Myrvold SODA, 140-146, 1999 | 89 | 1999 |
| Two algorithms for unranking arborescences CJ Colbourn, WJ Myrvold, E Neufeld Journal of Algorithms 20 (2), 268-281, 1996 | 72 | 1996 |
| Finding the most vital edges with respect to the number of spanning trees FSP Tsen, TY Sung, MY Lin, LH Hsu, W Myrvold IEEE Transactions on Reliability 43 (4), 600-603, 1994 | 55 | 1994 |
| The “anthracene problem”: closed-form conjugated-circuit models of ring currents in linear polyacenes PW Fowler, W Myrvold The Journal of Physical Chemistry A 115 (45), 13191-13200, 2011 | 53 | 2011 |
| The ally-reconstruction number of a disconnected graph W Myrvold Ars Combinatoria 28, 123-127, 1989 | 51 | 1989 |
| A selection rule for molecular conduction PW Fowler, BT Pickup, TZ Todorova, W Myrvold The Journal of chemical physics 131 (4), 2009 | 50 | 2009 |
| Conduction in graphenes PW Fowler, BT Pickup, TZ Todorova, W Myrvold The Journal of chemical physics 131 (24), 2009 | 46 | 2009 |
| FuiGui: A graphical user interface for investigating conjectures about fullerenes W Myrvold, B Bultena, S Daugherty, B Debroni, S Girn, M Minchenko, ... MATCH Commun. Math. Comput. Chem 58 (2), 403-422, 2007 | 46 | 2007 |
| Maximizing spanning trees in almost complete graphs B Gilbert, W Myrvold Networks: An International Journal 30 (1), 23-30, 1997 | 46 | 1997 |
| Generic Reliability Trust Model. G Mahoney, WJ Myrvold, GC Shoja PST 5, 113-120, 2005 | 44 | 2005 |
| Practical toroidality testing E Neufeld, W Myrvold SODA 97, 574-580, 1997 | 43 | 1997 |
| Ally and adversary reconstruction problems WJ Myrvold University of Waterloo, 1988 | 43 | 1988 |
| Fast backtracking principles applied to find new cages BD McKay, W Myrvold, J Nadon SODA, 188-191, 1998 | 42 | 1998 |
| The ally‐reconstruction number of a tree with five or more vertices is three W Myrvold Journal of Graph Theory 14 (2), 149-166, 1990 | 42 | 1990 |
| A survey of some open questions in reconstruction numbers KJ Asciak, MA Francalanza, J Lauri, W Myrvold Ars Combin 97, 443-456, 2010 | 38 | 2010 |
| Vertex spirals in fullerenes and their implications for nomenclature of fullerene derivatives PW Fowler, D Horspool, W Myrvold Chemistry–A European Journal 13 (8), 2208-2217, 2007 | 37 | 2007 |
Frank RuskeyComputer Science, University of VictoriaVerified email at cs.uvic.ca
