default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Beveridge
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j24]Andrew Beveridge, Ian Calaway, Kristin Heysse
:
De Finetti Lattices and Magog Triangles. Electron. J. Comb. 28(1): 1 (2021)- [j23]Andrew Beveridge, Ian Calaway:
The Voter Basis and the Admissibility of Tree Characters. Order 38(3): 489-514 (2021)
2010 – 2019
- 2019
- [j22]Deniz Ozsoyeller, Andrew Beveridge, Volkan Isler:
Rendezvous in planar environments with obstacles and unknown initial distance. Artif. Intell. 273: 19-36 (2019) - [j21]Lindsay Berry, Andrew Beveridge, Jane Butterfield, Volkan Isler, Zachary Keller, Alana Shine, Junyi Wang:
Line-of-Sight Pursuit in Monotone and Scallop Polygons. Int. J. Comput. Geom. Appl. 29(4): 307-351 (2019) - 2017
- [j20]Andrew Beveridge, Yiqing Cai:
Pursuit-evasion in a two-dimensional domain. Ars Math. Contemp. 13(1): 187-206 (2017) - 2016
- [j19]Andrew Beveridge:
A Hitting Time Formula for the Discrete Green's Function. Comb. Probab. Comput. 25(3): 362-379 (2016) - [j18]Andrew Beveridge, Jeanmarie Youngblood:
The Best Mixing Time for Random Walks on Trees. Graphs Comb. 32(6): 2211-2239 (2016) - [j17]Narges Noori, Andrew Beveridge, Volkan Isler:
Pursuit-Evasion: A Toolkit to Make Applications More Accessible [Tutorial]. IEEE Robotics Autom. Mag. 23(4): 138-149 (2016) - 2015
- [j16]Brendan P. W. Ames, Andrew Beveridge, Rosalie Carlson, Claire Djang, Volkan Isler, Stephen Ragain, Maxray Savage:
A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment. Int. J. Comput. Geom. Appl. 25(2): 77-100 (2015) - [c3]Jacob Baungard Hansen, Andrew Beveridge, Roisin Farmer, Leif Gehrmann, Alasdair J. G. Gray, Sunil Khutan, Tomas Robertson, Johnny Val:
Validata: An Online Tool for Testing RDF Data Conformance. SWAT4LS 2015: 157-166 - [i4]Andrew Beveridge, Yiqing Cai:
Two-Dimensional Pursuit-Evasion in a Compact Domain with Piecewise Analytic Boundary. CoRR abs/1505.00297 (2015) - [i3]Lindsay Berry, Andrew Beveridge, Jane Butterfield, Volkan Isler, Zachary Keller, Alana Shine, Junyi Wang:
Line-of-Sight Pursuit in Strictly Sweepable Polygons. CoRR abs/1508.07603 (2015) - 2014
- [j15]William Baird, Andrew Beveridge, Anthony Bonato, Paolo Codenotti, Aaron Maurer, John McCauley, Silviya Valeva:
On the minimum order of $k$-cop win graphs. Contributions Discret. Math. 9(1) (2014) - [j14]Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller, Milos Stojakovic:
Maker-breaker games on random geometric graphs. Random Struct. Algorithms 45(4): 553-607 (2014) - [i2]Brendan P. W. Ames, Andrew Beveridge, Rosalie Carlson, Claire Djang, Volkan Isler, Stephen Ragain, Maxray Savage:
A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment. CoRR abs/1401.2960 (2014) - 2013
- [j13]Andrew Beveridge, Meng Wang:
Exact Mixing Times for Random Walks on Trees. Graphs Comb. 29(4): 757-772 (2013) - [j12]Maria Axenovich, Andrew Beveridge, Joan P. Hutchinson, Douglas B. West:
Visibility Number of Directed Graphs. SIAM J. Discret. Math. 27(3): 1429-1449 (2013) - [j11]Deniz Ozsoyeller, Andrew Beveridge, Volkan Isler:
Symmetric Rendezvous Search on the Line With an Unknown Initial Distance. IEEE Trans. Robotics 29(6): 1366-1379 (2013) - 2012
- [j10]Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller:
Cops and Robbers on Geometric Graphs. Comb. Probab. Comput. 21(6): 816-834 (2012) - [c2]Deniz Ozsoyeller, Volkan Isler, Andrew Beveridge:
Symmetric Rendezvous in Planar Environments With and Without Obstacles. AAAI 2012: 2046-2052 - 2011
- [j9]Andrew Beveridge, Milan Bradonjic:
On the mixing time of geographical threshold graphs. Discret. Math. 311(23-24): 2637-2649 (2011) - [i1]Andrew Beveridge, Milan Bradonjic:
On the Mixing Time of Geographical Threshold Graphs. CoRR abs/1109.4311 (2011) - 2010
- [j8]Andrew Beveridge, László Lovász:
Exit Frequency Matrices for Finite Markov Chains. Comb. Probab. Comput. 19(4): 541-560 (2010) - [j7]Andrew Beveridge:
Connectivity of Random Cubic Sum Graphs. SIAM J. Discret. Math. 24(3): 895-909 (2010)
2000 – 2009
- 2009
- [j6]Andrew Beveridge:
Centers for Random Walks on Trees. SIAM J. Discret. Math. 23(1): 300-318 (2009) - [j5]Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko:
Memoryless Rules for Achlioptas Processes. SIAM J. Discret. Math. 23(2): 993-1008 (2009) - 2008
- [j4]Andrew Beveridge, Oleg Pikhurko:
On the connectivity of extremal Ramsey graphs. Australas. J Comb. 41: 57-62 (2008) - [j3]Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko:
Game chromatic index of graphs with given restrictions on degrees. Theor. Comput. Sci. 407(1-3): 242-249 (2008)
1990 – 1999
- 1998
- [j2]Andrew Beveridge, Alan M. Frieze, Colin McDiarmid:
Random Minimum Length Spanning Trees in Regular Graphs. Comb. 18(3): 311-333 (1998) - [j1]Andrew Beveridge, László Lovász:
Random walks and the regeneration time. J. Graph Theory 29(2): 57-62 (1998)
1980 – 1989
- 1981
- [c1]Joseph Raben, Lorraine Borman, Robert S. Fenchel, Thomas H. Ohlgren, Norman K. Sondheimer, Andrew Beveridge, Kevin Roddy:
Conference on easier and more productive use of computing systems (session listings). CHI (2) 1981: 146-149
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
