Wendy J. Myrvold

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 4

Top Topics

Top Venues

Ars Math. Contemp.

Electron. J. Comb.

Discret. Appl. Math.

Publications

Aaron Slobodin, Gary MacGillivray, Wendy J. Myrvold
2-limited broadcast domination on grid graphs. Discret. Appl. Math. 338 (2023)
Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams
Cordial Forests. FCT (2023)
Wendy J. Myrvold, Jennifer Woodcock
A Large Set of Torus Obstructions and How They Were Discovered. Electron. J. Comb. 25 (1) (2018)
Witold Jarnicki, Wendy J. Myrvold, Peter W. Saltzman, Stan Wagon
Properties, proved and conjectured, of Keller, Mycielski, and queen graphs. Ars Math. Contemp. 13 (2) (2017)
William Bird, Wendy J. Myrvold
Generation of Colourings and Distinguishing Colourings of Graphs. WADS (2015)
Kevin J. Asciak, Josef Lauri, Wendy J. Myrvold, Virgilio Pannone
On the edge-reconstruction number of a tree. Australas. J Comb. 60 (2014)
Sean Debroni, Erin Delisle, Wendy J. Myrvold, Amit Sethi, Joseph Whitney, Jennifer Woodcock, Patrick W. Fowler, Benoit de La Vaissière, Michel Deza
Maximum independent sets of the 120-cell and other regular polytopes. Ars Math. Contemp. 6 (2) (2013)
Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey
Generating simple convex Venn diagrams. J. Discrete Algorithms 16 (2012)
Geoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon
Computational determination of (3, 11) and (4, 7) cages. J. Discrete Algorithms 9 (2) (2011)
Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey
Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams. IWOCA (2011)
Andrew Bowler, Paul Brown, Trevor I. Fenner, Wendy J. Myrvold
Recognizing connectedness from vertex-deleted subgraphs. J. Graph Theory 67 (4) (2011)
Jennifer Debroni, John D. Eblen, Michael A. Langston, Wendy J. Myrvold, Peter W. Shor, Dinesh Weerapurage
A complete resolution of the Keller maximum clique problem. SODA (2011)
Wendy J. Myrvold, William L. Kocay
Errors in graph embedding algorithms. J. Comput. Syst. Sci. 77 (2) (2011)
Ashlin Richardson, David G. Goodenough, Hao Chen, Belaid Moa, Geordie Hobart, Wendy J. Myrvold
Unsupervised nonparametric classification of polarimetric SAR data using the K-nearest neighbor graph. IGARSS (2010)
Kevin J. Asciak, M. A. Francalanza, Josef Lauri, Wendy J. Myrvold
A survey of some open questions in reconstruction numbers. Ars Comb. 97 (2010)
Andrei Gagarin, Wendy J. Myrvold, John Chambers
's. Discret. Math. 309 (11) (2009)
Charles J. Colbourn, David A. Drake, Wendy J. Myrvold
Ovals and hyperovals in nets. Discret. Math. 294 (1-2) (2005)
Jianping Roth, Wendy J. Myrvold
Simpler Projective Plane Embedding. Ars Comb. 75 (2005)
Glenn Mahoney, Wendy J. Myrvold, Gholamali C. Shoja
Generic Reliability Trust Model. PST (2005)
Andrei Gagarin, Wendy J. Myrvold, John Chambers
's. Electron. Notes Discret. Math. 22 (2005)
David A. Drake, Wendy J. Myrvold
Nets of Small Degree Without Ovals. Des. Codes Cryptogr. 32 (1-3) (2004)
David A. Drake, Wendy J. Myrvold
The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8. Des. Codes Cryptogr. 33 (1) (2004)
John M. Boyer, Wendy J. Myrvold
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition. J. Graph Algorithms Appl. 8 (3) (2004)
Wendy J. Myrvold, Tania Prsa, Neil Walker
A Dynamic Programming Approach for Timing and Designing Clique Algorithms. Graphs and Discovery (2001)
Wendy J. Myrvold, Frank Ruskey
Ranking and unranking permutations in linear time. Inf. Process. Lett. 79 (6) (2001)
Wendy J. Myrvold, Jianping Roth
Simpler Projective Plane Embedding. Electron. Notes Discret. Math. 5 (2000)
John M. Boyer, Wendy J. Myrvold
) Planar Embedding Algorithm. SODA (1999)
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) (1998)
Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon
Fast Backtracking Principles Applied to Find New Cages. SODA (1998)
Bryan Gilbert, Wendy J. Myrvold
Maximizing spanning trees in almost complete graphs. Networks 30 (2) (1997)
Eugene Neufeld, Wendy J. Myrvold
Practical Toroidality Testing. SODA (1997)
Bryan Gilbert, Wendy J. Myrvold
Maximizing spanning trees in almost complete graphs. Networks 30 (1) (1997)
Charles J. Colbourn, Wendy J. Myrvold, Eugene Neufeld
Two Algorithms for Unranking Arborescences. J. Algorithms 20 (2) (1996)
Wendy J. Myrvold
The degree sequence is reconstructible from n-1 cards. Discret. Math. 102 (2) (1992)
Wendy J. Myrvold
-component forests of a graph. Networks 22 (7) (1992)
Wendy J. Myrvold, Kim H. Cheung, Lavon B. Page, Jo Ellen Perry
Uniformly-most reliable networks do not always exist. Networks 21 (4) (1991)
Wendy J. Myrvold
The ally-reconstruction number of a tree with five or more vertices is three. J. Graph Theory 14 (2) (1990)
Wendy J. Myrvold, Mark N. Ellingham, D. G. Hoffman
Bidegreed graphs are edge reconstructible. J. Graph Theory 11 (3) (1987)