2008 |
30 | EE | Philip Henderson,
Ryan B. Hayward:
Probing the 4-3-2 Edge Template in Hex.
Computers and Games 2008: 229-240 |
2007 |
29 | EE | Ryan B. Hayward,
Jeremy Spinrad,
R. Sritharan:
Improved algorithms for weakly chordal graphs.
ACM Transactions on Algorithms 3(2): (2007) |
2006 |
28 | EE | Ryan B. Hayward,
Broderick Arneson,
Philip Henderson:
Automatic Strategy Verification for Hex.
Computers and Games 2006: 112-121 |
27 | EE | Russell Greiner,
Ryan Hayward,
Magdalena Jankowska,
Michael Molloy:
Finding optimal satisficing strategies for and-or trees.
Artif. Intell. 170(1): 19-58 (2006) |
26 | EE | Ryan B. Hayward,
Jack van Rijswijck:
Hex and combinatorics.
Discrete Mathematics 306(19-20): 2515-2528 (2006) |
2005 |
25 | EE | Ryan Hayward,
Yngvi Björnsson,
Michael Johanson,
Morgan Kan,
Nathan Po,
Jack van Rijswijck:
Solving 7x7 Hex with domination, fill-in, and virtual connections.
Theor. Comput. Sci. 349(2): 123-139 (2005) |
2004 |
24 | EE | Ryan B. Hayward,
William J. Lenhart:
Bichromatic P4-composition schemes for perfect orderability.
Discrete Applied Mathematics 141(1-3): 161-183 (2004) |
23 | EE | Ryan B. Hayward,
Ron Shamir:
A note on tolerance graph recognition.
Discrete Applied Mathematics 143(1-3): 307-311 (2004) |
2003 |
22 | | Ryan Hayward,
Yngvi Björnsson,
Michael Johanson,
Morgan Kan,
Nathan Po,
Jack van Rijswijck:
Solving 7x7 Hex: Virtual Connections and Game-State Reduction.
ACG 2003: 261-278 |
2002 |
21 | | Russell Greiner,
Ryan Hayward,
Michael Molloy:
Optimal Depth-First Strategies for And-Or Trees.
AAAI/IAAI 2002: 725-730 |
20 | EE | Ryan B. Hayward,
Stefan Hougardy,
Bruce A. Reed:
Polynomial time recognition of P4-structure.
SODA 2002: 382-389 |
19 | | Ryan B. Hayward,
Paul E. Kearney,
Andrew J. Malton:
NeST graphs.
Discrete Applied Mathematics 121(1-3): 139-153 (2002) |
2001 |
18 | EE | Ryan B. Hayward,
William J. Lenhart:
Perfectly Orderable P4 Composition.
Electronic Notes in Discrete Mathematics 7: 190-193 (2001) |
17 | | Ryan B. Hayward:
Bull-Free Weakly Chordal Perfectly Orderable Graphs.
Graphs and Combinatorics 17(3): 479-500 (2001) |
2000 |
16 | EE | Ryan Hayward,
Jeremy Spinrad,
R. Sritharan:
Weakly chordal graph algorithms via handles.
SODA 2000: 42-49 |
1999 |
15 | EE | Paul E. Kearney,
Ryan Hayward,
Henk Meijer:
Evolutionary Trees and Ordinal Assertions.
Algorithmica 25(2-3): 196-221 (1999) |
14 | | Elaine M. Eschen,
Ryan Hayward,
Jeremy Spinrad,
R. Sritharan:
Weakly Triangulated Comparability Graphs.
SIAM J. Comput. 29(2): 378-386 (1999) |
1997 |
13 | | Paul E. Kearney,
Ryan Hayward,
Henk Meijer:
Inferring Evolutionary Trees from Ordinal Data.
SODA 1997: 418-426 |
12 | EE | Ryan B. Hayward:
Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability.
Discrete Applied Mathematics 73(3): 199-210 (1997) |
11 | EE | Ryan B. Hayward:
Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac.
Discrete Applied Mathematics 78(1-3): 283-289 (1997) |
1996 |
10 | | Colin McDiarmid,
Ryan Hayward:
Large Deviations for Quicksort.
J. Algorithms 21(3): 476-507 (1996) |
9 | EE | Ryan B. Hayward:
RecognizingP3-Structure: A Switching Approach.
J. Comb. Theory, Ser. B 66(2): 247-262 (1996) |
1994 |
8 | | Ryan Hayward,
Paul E. Kearney:
Tolerance-Free NeST Representations.
CCCG 1994: 275-280 |
1992 |
7 | EE | Colin McDiarmid,
Ryan Hayward:
Strong Concentration for Quicksort.
SODA 1992: 414-421 |
1991 |
6 | | Ryan Hayward,
Colin McDiarmid:
Average Case Analysis of Heap Building by Repeated Insertion.
J. Algorithms 12(1): 126-153 (1991) |
1990 |
5 | EE | Ryan B. Hayward,
William J. Lenhart:
On the P4-structure of Perfect Graphs. IV. Partner graphs.
J. Comb. Theory, Ser. B 48(1): 135-139 (1990) |
4 | EE | Ryan B. Hayward:
Murky graphs.
J. Comb. Theory, Ser. B 49(2): 200-235 (1990) |
1989 |
3 | | Ryan Hayward:
A Note on the Circle Containment Problem.
Discrete & Computational Geometry 4: 263-264 (1989) |
1987 |
2 | | Ryan B. Hayward:
A Low Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.
Discrete & Computational Geometry 2: 327-343 (1987) |
1985 |
1 | EE | Ryan B. Hayward:
Weakly triangulated graphs.
J. Comb. Theory, Ser. B 39(3): 200-208 (1985) |