default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard B. Borie
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j11]Richard B. Borie, Craig A. Tovey
, Sven Koenig:
Algorithms and complexity results for graph-based pursuit evasion. Auton. Robots 31(4): 317-332 (2011)- 2010
- [c8]Kenny Daniel, Richard B. Borie, Sven Koenig, Craig A. Tovey:
ESP: pursuit evasion on series-parallel graphs. AAMAS 2010: 1519-1520
2000 – 2009
- 2009
- [c7]Richard B. Borie, Craig A. Tovey, Sven Koenig:
Algorithms and Complexity Results for Pursuit-Evasion Problems. IJCAI 2009: 59-66 - 2008
- [j10]Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Solving problems on recursively constructed graphs. ACM Comput. Surv. 41(1): 4:1-4:51 (2008) - [c6]Sven Koenig, Xiaoming Zheng, Craig A. Tovey, Richard B. Borie, Philip Kilby, Vangelis Markakis, Pinar Keskinocak:
Agent Coordination with Regret Clearing. AAAI 2008: 101-107 - 2005
- [c5]Kairui Chen, Hui-Chuan Chen, Richard B. Borie, Jonathan C. L. Liu:
File replication in video on demand services. ACM Southeast Regional Conference (1) 2005: 162-167 - 2003
- [p2]Alfred V. Aho, Mark Goldberg, Josef Lauri, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graph Representation. Handbook of Graph Theory 2003: 56-125 - [p1]Harold N. Gabow, Camil Demetrescu, Irene Finocchi, Giuseppe Francesco Italiano, Giuseppe Liotta, Roberto Tamassia, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graphs in Computer Science. Handbook of Graph Theory 2003: 952-1073 - 2000
- [j9]Steven B. Horton, R. Gary Parker, Richard B. Borie:
On minimum cuts and the linear arrangement problem. Discret. Appl. Math. 103(1-3): 127-139 (2000) - [c4]D. J. Jackson, Russell L. Pimmel, Allen S. Parrish, Brandon Dixon, David Cordes, Richard B. Borie:
Logic design programming assignments in a first-year course. CATA 2000: 412-414
1990 – 1999
- 1999
- [j8]Richard B. Borie, Jeremy P. Spinrad:
Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time. Discret. Appl. Math. 91(1-3): 287-292 (1999) - 1998
- [c3]Allen S. Parrish, Richard B. Borie, David W. Cordes, Brandon Dixon, David P. Hale, Joanne E. Hale, Jeff Jackson, Shane Sharpe:
Computer Engineering, Computer Science and Management Information Systems: Partners in a Unified Software Engineering Curriculum. CSEE&T 1998: 67-75 - 1996
- [j7]Allen S. Parrish, David Cordes, Richard B. Borie, S. Edara:
Illustrating Client and Implementation Readability Tradeoffs in Ada and C++. Softw. Pract. Exp. 26(7): 799-814 (1996) - 1995
- [j6]Richard B. Borie:
Generation of Polynomial-Time Algorithms for Some Optimization Problems on Tree-Decomposable Graphs. Algorithmica 14(2): 123-137 (1995) - 1993
- [j5]Allen S. Parrish, Richard B. Borie, David W. Cordes:
Automated flow graph-based testing of object-oriented software modules. J. Syst. Softw. 23(2): 95-109 (1993) - [j4]Richard B. Borie, Allen S. Parrish, Srinivas Mandyam:
Lock-and-key Strategies for Handling Undefined Variables. Softw. Pract. Exp. 23(7): 693-710 (1993) - [c2]Allen S. Parrish, David Cordes, Richard B. Borie:
Developmental testing of abstract data types. COMPSAC 1993: 49-55 - 1992
- [j3]Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families. Algorithmica 7(5&6): 555-581 (1992) - [c1]Richard B. Borie, Allen S. Parrish:
Improving strategies for handling undefined variables. ACM Southeast Regional Conference 1992: 182-187 - 1991
- [j2]Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Algorithms for recognition of regular properties and decomposition of recursive graph families. Ann. Oper. Res. 33(3): 125-149 (1991) - [j1]Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Deterministic Decomposition of Recursive Graph Classes. SIAM J. Discret. Math. 4(4): 481-501 (1991)
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-04-25 05:58 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:
