From Rogue to MicroRogue. - Aaron Stump; Ryan Besand; James C. Brodman; Jonathan Hseu; Bill Kinnersley (WRLA, 2004)

The hub number of a graph. - Tracy Grauman; Stephen G. Hartke; Adam S. Jobson; William B. Kinnersley; Douglas B. West; Lesley Wiglesworth; Pratik Worah; Hehui Wu (Inf. Process. Lett., 2008)

Extremal Problems for Roman Domination. - Erin W. Chambers; William B. Kinnersley; Noah Prince; Douglas B. West (SIAM J. Discret. Math., 2009)

On-line Ramsey Theory for Bounded Degree Graphs. - Jane Butterfield; Tracy Grauman; William B. Kinnersley; Kevin G. Milans; Christopher J. Stocker; Douglas B. West (Electron. J. Comb., 2011)

Degree Ramsey Numbers of Graphs. - William B. Kinnersley; Kevin G. Milans; Douglas B. West (Comb. Probab. Comput., 2012)

The Capture Time of the Hypercube. - Anthony Bonato; Przemyslaw Gordinowicz; Bill Kinnersley; Pawel Pralat (Electron. J. Comb., 2013)

New Results in t-Tone Coloring of Graphs. - Daniel W. Cranston; Jaehoon Kim; William B. Kinnersley (Electron. J. Comb., 2013)

A Note on the Acquaintance Time of Random Graphs. - William B. Kinnersley; Dieter Mitsche; Pawel Pralat (Electron. J. Comb., 2013)

The robber strikes back. - Anthony Bonato; Stephen Finbow; Przemyslaw Gordinowicz; Ali Haidar; William B. Kinnersley; Dieter Mitsche; Pawel Pralat; Ladislav Stacho (CoRR, 2013)

Game matching number of graphs. - Daniel W. Cranston; William B. Kinnersley; Suil O; Douglas B. West (Discret. Appl. Math., 2013)

Extremal Problems for Game Domination Number. - William B. Kinnersley; Douglas B. West; Reza Zamani (SIAM J. Discret. Math., 2013)

Toppling numbers of complete and random graphs. - Anthony Bonato; William B. Kinnersley; Pawel Pralat (Discret. Math. Theor. Comput. Sci., 2014)

Lazy Cops and Robbers on Hypercubes. - Deepak Bal; Anthony Bonato; William B. Kinnersley; Pawel Pralat (Comb. Probab. Comput., 2015)

Cops and Robbers is EXPTIME-complete. - William B. Kinnersley (J. Comb. Theory B, 2015)

Game brush number. - William B. Kinnersley; Pawel Pralat (Discret. Appl. Math., 2016)

Domination Game: A proof of the 3/5-Conjecture for Graphs with Minimum Degree at Least Two. - Michael A. Henning; William B. Kinnersley (SIAM J. Discret. Math., 2016)

To catch a falling robber. - William B. Kinnersley; Pawel Pralat; Douglas B. West (Theor. Comput. Sci., 2016)

The Game Saturation Number of a Graph. - James M. Carraher; William B. Kinnersley; Benjamin Reiniger; Douglas B. West (J. Graph Theory, 2017)

Cops, robbers, and burning bridges. - William B. Kinnersley; Eric Peterson (CoRR, 2018)

Bounds on the length of a game of Cops and Robbers. - William B. Kinnersley (Discret. Math., 2018)

Fully active cops and robbers. - Ilya Gromovikov; William B. Kinnersley; Ben Seamone (Australas. J Comb., 2020)

Bounds on the localization number. - Anthony Bonato; William B. Kinnersley (J. Graph Theory, 2020)

Catching a fast robber on a grid. - William B. Kinnersley; Nikolas Townsend (CoRR, 2021)

Catching an infinitely fast robber on a grid. - William B. Kinnersley; Nikolas Townsend (Discret. Appl. Math., 2022)

Accelerated Cops and Robbers. - William B. Kinnersley; Nikolas Townsend (CoRR, 2025)