Andrew Beveridge
Andrew Beveridge
Professor of Mathematics, Statistics and Computer Science, Macalester College
Verified email at - Homepage
Cited by
Cited by
Network of thrones
A Beveridge, J Shan
Math Horizons 23 (4), 18-22, 2016
Random minimum length spanning trees in regular graphs
A Beveridge, A Frieze, C McDiarmid
Combinatorica 18 (3), 311-333, 1998
Cops and robbers on geometric graphs
A Beveridge, A Dudek, A Frieze, T Müller
Combinatorics, Probability and Computing 21 (6), 816-834, 2012
Product rule wins a competitive game
A Beveridge, T Bohman, A Frieze, O Pikhurko
Proceedings of the American Mathematical Society 135 (10), 3061-3071, 2007
On the minimum order of k-cop-win graphs
W Baird, A Beveridge, A Bonato, P Codenotti, A Maurer, J McCauley, ...
arXiv preprint arXiv:1308.2841, 2013
Centers for random walks on trees
A Beveridge
SIAM Journal on Discrete Mathematics 23 (1), 300-318, 2009
A leapfrog strategy for pursuit-evasion in a polygonal environment
B Ames, A Beveridge, R Carlson, C Djang, V Isler, S Ragain, M Savage
International Journal of Computational Geometry & Applications 25 (02), 77-100, 2015
Symmetric rendezvous search on the line with an unknown initial distance
D Ozsoyeller, A Beveridge, V Isler
IEEE Transactions on Robotics 29 (6), 1366-1379, 2013
Game chromatic index of graphs with given restrictions on degrees
A Beveridge, T Bohman, A Frieze, O Pikhurko
Theoretical computer science 407 (1-3), 242-249, 2008
Pursuit-evasion: A toolkit to make applications more accessible [tutorial]
N Noori, A Beveridge, V Isler
IEEE Robotics & Automation Magazine 23 (4), 138-149, 2016
Exact mixing times for random walks on trees
A Beveridge, M Wang
Graphs and Combinatorics 29 (4), 757-772, 2013
Visibility number of directed graphs
M Axenovich, A Beveridge, JP Hutchinson, DB West
SIAM Journal on Discrete Mathematics 27 (3), 1429-1449, 2013
A hitting time formula for the discrete Green's function
A Beveridge
Combinatorics, Probability and Computing 25 (3), 362-379, 2016
Two-dimensional pursuit-evasion in a compact domain with piecewise analytic boundary
A Beveridge, Y Cai
arXiv preprint arXiv:1505.00297, 2015
Pursuit-evasion in a two-dimensional domain
A Beveridge, Y Cai
Ars Mathematica Contemporanea 13 (1), 187-206, 2017
Rendezvous in planar environments with obstacles and unknown initial distance
D Ozsoyeller, A Beveridge, V Isler
Artificial Intelligence 273, 19-36, 2019
The game of Game of Thrones: Networked concordances and fractal dramaturgy
A Beveridge, M Chemers
Reading Contemporary Serial Television Universes, 201-225, 2018
Maker‐breaker games on random geometric graphs
A Beveridge, A Dudek, A Frieze, T Müller, M Stojaković
Random structures & algorithms 45 (4), 553-607, 2014
Symmetric rendezvous in planar environments with and without obstacles
D Ozsoyeller, V Isler, A Beveridge
Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012
On the connectivity of extremal Ramsey graphs
A Beveridge, O Pikhurko
Australasian Journal of Combinatorics 41, 57, 2008
The system can't perform the operation now. Try again later.
Articles 1–20