default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCraig A. Tovey
Person information
- affiliation: Georgia Institute of Technology, Atlanta, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j51]Brady Hunsaker, Craig A. Tovey:
Easy and hard separation of sparse and dense odd-set constraints in matching. Discret. Optim. 54: 100849 (2024)- [c29]James P. Bailey, Craig A. Tovey:
Impact of Tie-Breaking on the Manipulability of Elections. AAMAS 2024: 105-113 - 2023
- [j50]Zéphirin Nganmeni
, Craig A. Tovey:
The finagle point is close to the yolk. Oper. Res. Lett. 51(5): 501-506 (2023) - 2021
- [j49]James P. Bailey, Alex Nash, Craig A. Tovey, Sven Koenig:
Path-length analysis for grid-based path planning. Artif. Intell. 301: 103560 (2021) - [j48]Mathieu Martin, Zéphirin Nganmeni, Craig A. Tovey:
Dominance in spatial voting with imprecise ideals. Soc. Choice Welf. 57(1): 181-195 (2021) - [i2]James P. Bailey, Craig A. Tovey:
Conditions for Stability in Strategic Matching. CoRR abs/2108.04381 (2021)
2010 – 2019
- 2017
- [i1]Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hönig, T. K. Satish Kumar, Tansel Uras, Hong Xu, Craig A. Tovey, Guni Sharon:
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios. CoRR abs/1702.05515 (2017) - 2016
- [j47]Mathieu Martin, Zéphirin Nganmeni, Craig A. Tovey:
On the uniqueness of the yolk. Soc. Choice Welf. 47(3): 511-518 (2016) - [c28]Hang Ma, Craig A. Tovey, Guni Sharon, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem. AAAI 2016: 3166-3173 - 2015
- [j46]Stefano Benati, Romeo Rizzi, Craig A. Tovey:
The complexity of power indexes with graph restricted coalitions. Math. Soc. Sci. 76: 53-63 (2015) - [c27]James P. Bailey, Craig A. Tovey, Tansel Uras, Sven Koenig, Alex Nash:
Path Planning on Grids: The Effect of Vertex Placement on Path Length. AIIDE 2015: 108-114 - [c26]Zachary Suffern, Craig A. Tovey, Sven Koenig:
Towards Completely Decentralized Mustering for StarCraft. AAMAS 2015: 1757-1758 - [c25]Sam Saarinen, Judy Goldsmith, Craig A. Tovey:
Probabilistic Copeland Tournaments. AAMAS 2015: 1851-1852 - 2014
- [c24]Sam Saarinen, Craig A. Tovey, Judy Goldsmith:
A Model for Intransitive Preferences. MPREF@AAAI 2014 - [c23]Eric S. Tollefson, David Goldsman, Anton J. Kleywegt, Craig A. Tovey:
A Comparative Study of Procedures for the Multinomial Selection Problem. Essays in Production, Project Planning and Scheduling 2014: 123-160 - 2011
- [j45]Richard B. Borie, Craig A. Tovey, Sven Koenig:
Algorithms and complexity results for graph-based pursuit evasion. Auton. Robots 31(4): 317-332 (2011) - [c22]Ashok K. Goel, Bert Bras, Michael E. Helms, Spencer Rugaber, Craig A. Tovey, Swaroop Vattam, Marc J. Weissburg, Bryan Wiltgen, Jeannette Yen:
Design Patterns and Cross-Domain Analogies in Biologically Inspired Sustainable Design. AAAI Spring Symposium: Artificial Intelligence and Sustainable Design 2011 - 2010
- [j44]Joy Bhadury, Craig A. Tovey:
An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon. Int. J. Comput. Math. 87(2): 244-259 (2010) - [j43]Craig A. Tovey:
The instability of instability of centered distributions. Math. Soc. Sci. 59(1): 53-73 (2010) - [j42]Craig A. Tovey:
The almost surely shrinking yolk. Math. Soc. Sci. 59(1): 74-87 (2010) - [j41]Craig A. Tovey:
A critique of distributional analysis in the spatial model. Math. Soc. Sci. 59(1): 88-101 (2010) - [j40]Richard D. McKelvey, Craig A. Tovey:
Approximation of the yolk by the LP yolk. Math. Soc. Sci. 59(1): 102-109 (2010) - [j39]Craig A. Tovey:
A finite exact algorithm for epsilon-core membership in two dimensions. Math. Soc. Sci. 60(3): 178-180 (2010) - [j38]Craig A. Tovey:
The probability of majority rule instability in the 2D euclidean model with an even number of voters. Soc. Choice Welf. 35(4): 705-708 (2010) - [j37]Craig A. Tovey, Sven Koenig:
Localization: Approximation and Performance Bounds to Minimize Travel Distance. IEEE Trans. Robotics 26(2): 320-330 (2010) - [c21]Alex Nash, Sven Koenig, Craig A. Tovey:
Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D. AAAI 2010: 147-154 - [c20]Sven Koenig, Pinar Keskinocak, Craig A. Tovey:
Progress on Agent Coordination with Cooperative Auctions. AAAI 2010: 1713-1717 - [c19]Kenny Daniel, Richard B. Borie, Sven Koenig, Craig A. Tovey:
ESP: pursuit evasion on series-parallel graphs. AAMAS 2010: 1519-1520 - [c18]Alex Nash, Sven Koenig, Craig A. Tovey:
Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D. SOCS 2010: 153-154
2000 – 2009
- 2009
- [j36]Dylan Shepardson, Craig A. Tovey:
Smallest tournaments not realizable by \frac23-majority voting. Soc. Choice Welf. 33(3): 495-503 (2009) - [j35]Sven Koenig, Joseph S. B. Mitchell, Apurva Mudgal, Craig A. Tovey:
A Near-Tight Approximation Algorithm for the Robot Localization Problem. SIAM J. Comput. 39(2): 461-490 (2009) - [c17]Richard B. Borie, Craig A. Tovey, Sven Koenig:
Algorithms and Complexity Results for Pursuit-Evasion Problems. IJCAI 2009: 59-66 - 2008
- [j34]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) - [j33]Brady Hunsaker, Ellis L. Johnson, Craig A. Tovey:
Polarity and the complexity of the shooting experiment. Discret. Optim. 5(2): 541-549 (2008) - [c16]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 - 2007
- [c15]Sven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz Sungur:
Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control. IJCAI 2007: 1359-1365 - [c14]Justin Melvin, Pinar Keskinocak, Sven Koenig, Craig A. Tovey, Banu Yuksel Ozkaya:
Multi-robot routing with rewards and disjoint time windows. IROS 2007: 2332-2337 - 2006
- [c13]Sven Koenig, Craig A. Tovey, Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Adam Meyerson, Sonal Jain:
The Power of Sequential Single-Item Auctions for Agent Coordination. AAAI 2006: 1625-1629 - [c12]Xiaoming Zheng, Sven Koenig, Craig A. Tovey:
Improving Sequential Single-Item Auctions. IROS 2006: 2238-2244 - [c11]Sven Koenig, Apurva Mudgal, Craig A. Tovey:
A near-tight approximation lower bound and algorithm for the kidnapped robot problem. SODA 2006: 133-142 - 2005
- [j32]Brady Hunsaker, Craig A. Tovey:
Simple lifted cover inequalities and hard knapsack problems. Discret. Optim. 2(3): 219-228 (2005) - [j31]Apurva Mudgal, Craig A. Tovey, Sam Greenberg, Sven Koenig:
Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic. SIAM J. Discret. Math. 19(2): 431-447 (2005) - [c10]Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Sven Koenig, Craig A. Tovey, Adam Meyerson, Sonal Jain:
Auction-Based Multi-Robot Routing. Robotics: Science and Systems 2005: 343-350 - 2004
- [j30]Sunil Nakrani, Craig A. Tovey:
On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers. Adapt. Behav. 12(3-4): 223-240 (2004) - [j29]Craig A. Tovey:
Non-approximability of precedence-constrained sequencing to minimize setups. Discret. Appl. Math. 134(1-3): 351-360 (2004) - [c9]Apurva Mudgal, Craig A. Tovey, Sven Koenig:
Analysis of Greedy Robot-Navigation Methods. AI&M 2004 - 2003
- [j28]Sven Koenig, Craig A. Tovey, Yury V. Smirnov:
Performance bounds for planning in unknown terrain. Artif. Intell. 147(1-2): 253-279 (2003) - [j27]Brady Hunsaker, Anton J. Kleywegt, Martin W. P. Savelsbergh, Craig A. Tovey:
Optimal Online Algorithms for Minimax Resource Scheduling. SIAM J. Discret. Math. 16(4): 555-590 (2003) - [c8]Craig A. Tovey, Sam Greenberg, Sven Koenig:
Improved analysis of D. ICRA 2003: 3371-3378 - [c7]Craig A. Tovey, Sven Koenig:
Improved analysis of greedy mapping. IROS 2003: 3251-3257 - [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 - 2002
- [j26]Craig A. Tovey:
Tutorial on Computational Complexity. Interfaces 32(3): 30-61 (2002) - [j25]Kwan S. Kwok, Brian J. Driessen, Cynthia A. Phillips, Craig A. Tovey:
Analyzing the Multiple-target-multiple-agent Scenario Using Optimal Assignment Algorithms. J. Intell. Robotic Syst. 35(1): 111-122 (2002) - 2001
- [j24]Gregory D. Glockner, George L. Nemhauser, Craig A. Tovey:
Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results. Comput. Optim. Appl. 18(3): 233-250 (2001) - [c6]Sven Koenig, Craig A. Tovey, William Halliburton:
Greedy Mapping of Terrain. ICRA 2001: 3594-3599 - [c5]Craig A. Tovey, Sven Koenig:
Greedy localization. IROS 2001: 427-432 - 2000
- [c4]Craig A. Tovey, Sven Koenig:
Gridworlds as Testbeds for Planning with Incomplete Information. AAAI/IAAI 2000: 819-824
1990 – 1999
- 1999
- [j23]Barun Chandra, Howard J. Karloff, Craig A. Tovey:
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem. SIAM J. Comput. 28(6): 1998-2029 (1999) - [j22]Rajesh Pendurkar, Craig A. Tovey, Abhijit Chatterjee:
Single-probe traversal optimization for testing of MCM substrate interconnections. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(8): 1178-1191 (1999) - [c3]Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Savelsbergh, Craig A. Tovey:
Online Resource Minimization. SODA 1999: 576-585 - 1998
- [j21]Diego Klabjan, George L. Nemhauser, Craig A. Tovey:
The complexity of cover inequality separation. Oper. Res. Lett. 23(1-2): 35-40 (1998) - 1997
- [j20]Neil J. Calkin, Paul Erdös, Craig A. Tovey:
New Ramsey Bounds from Cyclic Graphs of Prime Order. SIAM J. Discret. Math. 10(3): 381-387 (1997) - 1996
- [j19]Moshe Eben-Chaime, Craig A. Tovey, Jane C. Ammons:
Circuit Partitioning Via Set Partitioning and Column Generation. Oper. Res. 44(1): 65-76 (1996) - [c2]Rajesh Pendurkar, Abhijit Chatterjee, Craig A. Tovey:
Optimal single probe traversal algorithm for testing of MCM substrat. ICCD 1996: 396-401 - 1994
- [c1]Barun Chandra, Howard J. Karloff, Craig A. Tovey:
New Results on the Old k-Opt Algorithm for the TSP. SODA 1994: 150-159 - 1993
- [j18]Donna Crystal Llewellyn, Craig A. Tovey:
Dividing and Conquering the Square. Discret. Appl. Math. 43(2): 131-153 (1993) - [j17]Donna Crystal Llewellyn, Craig A. Tovey, Michael A. Trick:
Erratum: Local Optimization on Graphs. Discret. Appl. Math. 46(1): 93-94 (1993) - [j16]Richard Steinberg, Craig A. Tovey:
Planar Ramsey Numbers. J. Comb. Theory B 59(2): 288-296 (1993) - 1992
- [j15]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) - [j14]Michael W. Carter, Craig A. Tovey:
When Is the Classroom Assignment Problem Hard? Oper. Res. 40(Supplement-1): S28-S39 (1992) - [j13]Craig A. Tovey:
A polynomial-time algorithm for computing the yolk in fixed dimension. Math. Program. 57: 259-277 (1992) - 1991
- [j12]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) - [j11]Christopher B. Lofgren, Leon F. McGinnis, Craig A. Tovey:
Routing Printed Circuit Cards Through an Assembly Cell. Oper. Res. 39(6): 992-1004 (1991) - [j10]Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Deterministic Decomposition of Recursive Graph Classes. SIAM J. Discret. Math. 4(4): 481-501 (1991) - [j9]Richard E. Stone, Craig A. Tovey:
The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods. SIAM Rev. 33(2): 220-237 (1991) - [j8]Richard E. Stone, Craig A. Tovey:
Erratum: The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods. SIAM Rev. 33(3): 461 (1991) - 1990
- [j7]Craig A. Tovey:
A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling. SIAM J. Discret. Math. 3(4): 582-584 (1990)
1980 – 1989
- 1989
- [j6]Donna Crystal Llewellyn, Craig A. Tovey, Michael A. Trick:
Local optimization on graphs. Discret. Appl. Math. 23(2): 157-178 (1989) - 1987
- [j5]Vojtech Rödl, Craig A. Tovey:
Multiple Optima in Local Search. J. Algorithms 8(2): 250-259 (1987) - 1986
- [j4]Éva Tardos, Craig A. Tovey, Michael A. Trick:
Layered Augmenting Path Algorithms. Math. Oper. Res. 11(2): 362-370 (1986) - [j3]Yahya Fathi, Craig A. Tovey:
Affirmative action algorithms. Math. Program. 34(3): 292-301 (1986) - [j2]Craig A. Tovey:
Low order polynomial bounds on the expected performance of local improvement algorithms. Math. Program. 35(2): 193-224 (1986) - 1984
- [j1]Craig A. Tovey:
A simplified NP-complete satisfiability problem. Discret. Appl. Math. 8(1): 85-89 (1984)
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-10-07 22:08 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:
