Wendy J. Myrvold

40 papers A* 4B 2C 3Journal 30Unranked 1

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