# Craig A. Tovey - Publications

## Affiliations: | Georgia Institute of Technology, Atlanta, GA |

##### Area:

Computer ScienceYear | Citation | Score | |||
---|---|---|---|---|---|

2017 | Tankayev T, Tovey C. Optimal solution to the multinomial selection problem for two alternatives Sequential Analysis. 36: 415-432. DOI: 10.1080/07474946.2017.1360093 |
0.348 | |||

2015 | Benati S, Rizzi R, Tovey C. The complexity of power indexes with graph restricted coalitions Mathematical Social Sciences. 76: 53-63. DOI: 10.1016/J.Mathsocsci.2015.04.001 |
0.325 | |||

2011 | Borie R, Tovey C, Koenig S. Algorithms and complexity results for graph-based pursuit evasion Autonomous Robots. 31: 317-332. DOI: 10.1007/S10514-011-9255-Y |
0.377 | |||

2010 | Tovey C, Koenig S. Localization: Approximation and performance bounds to minimize travel distance Ieee Transactions On Robotics. 26: 320-330. DOI: 10.1109/Tro.2009.2039035 |
0.338 | |||

2010 | Bhadury J, Tovey CA. An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon International Journal of Computer Mathematics. 87: 244-259. DOI: 10.1080/00207160801965180 |
0.309 | |||

2010 | Tovey CA. The instability of instability of centered distributions Mathematical Social Sciences. 59: 53-73. DOI: 10.1016/J.Mathsocsci.2009.09.003 |
0.325 | |||

2009 | Koenig S, Mitchell JSB, Mudgal A, Tovey C. A Near-Tight Approximation Algorithm for the Robot Localization Problem Siam Journal On Computing. 39: 461-490. DOI: 10.1137/070682885 |
0.673 | |||

2009 | Shepardson D, Tovey CA. Smallest tournaments not realizable by 23-majority voting Social Choice and Welfare. 33: 495-503. DOI: 10.1007/S00355-009-0375-7 |
0.656 | |||

2008 | Borie RB, Parker RG, Tovey CA. Solving problems on recursively constructed graphs Acm Computing Surveys. 41. DOI: 10.1145/1456650.1456654 |
0.306 | |||

2007 | Nakrani S, Tovey C. From honeybees to Internet servers: biomimicry for distributed management of Internet hosting centers. Bioinspiration & Biomimetics. 2: S182-97. PMID 18037727 DOI: 10.1088/1748-3182/2/4/S07 |
0.323 | |||

2007 | Regnier E, Tovey C. Time horizons of environmental versus non-environmental costs: Evidence from US tort lawsuits Business Strategy and the Environment. 16: 249-265. DOI: 10.1002/Bse.494 |
0.634 | |||

2005 | Mudgal A, Tovey C, Greenberg S, Koenig S. Bounds on the travel cost of a Mars rover prototype search heuristic Siam Journal On Discrete Mathematics. 19: 431-447. DOI: 10.1137/S089548010444256X |
0.651 | |||

2004 | Nakrani S, Tovey C. On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers Adaptive Behavior. 12: 223-240. DOI: 10.1177/105971230401200308 |
0.305 | |||

2004 | Regnier E, Sharp G, Tovey C. Replacement under ongoing technological progress Iie Transactions (Institute of Industrial Engineers). 36: 497-508. DOI: 10.1080/07408170490438401 |
0.644 | |||

2004 | Tovey CA. Non-approximability of precedence-constrained sequencing to minimize setups Discrete Applied Mathematics. 134: 351-360. DOI: 10.1016/J.Dam.2003.08.006 |
0.342 | |||

2003 | Hunsaker B, Kleyweght AJ, Savelsbergh MWP, Tovey CA. Optimal online algorithms for minimax resource scheduling Siam Journal On Discrete Mathematics. 16: 555-590. DOI: 10.1137/S0895480101397761 |
0.341 | |||

2002 | Tovey CA. Tutorial on computational complexity Interfaces. 32: 30-61. DOI: 10.1287/Inte.32.3.30.39 |
0.321 | |||

2001 | Glockner GD, Nemhauser GL, Tovey CA. Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results Computational Optimization and Applications. 18: 233-250. DOI: 10.1023/A:1011233219223 |
0.316 | |||

1999 | Chandra B, Karloff H, Tovey C. New Results on the Old k-opt Algorithm for the Traveling Salesman Problem Siam Journal On Computing. 28: 1998-2029. DOI: 10.1137/S0097539793251244 |
0.324 | |||

1998 | Klabjan D, Nemhauser G, Tovey C. The complexity of cover inequality separation Operations Research Letters. 23: 35-40. DOI: 10.1016/S0167-6377(98)00025-X |
0.32 | |||

1997 | Calkin NJ, Erdös P, Tovey CA. New Ramsey bounds from cyclic graphs of prime order Siam Journal On Discrete Mathematics. 10: 381-387. DOI: 10.1137/S0895480196298378 |
0.315 | |||

1997 | Kwok KS, Driessen BJ, Phillips CA, Tovey CA. Analyzing the multiple-target-multiple-agent scenario using optimal assignment algorithms Proceedings of Spie - the International Society For Optical Engineering. 3209: 111-122. DOI: 10.1023/A:1020238115592 |
0.31 | |||

1997 | Ammons JC, Carlyle M, Cranmer L, DePuy G, Ellis K, McGinnis LF, Tovey CA, Xu H. Component allocation to balance workload in printed circuit card assembly systems Iie Transactions (Institute of Industrial Engineers). 29: 265-275. DOI: 10.1023/A:1018579430790 |
0.311 | |||

1993 | Llewellyn DC, Tovey CA. Dividing and conquering the square Discrete Applied Mathematics. 43: 131-153. DOI: 10.1016/0166-218X(93)90004-8 |
0.311 | |||

1992 | Carter MW, Tovey CA. When Is the Classroom Assignment Problem Hard? Operations Research. 40: S28-S39. DOI: 10.1287/Opre.40.1.S28 |
0.34 | |||

1992 | Schofield N, Tovey CA. Probability and convergence for supra-majority rule with Euclidean preferences Mathematical and Computer Modelling. 16: 41-58. DOI: 10.1016/0895-7177(92)90086-Z |
0.32 | |||

1992 | Borie RB, Parker RG, Tovey CA. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families Algorithmica. 7: 555-581. DOI: 10.1007/Bf01758777 |
0.372 | |||

1992 | Tovey CA. A polynomial-time algorithm for computing the yolk in fixed dimension Mathematical Programming. 57: 259-277. DOI: 10.1007/Bf01581084 |
0.345 | |||

1991 | Lofgren CB, McGinnis LF, Tovey CA. Routing Printed Circuit Cards Through an Assembly Cell Operations Research. 39: 992-1004. DOI: 10.1287/Opre.39.6.992 |
0.318 | |||

1991 | Borie RB, Parker RG, Tovey CA. Deterministic Dcomposition of Recursive Graph Classes Siam Journal On Discrete Mathematics. 4: 481-501. DOI: 10.1137/0404043 |
0.341 | |||

1991 | Borie R, Parker RG, Tovey CA. Algorithms for recognition of regular properties and decomposition of recursive graph families Annals of Operations Research. 33: 125-149. DOI: 10.1007/Bf02115752 |
0.341 | |||

1989 | Llewellyn DC, Tovey C, Trick M. Local optimization on graphs Discrete Applied Mathematics. 23: 157-178. DOI: 10.1016/0166-218X(89)90025-5 |
0.35 | |||

1988 | Tovey CA, Weiss G, Wilson JR. Minimum Spillage Sequencing Management Science. 34: 306-330. DOI: 10.1287/Mnsc.34.3.306 |
0.375 | |||

1986 | Fathi Y, Tovey C. Affirmative action algorithms Mathematical Programming. 34: 292-301. DOI: 10.1007/Bf01582232 |
0.322 | |||

1986 | Tovey CA. Low order polynomial bounds on the expected performance of local improvement algorithms Mathematical Programming. 35: 193-224. DOI: 10.1007/Bf01580647 |
0.39 | |||

1986 | Tovey CA. Rescheduling to minimize makespan on a changing number of identical processors Naval Research Logistics Quarterly. 33: 717-724. DOI: 10.1002/Nav.3800330414 |
0.345 | |||

1985 | Tovey CA. Hill Climbing with Multiple Local Optima Siam Journal On Algebraic Discrete Methods. 6: 384-393. DOI: 10.1137/0606040 |
0.36 | |||

1983 | Tovey CA. On the number of iterations of local improvement algorithms Operations Research Letters. 2: 231-238. DOI: 10.1016/0167-6377(83)90030-5 |
0.388 | |||

Show low-probability matches. |