Wendy Myrvold | Academic Influence

Wendy Myrvold's AcademicInfluence.com Rankings

Wendy Myrvold

Computer Science

#1966

World Rank

#2042

Historical Rank

computer-science Degrees

Wendy Myrvold

Mathematics

#2365

World Rank

#3680

Historical Rank

Graph Theory

#39

World Rank

#46

Historical Rank

Measure Theory

#4014

World Rank

#4729

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Wendy Myrvold's Degrees

Bachelors Mathematics University of Victoria

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Wendy Myrvold Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Wendy Joanne Myrvold is a Canadian mathematician and computer scientist known for her work on graph algorithms, planarity testing, and algorithms in enumerative combinatorics. She is a professor emeritus of computer science at the University of Victoria.

(See a Problem?)

Wendy Myrvold's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On the Cutting Edge: Simplified O(n) Planarity by Edge Addition (2004) (212)
Small latin squares, quasigroups, and loops (2007) (163)
Ranking and unranking permutations in linear time (2001) (128)
Uniformly-most reliable networks do not always exist (1991) (77)
Stop minding your p's and q's: a simplified O(n) planar embedding algorithm (1999) (67)
Two Algorithms for Unranking Arborescences (1996) (57)
The "anthracene problem": closed-form conjugated-circuit models of ring currents in linear polyacenes. (2011) (43)
A selection rule for molecular conduction. (2009) (43)
Conduction in graphenes. (2009) (42)
Generic Reliability Trust Model (2005) (36)
Fast backtracking principles applied to find new cages (1998) (33)
Maximizing spanning trees in almost complete graphs (1997) (31)
Ally and adversary reconstruction problems (1988) (31)
Finding the most vital edges with respect to the number of spanning trees (1994) (30)
Practical toroidality testing (1997) (30)
Vertex spirals in fullerenes and their implications for nomenclature of fullerene derivatives. (2007) (29)
A complete resolution of the Keller maximum clique problem (2011) (28)
The ally-reconstruction number of a tree with five or more vertices is three (1990) (26)
A survey of some open questions in reconstruction numbers (2010) (22)
FuiGui :A Graphical User Interface for Investigating Conjectures About Fullerenes (2007) (21)
Errors in graph embedding algorithms (2011) (21)
The obstructions for toroidal graphs with no K3, 3's (2004) (20)
Unsupervised nonparametric classification of polarimetric SAR data using the K-nearest neighbor graph (2010) (19)
Counting k-component forests of a graph (1992) (19)
Reliable Network Synthesis: Some Recent Developments (1996) (18)
Simpler Projective Plane Embedding (2000) (17)
Forbidden minors and subdivisions for toroidal graphs with no K3, 3's (2005) (16)
Bidegreed graphs are edge reconstructible (1987) (16)
Independence number and fullerene stability (2007) (16)
Reliability polynomials can cross twice (1993) (14)
Computational determination of (3, 11) and (4, 7) cages (2010) (13)
Generating simple convex Venn diagrams (2012) (12)
The degree sequence is reconstructible from n-1 cards (1992) (12)
A Formula for the Number of Spanning Trees of a Multi-Star Related Graph (1998) (12)
Equiaromatic benzenoids: Arbitrarily large sets of isomers with equal ring currents (2014) (10)
A Large Set of Torus Obstructions and How They Were Discovered (2018) (10)
Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams (2011) (9)
Recognizing connectedness from vertex‐deleted subgraphs (2011) (8)
Distributed curvature and stability of fullerenes. (2015) (8)
Perimeter ring currents in benzenoids from Pauling bond orders. (2016) (7)
Backtracking to Compute the Closed-Shell Independence Number of a Fullerene (2007) (6)
Simplified O(n) Planarity Algorithms (2001) (6)
A Dynamic Programming Approach for Timing and Designing Clique Algorithms (2001) (6)
The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8 (2004) (6)
Properties, proved and conjectured, of Keller, Mycielski, and queen graphs (2016) (5)
Ovals and hyperovals in nets (2005) (4)
Ring-Current Maps for Benzenoids: Comparisons, Contradictions, and a Versatile Combinatorial Model (2020) (4)
Non-IPR fullerenes with properly closed shells. (2010) (4)
Maximum independent sets of the 120-cell and other regular polytopes (2012) (3)
Dynamic Redundancy Bit Allocation and Packet Size to Increase Throughput in Noisy Real Time Video Wireless Transmission (2011) (3)
Counterexamples to a proposed algorithm for Fries structures of benzenoids (2012) (3)
Partitioning Hückel–London Currents into Cycle Contributions (2021) (3)
The special cuts of 600-cell (2007) (2)
Most Fullerenes Have No Centrosymmetric Labelling (2014) (2)
Nets of Small Degree Without Ovals (2004) (2)
On the edge-reconstruction number of a tree (2013) (2)
2-limited broadcast domination in grid graphs (2021) (1)
Generation of Colourings and Distinguishing Colourings of Graphs (2015) (1)
A method for proving lower bounds for the 2-limited broadcast domination number on grid graphs (2021) (0)
Counting Spanning Out-trees in Multidigraphs (2000) (0)
Chapter 7 Classification of Chemical Compound Pharmacophore Structures (2000) (0)
Mycielski, and queen graphs (2017) (0)
A linear time algorithm for finding a maximum independent set of a fullerene (2017) (0)
Clar and Fries structures for fullerenes (2022) (0)
Proceeding of the Annual ACM-SIAM Symposium on Discrete Algorithms: Preface (2005) (0)

This paper list is powered by the following services:

Other Resources About Wendy Myrvold

en.wikipedia.org

What Schools Are Affiliated With Wendy Myrvold?

Wendy Myrvold is affiliated with the following schools: