Wendy J. Myrvold

Orcid: 0000-0002-0401-013X

Affiliations:
  • University of Victoria, Canada


According to our database1, Wendy J. Myrvold authored at least 36 papers between 1987 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
2-limited broadcast domination on grid graphs.
Discret. Appl. Math., October, 2023

Cordial Forests.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2018
A Large Set of Torus Obstructions and How They Were Discovered.
Electron. J. Comb., 2018

2017
Properties, proved and conjectured, of Keller, Mycielski, and queen graphs.
Ars Math. Contemp., 2017

2015
Generation of Colourings and Distinguishing Colourings of Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014
On the edge-reconstruction number of a tree.
Australas. J Comb., 2014

2013
Maximum independent sets of the 120-cell and other regular polytopes.
Ars Math. Contemp., 2013

2012
Generating simple convex Venn diagrams.
J. Discrete Algorithms, 2012

2011
Recognizing connectedness from vertex-deleted subgraphs.
J. Graph Theory, 2011

Computational determination of (3, 11) and (4, 7) cages.
J. Discrete Algorithms, 2011

Errors in graph embedding algorithms.
J. Comput. Syst. Sci., 2011

A complete resolution of the Keller maximum clique problem.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010
A survey of some open questions in reconstruction numbers.
Ars Comb., 2010

Unsupervised nonparametric classification of polarimetric SAR data using the K-nearest neighbor graph.
Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, 2010

2009
The obstructions for toroidal graphs with no K<sub>3, 3</sub>'s.
Discret. Math., 2009

2005
Forbidden minors and subdivisions for toroidal graphs with no K<sub>3, 3</sub>'s.
Electron. Notes Discret. Math., 2005

Ovals and hyperovals in nets.
Discret. Math., 2005

Generic Reliability Trust Model.
Proceedings of the Third Annual Conference on Privacy, 2005

2004
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition.
J. Graph Algorithms Appl., 2004

The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8.
Des. Codes Cryptogr., 2004

Nets of Small Degree Without Ovals.
Des. Codes Cryptogr., 2004

2001
Ranking and unranking permutations in linear time.
Inf. Process. Lett., 2001

A Dynamic Programming Approach for Timing and Designing Clique Algorithms.
Proceedings of the Graphs and Discovery, 2001

2000
Simpler Projective Plane Embedding.
Electron. Notes Discret. Math., 2000

1999
Stop Minding Your p's and q's: A Simplified <i>O</i>(<i>n</i>) Planar Embedding Algorithm.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
A Formula for the Number of Spanning Trees of a Multi-Star Related Graph.
Inf. Process. Lett., 1998

Fast Backtracking Principles Applied to Find New Cages.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997
Maximizing spanning trees in almost complete graphs.
Networks, 1997

Practical Toroidality Testing.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
Two Algorithms for Unranking Arborescences.
J. Algorithms, 1996

1992
Counting <i>k</i>-component forests of a graph.
Networks, 1992

The degree sequence is reconstructible from n-1 cards.
Discret. Math., 1992

1991
Uniformly-most reliable networks do not always exist.
Networks, 1991

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

1987
Bidegreed graphs are edge reconstructible.
J. Graph Theory, 1987


  Loading...