This page contains a list of my publications, including access to some preprints. Drop me a line (wendym@cs.UVic.ca) if you are downloading any papers or if you'd like reprints of some of my older papers. I love to know that others are interested in my work.

Index

1. Technical Reports
2. Journal Papers
3. Conference Papers

To get out of here:

1. Home page for Dr. Wendy Myrvold
2. My Research: Graph Theory and Graph Algorithms
3. My favorite links
4. Department of Computer Science
5. University of Victoria

Return to index at the TOP of the page.

Technical Reports

1. W. Myrvold, T. Hoffman, and S. Trace. Reliability of Planar Multigraphs. U. Vic. Technical Report DCS-247-IR, 5 pages.
   ( planar.ps )

Return to index at the TOP of the page.

Refereed Journal Papers

1. R. J. Kingan, S. R. Kingan, and Wendy Myrvold. On matroid Generation. Accepted to Congressus Numerantium, Oct. 2003, 15 pages.
2. W. Myrvold and J. Roth. Simpler Projective Plane Embedding. Accepted to Ars Combinatoria, Jan. 2003, 21 pages. ( roth.ps ) ( roth.ps.gz )
3. D. Drake and W. Myrvold. The non-existence of maximal sets of four mutually orthogonal Latin squares of order 8, Accepted by Designs, Codes and Cryptography, Oct. 28, 2002, 8 pages.
4. W. Myrvold and F. Ruskey. Ranking and unranking permutations in linear time. Accepted by Information Processing Letters, Oct., 2000, 6 pages. ( RankPerm.ps ) ( RankPerm.ps.gz )
5. W. Myrvold. Negative Results for Orthogonal Triples of Latin Squares. Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 29, pp. 95-105, 1999. (Also available as U. Vic. Technical Report DCS-248-IR).
   
6. Wen-Ming Yan, Wendy Myrvold, and Kuo-Liang Chung. A formula for the number of spanning trees of a multi-star related graph, Information Processing Letters, Volume 68, pp. 295-298, 1998.
   
7. B. Gilbert, and W. Myrvold. Maximizing Spanning Trees in Almost Complete Graphs. Networks, Vol. 30, pp. 23-30, 1997.
   
8. C. J. Colbourn, W. J. Myrvold, and E. Neufeld. Two algorithms for Unranking Arborescences. Journal of Algorithms, Vol. 20, pp. 268-281, 1996.
9. Fu-Shang P. Tsen, Ting-Yi Sung, Men-Yang Lin, Lih-Hsing Hsu, and Wendy Myrvold. Finding the most vital edges with respect to the number of spanning trees. IEEE Transactions on Reliability, Vol. 43, No. 4, pp. 600-603, 1994.
10. C. J. Colbourn, D. D. Harms, and W.J. Myrvold. Brief Communication: Reliability Polynomials Can Cross Twice. The Franklin Institute, Vol. 330, No. 3, pp. 629-633, 1993.
11. W. J. Myrvold. Counting k-component forests of a graph. Networks, Vol. 22, pp. 647-652, 1992.

    Return to index at the TOP of the page.

12. W. J. Myrvold. The degree sequence is reconstructible from n-1 cards. Discrete Mathematics, Vol. 102, pp. 187-196, 1992.
13. W. J. Myrvold, Kim H. Cheung, Lavon B. Page, and Jo Ellen Perry. Uniformly-most reliable networks do not always exist. Networks, Vol. 21, pp. 417-419, 1991.
14. W. J. Myrvold. The ally-reconstruction number of a tree with five or more vertices is three. Journal of Graph Theory, 14, No. 2, pp. 149-166, 1990.
15. W. J. Myrvold. The ally-reconstruction number of a disconnected graph. Ars Combinatoria, 28, pp. 123-127, 1989.
16. G. L. Chia, C. J. Colbourn, and W. J. Myrvold. Graphs determined by their reliability polynomial. Ars Combinatoria, 26B, pp. 249-251, 1988.
17. W. J. Myrvold, M. N. Ellingham, and D. G. Hoffman. Bidegreed graphs are Edge Reconstructible. Journal of Graph Theory, Vol. 11, No. 3, pp. 281-302, 1987.
18. I. Krasikov, M. N. Ellingham, and W. J. Myrvold. Legitimate Number Decks for Trees. Ars Combinatoria, Vol. 21, pp. 15-17, 1986.

Return to index at the TOP of the page.

Conference Papers

1. W. Myrvold and J. Roth. Simpler Projective Plane Embedding. Preprint accepted by Elsevier Preprint, June, 2000. Sixth International Conference on Graph Theory, Marseille France, Aug. 28-Sept. 1, 2000, 4 pages. [See corresponding journal paper above if you want the details]
2. J. Boyer and W. Myrvold. Stop minding your P's and Q's: A simplified O(n) planar embedding algorithm. Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 140-146, 1999. ( boyer.ps ) ( boyer.ps.gz )
   A journal version entitled Stop minding your P's and Q's: Simplified Planarity by Edge Addition has been submitted to Journal of Graph Algorithms and Applications, Oct. 6, 2003, 25 pages. ( planarity.ps ) (planarity.ps.gz )
   
3. W. Myrvold. Reliable Network Synthesis: Some Recent Developments. Accepted to Proceedings of the Eighth International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, Volume II, pp. 650-660, 1998.
   ( synthesis.ps ) ( synthesis.ps.gz )
4. B. McKay, W. Myrvold, and J. Nadon. Fast backtracking principles applied to find new cages. Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 188-191, 1998.
   ( girth.ps ) ( girth.ps.gz )
5. W. Myrvold, T. Prsa, and N. Walker. A Dynamic programming approach for timing and designing clique algorithms. Algorithms and Experiments (ALEX '98): Building Bridges Between Theory and Applications, pp. 88-95, 1998.
   ( clique.ps ) ( clique.ps.gz )
   
6. E. Neufeld, and W. Myrvold. Practical Toroidality Testing. Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 574-580, 1997. (Also available as U. Vic. Technical Report DCS-244-IR).
   ( torus.ps ) ( torus.ps.gz )
7. W. J. Myrvold. A report on the ally reconstruction problem. Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Graph Theory, Combinatorics and Applications, Vol. 2, ed. by Y. Alavi, G. Chartrand, O. R. Oellermann, and A. J. Schwenk, pp. 949-956, 1988.
8. C. J. Colbourn, B. M. Debroni, and W. J. Myrvold. Estimating the coefficients of the reliability polynomial. Proceedings of the Seventeenth Manitoba Conference on Numerical Mathematics and Computing, Congressum Numerantium, Vol. 62, pp. 217-223, 1988.

Return to index at the TOP of the page.