Bidegreed graphs are edge reconstructible. - Wendy J. Myrvold; Mark N. Ellingham; D. G. Hoffman (J. Graph Theory, 1987)

The ally-reconstruction number of a tree with five or more vertices is three. - Wendy J. Myrvold (J. Graph Theory, 1990)

Uniformly-most reliable networks do not always exist. - Wendy J. Myrvold; Kim H. Cheung; Lavon B. Page; Jo Ellen Perry (Networks, 1991)

The degree sequence is reconstructible from n-1 cards. - Wendy J. Myrvold (Discret. Math., 1992)

Counting k-component forests of a graph. - Wendy J. Myrvold (Networks, 1992)

Two Algorithms for Unranking Arborescences. - Charles J. Colbourn; Wendy J. Myrvold; Eugene Neufeld (J. Algorithms, 1996)

Practical Toroidality Testing. - Eugene Neufeld; Wendy J. Myrvold (SODA, 1997)

Maximizing spanning trees in almost complete graphs. - Bryan Gilbert; Wendy J. Myrvold (Networks, 1997)

Fast Backtracking Principles Applied to Find New Cages. - Brendan D. McKay; Wendy J. Myrvold; Jacqueline Nadon (SODA, 1998)

A Formula for the Number of Spanning Trees of a Multi-Star Related Graph. - Wen-Ming Yan; Wendy J. Myrvold; Kuo-Liang Chung (Inf. Process. Lett., 1998)

Stop Minding Your p's and q's: A Simplified O(n) Planar Embedding Algorithm. - John M. Boyer; Wendy J. Myrvold (SODA, 1999)

A Dynamic Programming Approach for Timing and Designing Clique Algorithms. - Wendy J. Myrvold; Tania Prsa; Neil Walker (Graphs and Discovery, 2001)

Ranking and unranking permutations in linear time. - Wendy J. Myrvold; Frank Ruskey (Inf. Process. Lett., 2001)

Nets of Small Degree Without Ovals. - David A. Drake; Wendy J. Myrvold (Des. Codes Cryptogr., 2004)

The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8. - David A. Drake; Wendy J. Myrvold (Des. Codes Cryptogr., 2004)

On the Cutting Edge: Simplified O(n) Planarity by Edge Addition. - John M. Boyer; Wendy J. Myrvold (J. Graph Algorithms Appl., 2004)

Generic Reliability Trust Model. - Glenn Mahoney; Wendy J. Myrvold; Gholamali C. Shoja (PST, 2005)

Simpler Projective Plane Embedding. - Jianping Roth; Wendy J. Myrvold (Ars Comb., 2005)

Ovals and hyperovals in nets. - Charles J. Colbourn; David A. Drake; Wendy J. Myrvold (Discret. Math., 2005)

Forbidden minors and subdivisions for toroidal graphs with no K3, 3's. - Andrei Gagarin; Wendy J. Myrvold; John Chambers (Electron. Notes Discret. Math., 2005)

The obstructions for toroidal graphs with no K3, 3's. - Andrei Gagarin; Wendy J. Myrvold; John Chambers (Discret. Math., 2009)

Unsupervised nonparametric classification of polarimetric SAR data using the K-nearest neighbor graph. - Ashlin Richardson; David G. Goodenough; Hao Chen 004; Belaid Moa; Geordie Hobart; Wendy J. Myrvold (IGARSS, 2010)

A survey of some open questions in reconstruction numbers. - Kevin J. Asciak; M. A. Francalanza; Josef Lauri; Wendy J. Myrvold (Ars Comb., 2010)

Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams. - Khalegh Mamakani; Wendy J. Myrvold; Frank Ruskey (IWOCA, 2011)

A complete resolution of the Keller maximum clique problem. - Jennifer Debroni; John D. Eblen; Michael A. Langston; Wendy J. Myrvold; Peter W. Shor; Dinesh Weerapurage (SODA, 2011)

Errors in graph embedding algorithms. - Wendy J. Myrvold; William L. Kocay (J. Comput. Syst. Sci., 2011)

Computational determination of (3, 11) and (4, 7) cages. - Geoffrey Exoo; Brendan D. McKay; Wendy J. Myrvold; Jacqueline Nadon (J. Discrete Algorithms, 2011)

Recognizing connectedness from vertex-deleted subgraphs. - Andrew Bowler; Paul Brown; Trevor I. Fenner; Wendy J. Myrvold (J. Graph Theory, 2011)

Generating simple convex Venn diagrams. - Khalegh Mamakani; Wendy J. Myrvold; Frank Ruskey (J. Discrete Algorithms, 2012)

Maximum independent sets of the 120-cell and other regular polytopes. - Sean Debroni; Erin Delisle; Wendy J. Myrvold; Amit Sethi; Joseph Whitney; Jennifer Woodcock; Patrick W. Fowler; Benoit de La Vaissière; Michel Deza (Ars Math. Contemp., 2013)

On the edge-reconstruction number of a tree. - Kevin J. Asciak; Josef Lauri; Wendy J. Myrvold; Virgilio Pannone (Australas. J Comb., 2014)

Generation of Colourings and Distinguishing Colourings of Graphs. - William Bird; Wendy J. Myrvold (WADS, 2015)

Properties, proved and conjectured, of Keller, Mycielski, and queen graphs. - Witold Jarnicki; Wendy J. Myrvold; Peter W. Saltzman; Stan Wagon (Ars Math. Contemp., 2017)

A Large Set of Torus Obstructions and How They Were Discovered. - Wendy J. Myrvold; Jennifer Woodcock (Electron. J. Comb., 2018)

Cordial Forests. - Feston Kastrati; Wendy J. Myrvold; Lucas D. Panjer; Aaron Williams 001 (FCT, 2023)

Proving exact values for the 2-limited broadcast domination number on grid graphs. - Aaron Slobodin; Gary MacGillivray; Wendy J. Myrvold (Discret. Math. Theor. Comput. Sci., 2023)

2-limited broadcast domination on grid graphs. - Aaron Slobodin; Gary MacGillivray; Wendy J. Myrvold (Discret. Appl. Math., 2023)