Wendy J. Myrvold - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2023

Cordial ForestsFeston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams. fct 2023: 291-303 [doi]

2-limited broadcast domination on grid graphsAaron Slobodin, Gary MacGillivray, Wendy J. Myrvold. DAM, 338:158-178, October 2023. [doi]

2012

Generating simple convex Venn diagramsKhalegh Mamakani, Wendy J. Myrvold, Frank Ruskey. jda, 16:270-286, 2012. [doi]

2011

Computational determination of (3, 11) and (4, 7) cagesGeoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon. jda, 9(2):166-169, 2011. [doi]

Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn DiagramsKhalegh Mamakani, Wendy J. Myrvold, Frank Ruskey. iwoca 2011: 275-286 [doi]

2009

The obstructions for toroidal graphs with no K::3, 3:: sAndrei Gagarin, Wendy J. Myrvold, John Chambers. DM, 309(11):3625-3631, 2009. [doi]

2005

2004

On the Cutting Edge: Simplified O(n) Planarity by Edge AdditionJohn M. Boyer, Wendy J. Myrvold. jgaa, 8(2):241-273, 2004. [doi]

The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8David A. Drake, Wendy J. Myrvold. dcc, 33(1):63-69, 2004. [doi]

Nets of Small Degree Without OvalsDavid A. Drake, Wendy J. Myrvold. dcc, 32(1-3):167-183, 2004. [doi]

2001

A Dynamic Programming Approach for Timing and Designing Clique AlgorithmsWendy J. Myrvold, Tania Prsa, Neil Walker. dimacs 2005: 333-340

Ranking and unranking permutations in linear timeWendy J. Myrvold, Frank Ruskey. ipl, 79(6):281-284, 2001. [doi]

2000

Simpler Projective Plane EmbeddingWendy J. Myrvold, Jianping Roth. endm, 5:243-246, 2000. [doi]

1999

Stop Minding Your p s and q s: A Simplified ::::O::::(::::n::::) Planar Embedding AlgorithmJohn M. Boyer, Wendy J. Myrvold. soda 1999: 140-146 [doi]

1998

Fast Backtracking Principles Applied to Find New CagesBrendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon. soda 1998: 188-191

A Formula for the Number of Spanning Trees of a Multi-Star Related GraphWen-Ming Yan, Wendy J. Myrvold, Kuo-Liang Chung. ipl, 68(6):295-298, 1998. [doi]

1997

Maximizing spanning trees in almost complete graphsBryan Gilbert, Wendy J. Myrvold. networks, 30(1):23-30, 1997. [doi]

Maximizing spanning trees in almost complete graphsBryan Gilbert, Wendy J. Myrvold. networks, 30(2):97-104, 1997. [doi]

Practical Toroidality TestingEugene Neufeld, Wendy J. Myrvold. soda 1997: 574-580

1996

Two Algorithms for Unranking ArborescencesCharles J. Colbourn, Wendy J. Myrvold, Eugene Neufeld. jal, 20(2):268-281, 1996.

1992

The degree sequence is reconstructible from n-1 cardsWendy J. Myrvold. DM, 102(2):187-196, 1992. [doi]

1987

Bidegreed graphs are edge reconstructibleWendy J. Myrvold, Mark N. Ellingham, D. G. Hoffman. jgt, 11(3):281-302, 1987. [doi]

Sign in or sign up to see more results.

runs on WebDSL