Richard B. Borie - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2011

Algorithms and complexity results for graph-based pursuit evasionRichard B. Borie, Craig A. Tovey, Sven Koenig. arobots, 31(4):317-332, 2011. [doi]

2010

ESP: pursuit evasion on series-parallel graphsKenny Daniel, Richard B. Borie, Sven Koenig, Craig A. Tovey. atal 2010: 1519-1520 [doi]

2009

Algorithms and Complexity Results for Pursuit-Evasion ProblemsRichard B. Borie, Craig A. Tovey, Sven Koenig. IJCAI 2009: 59-66 [doi]

2008

Solving problems on recursively constructed graphsRichard B. Borie, R. Gary Parker, Craig A. Tovey. ACM Comput. Surv., 41(1), 2008. [doi]

Agent Coordination with Regret ClearingSven Koenig, Xiaoming Zheng, Craig A. Tovey, Richard B. Borie, Philip Kilby, Vangelis Markakis, Pinar Keskinocak. AAAI 2008: 101-107

2003

Graph RepresentationAlfred V. Aho, Mark Goldberg, Josef Lauri, Richard B. Borie, R. Gary Parker, Craig A. Tovey. In Jonathan L. Gross, Jay Yellen, editors, Handbook of Graph Theory. Discrete Mathematics and Its Applications, pages 56-125, Chapman & Hall / Taylor & Francis, 2003. [doi]

Graphs in Computer ScienceHarold N. Gabow, Camil Demetrescu, Irene Finocchi, Guiseppe Francesco Italiano, Giuseppe Liotta, Roberto Tamassia, Richard B. Borie, R. Gary Parker, Craig A. Tovey. In Jonathan L. Gross, Jay Yellen, editors, Handbook of Graph Theory. Discrete Mathematics and Its Applications, pages 952-1073, Chapman & Hall / Taylor & Francis, 2003. [doi]

2000

On minimum cuts and the linear arrangement problemSteven B. Horton, R. Gary Parker, Richard B. Borie. DAM, 103(1-3):127-139, 2000.

Logic design programming assignments in a first-year courseD. J. Jackson, Russell L. Pimmel, Allen S. Parrish, Brandon Dixon, David Cordes, Richard B. Borie. cata 2000: 412-414

1999

Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear TimeRichard B. Borie, Jeremy Spinrad. DAM, 91(1-3):287-292, 1999. [doi]

1998

Computer Engineering, Computer Science and Management Information Systems: Partners in a Unified Software Engineering CurriculumAllen S. Parrish, Richard B. Borie, David W. Cordes, Brandon Dixon, David P. Hale, Joanne E. Hale, Jeff Jackson, Shane Sharpe. csee 1998: 67-75 [doi]

1996

Illustrating Client and Implementation Readability Tradeoffs in Ada and C++Allen S. Parrish, David Cordes, Richard B. Borie, S. Edara. SPE, 26(7):799-814, 1996.

1995

Generation of Polynomial-Time Algorithms for Some Optimization Problems on Tree-Decomposable GraphsRichard B. Borie. algorithmica, 14(2):123-137, 1995.

1993

Lock-and-key Strategies for Handling Undefined VariablesRichard B. Borie, Allen S. Parrish, Srinivas Mandyam. SPE, 23(7):693-710, 1993.

Automated flow graph-based testing of object-oriented software modulesAllen S. Parrish, Richard B. Borie, David W. Cordes. jss, 23(2):95-109, 1993. [doi]

Developmental testing of abstract data typesAllen S. Parrish, David Cordes, Richard B. Borie. compsac 1993: 49-55 [doi]

1992

Improving strategies for handling undefined variablesRichard B. Borie, Allen S. Parrish. ACMse 1992: 182-187 [doi]

Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph FamiliesRichard B. Borie, R. Gary Parker, Craig A. Tovey. algorithmica, 7(5&6):555-581, 1992.

1991

Algorithms for recognition of regular properties and decomposition of recursive graph familiesRichard B. Borie, R. Gary Parker, Craig A. Tovey. anor, 33(3):125-149, 1991. [doi]

Deterministic Decomposition of Recursive Graph ClassesRichard B. Borie, R. Gary Parker, Craig A. Tovey. siamdm, 4(4):481-501, 1991.

Sign in or sign up to see more results.

runs on WebDSL