Weakly triangulated graphs. - Ryan B. Hayward (J. Comb. Theory B, 1985)

A Low Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem. - Ryan B. Hayward (Discret. Comput. Geom., 1987)

A Note on the Circle Containment Problem. - Ryan Hayward (Discret. Comput. Geom., 1989)

Optimizing weakly triangulated graphs. - Ryan Hayward; Chính T. Hoàng; Frédéric Maffray (Graphs Comb., 1990)

Murky graphs. - Ryan B. Hayward (J. Comb. Theory B, 1990)

On the P4-structure of Perfect Graphs. IV. Partner graphs. - Ryan B. Hayward; William J. Lenhart (J. Comb. Theory B, 1990)

Average Case Analysis of Heap Building by Repeated Insertion. - Ryan Hayward; Colin McDiarmid (J. Algorithms, 1991)

Strong Concentration for Quicksort. - Colin McDiarmid; Ryan Hayward (SODA, 1992)

Tolerance-Free NeST Representations. - Ryan Hayward; Paul E. Kearney (CCCG, 1994)

Discs in unbreakable graphs. - Ryan B. Hayward (Graphs Comb., 1995)

Large Deviations for Quicksort. - Colin McDiarmid; Ryan Hayward (J. Algorithms, 1996)

RecognizingP3-Structure: A Switching Approach. - Ryan B. Hayward (J. Comb. Theory B, 1996)

Generating weakly triangulated graphs. - Ryan Hayward (J. Graph Theory, 1996)

Inferring Evolutionary Trees from Ordinal Data. - Paul E. Kearney; Ryan Hayward; Henk Meijer (SODA, 1997)

Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability. - Ryan B. Hayward (Discret. Appl. Math., 1997)

Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac. - Ryan B. Hayward (Discret. Appl. Math., 1997)

Evolutionary Trees and Ordinal Assertions. - Paul E. Kearney; Ryan Hayward; Henk Meijer (Algorithmica, 1999)

Weakly Triangulated Comparability Graphs. - Elaine M. Eschen; Ryan Hayward; Jeremy P. Spinrad; R. Sritharan (SIAM J. Comput., 1999)

Weakly chordal graph algorithms via handles. - Ryan Hayward; Jeremy P. Spinrad; R. Sritharan (SODA, 2000)

Perfectly Orderable P4 Composition. - Ryan B. Hayward; William J. Lenhart (Electron. Notes Discret. Math., 2001)

Bull-Free Weakly Chordal Perfectly Orderable Graphs. - Ryan B. Hayward (Graphs Comb., 2001)

Optimal Depth-First Strategies for And-Or Trees. - Russell Greiner; Ryan Hayward; Michael Molloy 001 (AAAI/IAAI, 2002)

Polynomial time recognition of P4-structure. - Ryan B. Hayward; Stefan Hougardy; Bruce A. Reed (SODA, 2002)

NeST graphs. - Ryan B. Hayward; Paul E. Kearney; Andrew J. Malton (Discret. Appl. Math., 2002)

Solving 7x7 Hex: Virtual Connections and Game-State Reduction. - Ryan Hayward; Yngvi Björnsson; Michael Johanson; Morgan Kan; Nathan Po; Jack van Rijswijck (ACG, 2003)

Bichromatic P4-composition schemes for perfect orderability. - Ryan B. Hayward; William J. Lenhart (Discret. Appl. Math., 2004)

A note on tolerance graph recognition. - Ryan B. Hayward; Ron Shamir (Discret. Appl. Math., 2004)

Solving 7x7 Hex with domination, fill-in, and virtual connections. - Ryan Hayward; Yngvi Björnsson; Michael Johanson; Morgan Kan; Nathan Po; Jack van Rijswijck (Theor. Comput. Sci., 2005)

Automatic Strategy Verification for Hex. - Ryan B. Hayward; Broderick Arneson; Philip Henderson (Computers and Games, 2006)

Finding optimal satisficing strategies for and-or trees. - Russell Greiner; Ryan Hayward; Magdalena Jankowska; Michael Molloy 001 (Artif. Intell., 2006)

Hex and combinatorics. - Ryan B. Hayward; Jack van Rijswijck (Discret. Math., 2006)

The Story of Perfectly Orderable Graphs. - Ryan B. Hayward (Graphs Comb., 2007)

Improved algorithms for weakly chordal graphs. - Ryan B. Hayward; Jeremy P. Spinrad; R. Sritharan (ACM Trans. Algorithms, 2007)

Probing the 4-3-2 Edge Template in Hex. - Philip Henderson; Ryan B. Hayward (Computers and Games, 2008)

Hex, Braids, the Crossing Rule, and XH-Search. - Philip Henderson; Broderick Arneson; Ryan B. Hayward (ACG, 2009)

Solving 8x8 Hex. - Philip Henderson; Broderick Arneson; Ryan B. Hayward (IJCAI, 2009)

Solving Hex: Beyond Humans. - Broderick Arneson; Ryan B. Hayward; Philip Henderson (Computers and Games, 2010)

Monte Carlo Tree Search in Hex. - Broderick Arneson; Ryan B. Hayward; Philip Henderson (IEEE Trans. Comput. Intell. AI Games, 2010)

Blunder Cost in Go and Hex. - Henry Brausen; Ryan B. Hayward; Martin Müller 003; Abdul Qadir; David Spies (ACG, 2011)

How to play Reverse Hex. - Ryan B. Hayward; Bjarne Toft; Philip Henderson (Discret. Math., 2012)

MOHEX Wins Hex Tournament. - Ryan Hayward (J. Int. Comput. Games Assoc., 2012)

MoHex 2.0: A Pattern-Based MCTS Hex Player. - Shih-Chieh Huang; Broderick Arneson; Ryan B. Hayward; Martin Müller 003; Jakub Pawlewicz (Computers and Games, 2013)

Scalable Parallel DFPN Search. - Jakub Pawlewicz; Ryan B. Hayward (Computers and Games, 2013)

An Architecture for Parallelizing Fully Homomorphic Cryptography on Cloud. - Ryan Hayward; Chia-Chu Chiang (CISIS, 2013)

MOHEX Wins Hex Tournament. - Ryan Hayward; Broderick Arneson; Shih-Chieh Huang; Jakub Pawlewicz (J. Int. Comput. Games Assoc., 2013)

Solving Substitution Ciphers with Combined Language Models. - Bradley Hauer; Ryan Hayward; Grzegorz Kondrak (COLING, 2014)

A winning strategy for 3×n Cylindrical Hex. - Samuel Clowes Huneke; Ryan B. Hayward; Bjarne Toft (Discret. Math., 2014)

Feature Strength and Parallelization of Sibling Conspiracy Number Search. - Jakub Pawlewicz; Ryan B. Hayward (ACG, 2015)

Sibling Conspiracy Number Search. - Jakub Pawlewicz; Ryan B. Hayward (SOCS, 2015)

Stronger Virtual Connections in Hex. - Jakub Pawlewicz; Ryan B. Hayward; Philip Henderson; Broderick Arneson (IEEE Trans. Comput. Intell. AI Games, 2015)

A Reverse Hex Solver. - Kenny Young; Ryan B. Hayward (Computers and Games, 2016)

NeuroHex: A Deep Q-learning Hex Agent. - Kenny Young; Gautham Vasan; Ryan Hayward (CGW@IJCAI, 2016)

Conspiracy number search with relative sibling scores. - Jakub Pawlewicz; Ryan B. Hayward (Theor. Comput. Sci., 2016)

Exploring Positional Linear Go. - Noah Weninger; Ryan Hayward (ACG, 2017)

Focused Depth-first Proof Number Search using Convolutional Neural Networks for the Game of Hex. - Chao Gao; Martin Müller 003; Ryan Hayward (IJCAI, 2017)

Mohex Wins 2015 Hex 11×11 and Hex 13×13 Tournaments. - Ryan Hayward; Jakub Pawlewicz; Kei Takada; Ton van der Valk (J. Int. Comput. Games Assoc., 2017)

Hex 2017: MoHex wins the 11x11 and 13x13 tournaments. - Ryan Hayward; Noah Weninger (J. Int. Comput. Games Assoc., 2017)

Adversarial Policy Gradient for Alternating Markov Games. - Chao Gao; Martin Müller 003; Ryan Hayward (ICLR (Workshop), 2018)

Three-Head Neural Network Architecture for Monte Carlo Tree Search. - Chao Gao; Martin Müller 003; Ryan Hayward (IJCAI, 2018)

A transferable neural network for Hex. - Chao Gao; Siqi Yan; Ryan Hayward; Martin Müller 003 (J. Int. Comput. Games Assoc., 2018)

Move Prediction Using Deep Convolutional Neural Networks in Hex. - Chao Gao; Ryan Hayward; Martin Müller 003 (IEEE Trans. Games, 2018)

New Hex Patterns for Fill and Prune. - Nicolas Fabiano; Ryan Hayward (ACG, 2019)

Mutex Graphs and Multicliques: Reducing Grounding Size for Planning. - David Spies; Jia-Huai You; Ryan Hayward (ICLP Technical Communications, 2019)

Hex 2018: MoHex3HNN over DeepEzo. - Chao Gao; Kei Takada; Ryan Hayward (J. Int. Comput. Games Assoc., 2019)

Domain-Independent Cost-Optimal Planning in ASP. - David Spies; Jia-Huai You; Ryan Hayward (Theory Pract. Log. Program., 2019)

BoxOff is NP-Complete. - Ryan Hayward; Robert Hearn; Mahya Jamshidian (ACG, 2021)

Improving Search in Go Using Bounded Static Safety. - Owen Randall; Ting-Han Wei; Ryan Hayward; Martin Müller 003 (CG, 2022)

Expected Work Search: Combining Win Rate and Proof Size Estimation. - Owen Randall; Martin Müller 003; Ting-Han Wei; Ryan Hayward (IJCAI, 2024)