The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ryan B. Hayward: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed
    Polynomial time recognition of P4-structure. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:382-389 [Conf]
  2. Ryan B. Hayward
    Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:73, n:3, pp:199-210 [Journal]
  3. Ryan B. Hayward
    Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:283-289 [Journal]
  4. Ryan B. Hayward, Paul E. Kearney, Andrew J. Malton
    NeST graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:139-153 [Journal]
  5. Ryan B. Hayward, William J. Lenhart
    Bichromatic P4-composition schemes for perfect orderability. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:161-183 [Journal]
  6. Ryan B. Hayward, Ron Shamir
    A note on tolerance graph recognition. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:307-311 [Journal]
  7. Ryan B. Hayward
    A Low Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:327-343 [Journal]
  8. Ryan B. Hayward, Jack van Rijswijck
    Hex and combinatorics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2515-2528 [Journal]
  9. Ryan B. Hayward
    Bull-Free Weakly Chordal Perfectly Orderable Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:479-500 [Journal]
  10. Ryan B. Hayward
    Weakly triangulated graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:39, n:3, pp:200-208 [Journal]
  11. Ryan B. Hayward
    Murky graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:49, n:2, pp:200-235 [Journal]
  12. Ryan B. Hayward
    RecognizingP3-Structure: A Switching Approach. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:247-262 [Journal]
  13. Ryan B. Hayward, William J. Lenhart
    On the P4-structure of Perfect Graphs. IV. Partner graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:48, n:1, pp:135-139 [Journal]
  14. Ryan B. Hayward, Broderick Arneson, Philip Henderson
    Automatic Strategy Verification for Hex. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2006, pp:112-121 [Conf]
  15. Ryan B. Hayward, Jeremy Spinrad, R. Sritharan
    Improved algorithms for weakly chordal graphs. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  16. Hex, Braids, the Crossing Rule, and XH-Search. [Citation Graph (, )][DBLP]


  17. Probing the 4-3-2 Edge Template in Hex. [Citation Graph (, )][DBLP]


  18. Solving 8x8 Hex. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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