default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWendy J. Myrvold
Person information
- affiliation: University of Victoria, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j28]Aaron Slobodin
, Gary MacGillivray, Wendy J. Myrvold:
2-limited broadcast domination on grid graphs. Discret. Appl. Math. 338: 158-178 (2023)- [c10]Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams:
Cordial Forests. FCT 2023: 291-303
2010 – 2019
- 2018
- [j27]Wendy J. Myrvold, Jennifer Woodcock:
A Large Set of Torus Obstructions and How They Were Discovered. Electron. J. Comb. 25(1): 1 (2018) - 2017
- [j26]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): 427-460 (2017) - 2015
- [c9]William Bird, Wendy J. Myrvold:
Generation of Colourings and Distinguishing Colourings of Graphs. WADS 2015: 79-90 - 2014
- [j25]Kevin J. Asciak, Josef Lauri, Wendy J. Myrvold, Virgilio Pannone:
On the edge-reconstruction number of a tree. Australas. J Comb. 60: 169-190 (2014) - 2013
- [j24]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): 197-210 (2013) - 2012
- [j23]Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey:
Generating simple convex Venn diagrams. J. Discrete Algorithms 16: 270-286 (2012) - 2011
- [j22]Wendy J. Myrvold, William L. Kocay:
Errors in graph embedding algorithms. J. Comput. Syst. Sci. 77(2): 430-438 (2011) - [j21]Geoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon:
Computational determination of (3, 11) and (4, 7) cages. J. Discrete Algorithms 9(2): 166-169 (2011) - [j20]Andrew Bowler, Paul Brown, Trevor I. Fenner, Wendy J. Myrvold:
Recognizing connectedness from vertex-deleted subgraphs. J. Graph Theory 67(4): 285-299 (2011) - [c8]Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey:
Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams. IWOCA 2011: 275-286 - [c7]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: 129-135 - 2010
- [j19]Kevin J. Asciak, M. A. Francalanza, Josef Lauri, Wendy J. Myrvold:
A survey of some open questions in reconstruction numbers. Ars Comb. 97 (2010) - [c6]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: 1867-1870
2000 – 2009
- 2009
- [j18]Andrei Gagarin, Wendy J. Myrvold, John Chambers:
The obstructions for toroidal graphs with no K3, 3's. Discret. Math. 309(11): 3625-3631 (2009) - 2005
- [j17]Jianping Roth, Wendy J. Myrvold:
Simpler Projective Plane Embedding. Ars Comb. 75 (2005) - [j16]Charles J. Colbourn, David A. Drake, Wendy J. Myrvold:
Ovals and hyperovals in nets. Discret. Math. 294(1-2): 53-74 (2005) - [j15]Andrei Gagarin, Wendy J. Myrvold, John Chambers:
Forbidden minors and subdivisions for toroidal graphs with no K3, 3's. Electron. Notes Discret. Math. 22: 151-156 (2005) - [c5]Glenn Mahoney, Wendy J. Myrvold, Gholamali C. Shoja:
Generic Reliability Trust Model. PST 2005 - 2004
- [j14]David A. Drake, Wendy J. Myrvold:
Nets of Small Degree Without Ovals. Des. Codes Cryptogr. 32(1-3): 167-183 (2004) - [j13]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): 63-69 (2004) - [j12]John M. Boyer, Wendy J. Myrvold:
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition. J. Graph Algorithms Appl. 8(3): 241-273 (2004) - 2001
- [j11]Wendy J. Myrvold, Frank Ruskey:
Ranking and unranking permutations in linear time. Inf. Process. Lett. 79(6): 281-284 (2001) - [c4]Wendy J. Myrvold, Tania Prsa, Neil Walker:
A Dynamic Programming Approach for Timing and Designing Clique Algorithms. Graphs and Discovery 2001: 333-340 - 2000
- [j10]Wendy J. Myrvold, Jianping Roth:
Simpler Projective Plane Embedding. Electron. Notes Discret. Math. 5: 243-246 (2000)
1990 – 1999
- 1999
- [c3]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
- [j9]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) - [c2]Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon:
Fast Backtracking Principles Applied to Find New Cages. SODA 1998: 188-191 - 1997
- [j8]Bryan Gilbert, Wendy J. Myrvold:
Maximizing spanning trees in almost complete graphs. Networks 30(1): 23-30 (1997) - [j7]Bryan Gilbert, Wendy J. Myrvold:
Maximizing spanning trees in almost complete graphs. Networks 30(2): 97-104 (1997) - [c1]Eugene Neufeld, Wendy J. Myrvold:
Practical Toroidality Testing. SODA 1997: 574-580 - 1996
- [j6]Charles J. Colbourn, Wendy J. Myrvold, Eugene Neufeld:
Two Algorithms for Unranking Arborescences. J. Algorithms 20(2): 268-281 (1996) - 1992
- [j5]Wendy J. Myrvold:
The degree sequence is reconstructible from n-1 cards. Discret. Math. 102(2): 187-196 (1992) - [j4]Wendy J. Myrvold:
Counting k-component forests of a graph. Networks 22(7): 647-652 (1992) - 1991
- [j3]Wendy J. Myrvold, Kim H. Cheung, Lavon B. Page, Jo Ellen Perry:
Uniformly-most reliable networks do not always exist. Networks 21(4): 417-419 (1991) - 1990
- [j2]Wendy J. Myrvold:
The ally-reconstruction number of a tree with five or more vertices is three. J. Graph Theory 14(2): 149-166 (1990)
1980 – 1989
- 1987
- [j1]Wendy J. Myrvold, Mark N. Ellingham, D. G. Hoffman:
Bidegreed graphs are edge reconstructible. J. Graph Theory 11(3): 281-302 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
