Andrew Beveridge

According to our database, Andrew Beveridge authored at least 29 papers between 1981 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2021

The Voter Basis and the Admissibility of Tree Characters.

Andrew Beveridge, Ian Calaway

Order, 2021

De Finetti Lattices and Magog Triangles.

Andrew Beveridge, Ian Calaway, Kristin Heysse

Electron. J. Comb., 2021

2019

Line-of-Sight Pursuit in Monotone and Scallop Polygons.

Lindsay Berry, Andrew Beveridge, Jane Butterfield, Volkan Isler, Zachary Keller, Alana Shine, Junyi Wang

Int. J. Comput. Geom. Appl., 2019

Rendezvous in planar environments with obstacles and unknown initial distance.

Deniz Ozsoyeller, Andrew Beveridge, Volkan Isler

Artif. Intell., 2019

2017

Pursuit-evasion in a two-dimensional domain.

Andrew Beveridge, Yiqing Cai

Ars Math. Contemp., 2017

2016

Pursuit-Evasion: A Toolkit to Make Applications More Accessible [Tutorial].

Narges Noori, Andrew Beveridge, Volkan Isler

IEEE Robotics Autom. Mag., 2016

The Best Mixing Time for Random Walks on Trees.

Andrew Beveridge, Jeanmarie Youngblood

Graphs Comb., 2016

A Hitting Time Formula for the Discrete Green's Function.

Andrew Beveridge

Comb. Probab. Comput., 2016

2015

A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment.

Brendan P. W. Ames, Andrew Beveridge, Rosalie Carlson, Claire Djang, Volkan Isler, Stephen Ragain, Maxray Savage

Int. J. Comput. Geom. Appl., 2015

Two-Dimensional Pursuit-Evasion in a Compact Domain with Piecewise Analytic Boundary.

Andrew Beveridge, Yiqing Cai

CoRR, 2015

Line-of-Sight Pursuit in Strictly Sweepable Polygons.

Lindsay Berry, Andrew Beveridge, Jane Butterfield, Volkan Isler, Zachary Keller, Alana Shine, Junyi Wang

CoRR, 2015

Validata: An Online Tool for Testing RDF Data Conformance.

Jacob Baungard Hansen, Andrew Beveridge, Roisin Farmer, Leif Gehrmann, Alasdair J. G. Gray, Sunil Khutan, Tomas Robertson, Johnny Val

Proceedings of the 8th Semantic Web Applications and Tools for Life Sciences International Conference, 2015

2014

Maker-breaker games on random geometric graphs.

Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller, Milos Stojakovic

Random Struct. Algorithms, 2014

On the minimum order of $k$-cop win graphs.

William Baird, Andrew Beveridge, Anthony Bonato, Paolo Codenotti, Aaron Maurer, John McCauley, Silviya Valeva

Contributions Discret. Math., 2014

2013

Symmetric Rendezvous Search on the Line With an Unknown Initial Distance.

Deniz Ozsoyeller, Andrew Beveridge, Volkan Isler

IEEE Trans. Robotics, 2013

Visibility Number of Directed Graphs.

Maria Axenovich, Andrew Beveridge, Joan P. Hutchinson, Douglas B. West

SIAM J. Discret. Math., 2013

Exact Mixing Times for Random Walks on Trees.

Andrew Beveridge, Meng Wang

Graphs Comb., 2013

2012

Cops and Robbers on Geometric Graphs.

Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller

Comb. Probab. Comput., 2012

Symmetric Rendezvous in Planar Environments With and Without Obstacles.

Deniz Ozsoyeller, Volkan Isler, Andrew Beveridge

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

On the mixing time of geographical threshold graphs.

Andrew Beveridge, Milan Bradonjic

Discret. Math., 2011

2010

Connectivity of Random Cubic Sum Graphs.

Andrew Beveridge

SIAM J. Discret. Math., 2010

Exit Frequency Matrices for Finite Markov Chains.

Andrew Beveridge, László Lovász

Comb. Probab. Comput., 2010

2009

Memoryless Rules for Achlioptas Processes.

Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko

SIAM J. Discret. Math., 2009

Centers for Random Walks on Trees.

Andrew Beveridge

SIAM J. Discret. Math., 2009

2008

Game chromatic index of graphs with given restrictions on degrees.

Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko

Theor. Comput. Sci., 2008

On the connectivity of extremal Ramsey graphs.

Andrew Beveridge, Oleg Pikhurko

Australas. J Comb., 2008

1998

Random walks and the regeneration time.

Andrew Beveridge, László Lovász

J. Graph Theory, 1998

Random Minimum Length Spanning Trees in Regular Graphs.

Andrew Beveridge, Alan M. Frieze, Colin McDiarmid

Comb., 1998

1981

Conference on easier and more productive use of computing systems (session listings).

Joseph Raben, Lorraine Borman, Robert S. Fenchel, Thomas H. Ohlgren, Norman K. Sondheimer, Andrew Beveridge, Kevin Roddy

Proceedings of the Joint Conference on Easier and More Productive Use of Computer Systems, 1981