25. Line-of-Sight Pursuit in Stritly Sweepable Polygons
(with Lindsay Berry, Jane Butterfield, Volkan Isler, Zachary Keller, Alana Shine and Junyi Wang.)

24. A Pursuit-Evasion Toolkit
(with Narges Noori and Volkan Isler.)

23. Two-Dimensional Pursuit-Evasion in a Compact Domain with Piecewise Analytic Boundary
(with Yiqing Cai.)

22. The best mixing time for random walks on trees
(with Jeanmarie Youngblood.)

To Appear


21. A hitting time formula for the discrete Green's function
To appear in Combinatorics, Probability and Computing.



20. A leapfrog strategy for pursuit-evasion in polygonal environments
(with Brendan Ames, Claire Djang, Rosalie Carlson, Volkan Isler, Stephen Ragain and Maxray Savage.)
International Journal on Computational Geometry and Applications, Vol.~25, No.~2, (2015) pp. 77-100.

19. Maker-Breaker games on random geometric graphs
(with Andrjez Dudek, Alan Frieze, Tobais Mueller and Milos Stojakovic.)
Random Structures and Algorithms, Vol. 45, No. 4 (2014), pp. 553-607.

18. The Sorting Hat Goes to College
(with Stan Wagon.)
Mathematics Magazine, Vol. 87, No. 4 (2014) pp. 243-251.

17. On the minimum order of k-cop-win graphs
(with William Baird, Anthony Bonato, Paolo Codenotti, Aaron Maurer, John McCauley and Silviya Valeva.)
Contributions to Discrete Mathematics, Vol. 9, No. 1 (2014), pp. 1-15.
16. Visibility Number of Directed Graphs
(with Maria Axenovich, Joan P. Hutchinson and Douglas B. West.)
SIAM Journal on Discrete Mathematics, Vol 27, No. 3, (2013), 1429--1449.

15. Symmetric Rendezvous on the Line with an Unknown Initial Distance
(with Deniz Ozsoyeller and I. Volkan Isler.)
IEEE Transactions on Robotics, Vol 29, No. 6 (2013), 1366--1379.

14. Exact mixing times for random walks on trees
(with Meng Wang.)
Graphs and Combinatorics, Vol. 29, No. 4 (2013), pp. 757-772.

13. Cops and robbers on geometric graphs
(with Andrzej Dudek, Alan Frieze and Tobias Mueller.)
Combinatorics, Probability and Computing, Vol 21, No 6 (2012), pp. 816-834.

12. Symmetric Rendezvous in Planar Environments with and without Obstacles
(with Deniz Ozsoyeller and I. Volkan Isler.)
Proceedings of AAAI Conference on Artificial Intelligence 2012, AAAI Press, 2012.

11. The Mathematical Sorting Hat: First Year Course Assignment at Macalester College
(with Sean Cooke.)
UMAP journal, Vol. 33, No. 2 (2012), pp. 99-118].

10. On the mixing time of geographical threshold graphs
(with Milan Bradonjic.)
Discrete Mathematics, Vol 311, No. 23-24 (2011) 2637-2649

9. Connectivity of random cubic sum graphs
SIAM Journal on Discrete Mathematics, Vol. 24, No. 3 (2010), 895-909.

8. Exit frequency matrices for finite Markov chains
(with László Lovász.)
Combinatorics, Probability and Computing, Vol. 19, No. 4 (2010) 541-560.

7. Memoryless rules for Achlioptas processes
(with Tom Bohman, Alan Frieze and Oleg Pikhurko.)
SIAM Journal on Discrete Mathematics, Vol. 23, Issue 2 (2009), pp. 993-1005.

6. Centers for random walks on trees
SIAM Journal on Discrete Mathematics, Vol. 23, Issue 1 (2009), pp. 300-319.

5. Game chromatic index of graphs with given restrictions on degrees
(with Tom Bohman, Alan Frieze and Oleg Pikhurko.)
Theoretical Computer Science, 407 (2008), 242-249.

4. On the connectivity of extremal Ramsey graphs
(with Oleg Pikhurko.)
Australasian Journal of Combinatorics, 41 (2008), 57-62.

3. Product rule wins a competitive game
(with Tom Bohman, Alan Frieze and Oleg Pikhurko.)
Proceedings of the AMS, Volume 135, No. 10 (2007), 3061-3071.

2. Random minimum length spanning trees in regular graphs
(with Alan Frieze and Colin McDiarmid.)
Combinatorica 18 (1998), 311-333.

1. Random walks and the regeneration time
(with László Lovász.)
J. Graph Theory 29 (1998) 57-62.