1. Cops, robbers, and burning bridges (with E. Peterson), in preparation.
  2. Fully active cops and robbers (with I. Gromovikow and B. Seamone), submitted.
  3. Bounds on the localization number (with A. Bonato), submitted. preprint
  4. Bounds on the length of a game of Cops and Robbers, Discrete Math. 341 (2018), 2508--2518. preprint
  5. The game saturation number of graphs (with J.M. Carraher, B. Reiniger, and D.B. West), J. Graph Theory 85 (2017), no. 2, 481--495. preprint
  6. Lazy Cops and Robbers played on random graphs and graphs on surfaces (with D. Bal, A. Bonato, and P. Prałat), J. Combinatorics 7 (2016), 627--642. preprint
  7. Domination game: a proof of the 3/5-Conjecture for graphs with minimum degree at least two (with M. A. Henning), SIAM J. Discrete Math. 31 (2016), 20--35. preprint
  8. Game brush number (with P. Prałat), Discrete Applied Math. 207 (2016), 1--14. preprint
  9. To catch a falling robber (with P. Prałat and D.B. West), Theoretical Computer Science 627 (2016), 107--111. preprint
  10. Lazy Cops and Robbers on hypercubes (with D. Bal, A. Bonato, and P. Prałat), Combinatorics, Probability, and Computing 24 (2015), 829--837. preprint
  11. Cops and Robbers is EXPTIME-complete, Journal of Combinatorial Theory, Series B 111 (2015), 201--220. preprint
  12. Toppling numbers of complete and random graphs (with A. Bonato and P. Prałat), Discrete Mathematics and Theoretical Computer Science 16:3 (2014), 229--252. preprint
  13. Spanning paths in Fibonacci-sum graphs (with K. Fox, D. McDonald, N. Orlow, and G.J. Puleo), Fibonacci Quarterly 52 (2014), 46--49. preprint
  14. Extremal problems for game domination number (with D.B. West and R. Zamani), SIAM J. Discrete Math. 27 (2013), 2090--2017. preprint
  15. A note on the acquaintance time of random graphs (with D. Mitsche and P. Prałat), Electron. J. Combin. 20 (2013), Paper P52. preprint
  16. The robber strikes back (with A. Bonato, S. Finbow, P. Gordinowicz, A. Haidar, D. Mitsche, P. Prałat, and L. Stacho), in Proc. of ICC3, 2013. preprint
  17. The capture time of the hypercube (with A. Bonato, P. Gordinowicz, and P. Prałat), Electon. J. Combin. 20 (2013), Paper P24. preprint
  18. New results in t-tone coloring of graphs (with D.W. Cranston and J. Kim), Electron. J. Combin. 20 (2013), Paper P17. preprint
  19. Game matching number of graphs (with D.W. Cranston, S. O, and D.B. West), Discrete Applied Math. 161 (2013), 1828--1836. preprint
  20. Chain-making games in grid-like posets (with D.W. Cranston, K.G. Milans, G.J. Puleo, and D.B. West), J. Combinatorics 3 (2012), 633--649. preprint
  21. Multicolor on-line degree Ramsey numbers of trees (with D.B. West), J. Combinatorics 3 (2012), 91--100. preprint
  22. Degree Ramsey numbers of graphs (with K.G. Milans and D.B. West), Combinatorics, Probability, and Computing 21 (2012), 229--253. preprint
  23. On-line Ramsey theory for bounded degree graphs (with J. Butterfield, T. Grauman, K.G. Milans, C. Stocker, and D.B. West), Electronic J. Combinatorics 18 (2011), paper P136. preprint
  24. Extremal problems for Roman domination (with E.W. Chambers, N. Prince, and D.B. West), SIAM J. Discrete Math. 23 (2009), 1575-1586. preprint
  25. The hub number of a graph (with T. Grauman, S.G. Hartke, A. Jobson, D.B. West, L. Wiglesworth, P. Worah, and H. Wu) Info. Proc. Lett. 108 (2008) 226-228. preprint