The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wendy J. Myrvold: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Glenn Mahoney, Wendy J. Myrvold, Gholamali C. Shoja
    Generic Reliability Trust Model. [Citation Graph (0, 0)][DBLP]
    PST, 2005, pp:- [Conf]
  2. John M. Boyer, Wendy J. Myrvold
    Stop Minding Your p's and q's: A Simplified O(n) Planar Embedding Algorithm. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:140-146 [Conf]
  3. Eugene Neufeld, Wendy J. Myrvold
    Practical Toroidality Testing. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:574-580 [Conf]
  4. Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon
    Fast Backtracking Principles Applied to Find New Cages. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:188-191 [Conf]
  5. Jianping Roth, Wendy J. Myrvold
    Simpler Projective Plane Embedding. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:75, n:, pp:- [Journal]
  6. David A. Drake, Wendy J. Myrvold
    Nets of Small Degree Without Ovals. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:32, n:1-3, pp:167-183 [Journal]
  7. David A. Drake, Wendy J. Myrvold
    The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:33, n:1, pp:63-69 [Journal]
  8. Charles J. Colbourn, David A. Drake, Wendy J. Myrvold
    Ovals and hyperovals in nets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:294, n:1-2, pp:53-74 [Journal]
  9. Wendy J. Myrvold, Frank Ruskey
    Ranking and unranking permutations in linear time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:6, pp:281-284 [Journal]
  10. Wen-Ming Yan, Wendy J. Myrvold, Kuo-Liang Chung
    A Formula for the Number of Spanning Trees of a Multi-Star Related Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:6, pp:295-298 [Journal]
  11. Charles J. Colbourn, Wendy J. Myrvold, Eugene Neufeld
    Two Algorithms for Unranking Arborescences. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:2, pp:268-281 [Journal]
  12. John M. Boyer, Wendy J. Myrvold
    On the Cutting Edge: Simplified O(n) Planarity by Edge Addition. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:2, pp:241-273 [Journal]
  13. Bryan Gilbert, Wendy J. Myrvold
    Maximizing spanning trees in almost complete graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:30, n:1, pp:23-30 [Journal]
  14. Bryan Gilbert, Wendy J. Myrvold
    Maximizing spanning trees in almost complete graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:30, n:2, pp:97-104 [Journal]
  15. Wendy J. Myrvold
    The degree sequence is reconstructible from n-1 cards. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:2, pp:187-196 [Journal]

  16. The obstructions for toroidal graphs with no K3, 3's. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002