Wendy J. Myrvold

	2005
17		Glenn Mahoney, Wendy J. Myrvold, Gholamali C. Shoja: Generic Reliability Trust Model. PST 2005
16		Jianping Roth, Wendy J. Myrvold: Simpler Projective Plane Embedding. Ars Comb. 75: (2005)
15		Charles J. Colbourn, David A. Drake, Wendy J. Myrvold: Ovals and hyperovals in nets. Discrete Mathematics 294(1-2): 53-74 (2005)
14		Andrei Gagarin, Wendy J. Myrvold, John Chambers: Forbidden minors and subdivisions for toroidal graphs with no K3, 3's. Electronic Notes in Discrete Mathematics 22: 151-156 (2005)
	2004
13		David A. Drake, Wendy J. Myrvold: Nets of Small Degree Without Ovals. Des. Codes Cryptography 32(1-3): 167-183 (2004)
12		David A. Drake, Wendy J. Myrvold: The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8. Des. Codes Cryptography 33(1): 63-69 (2004)
11		John M. Boyer, Wendy J. Myrvold: On the Cutting Edge: Simplified O(n) Planarity by Edge Addition. J. Graph Algorithms Appl. 8(2): 241-273 (2004)
	2001
10		Wendy J. Myrvold, Frank Ruskey: Ranking and unranking permutations in linear time. Inf. Process. Lett. 79(6): 281-284 (2001)
	2000
9		Wendy J. Myrvold, Jianping Roth: Simpler Projective Plane Embedding. Electronic Notes in Discrete Mathematics 5: 243-246 (2000)
	1999
8		John M. Boyer, Wendy J. Myrvold: Stop Minding Your p's and q's: A Simplified O(n) Planar Embedding Algorithm. SODA 1999: 140-146
	1998
7		Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon: Fast Backtracking Principles Applied to Find New Cages. SODA 1998: 188-191
6		Wen-Ming Yan, Wendy J. Myrvold, Kuo-Liang Chung: A Formula for the Number of Spanning Trees of a Multi-Star Related Graph. Inf. Process. Lett. 68(6): 295-298 (1998)
	1997
5		Eugene Neufeld, Wendy J. Myrvold: Practical Toroidality Testing. SODA 1997: 574-580
4		Bryan Gilbert, Wendy J. Myrvold: Maximizing spanning trees in almost complete graphs. Networks 30(1): 23-30 (1997)
3		Bryan Gilbert, Wendy J. Myrvold: Maximizing spanning trees in almost complete graphs. Networks 30(2): 97-104 (1997)
	1996
2		Charles J. Colbourn, Wendy J. Myrvold, Eugene Neufeld: Two Algorithms for Unranking Arborescences. J. Algorithms 20(2): 268-281 (1996)
	1992
1		Wendy J. Myrvold: The degree sequence is reconstructible from n-1 cards. Discrete Mathematics 102(2): 187-196 (1992)

Coauthor Index

1	John M. Boyer	[8] [11]
2	John Chambers	[14]
3	Kuo-Liang Chung	[6]
4	Charles J. Colbourn	[2] [15]
5	David A. Drake	[12] [13] [15]
6	Andrei Gagarin	[14]
7	Bryan Gilbert	[3] [4]
8	Glenn Mahoney	[17]
9	Brendan D. McKay	[7]
10	Jacqueline Nadon	[7]
11	Eugene Neufeld	[2] [5]
12	Jianping Roth	[9] [16]
13	Frank Ruskey	[10]
14	Gholamali C. Shoja	[17]
15	Wen-Ming Yan	[6]

Colors in the list of coauthors