Craig A. Tovey
According to our database^{1},
Craig A. Tovey
authored at least 77 papers
between 1984 and 2017.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2017
Overview: Generalizations of MultiAgent Path Finding to RealWorld Scenarios.
CoRR, 2017
2016
On the uniqueness of the yolk.
Social Choice and Welfare, 2016
MultiAgent Path Finding with Payload Transfers and the PackageExchange RobotRouting Problem.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016
2015
The complexity of power indexes with graph restricted coalitions.
Math. Soc. Sci., 2015
Towards Completely Decentralized Mustering for StarCraft.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015
Probabilistic Copeland Tournaments.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015
Path Planning on Grids: The Effect of Vertex Placement on Path Length.
Proceedings of the Eleventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2015
2014
A Comparative Study of Procedures for the Multinomial Selection Problem.
Proceedings of the Essays in Production, 2014
A Model for Intransitive Preferences.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014
2011
Algorithms and complexity results for graphbased pursuit evasion.
Auton. Robots, 2011
Design Patterns and CrossDomain Analogies in Biologically Inspired Sustainable Design.
Proceedings of the Artificial Intelligence and Sustainable Design, 2011
2010
Localization: Approximation and Performance Bounds to Minimize Travel Distance.
IEEE Trans. Robotics, 2010
The probability of majority rule instability in the 2D euclidean model with an even number of voters.
Social Choice and Welfare, 2010
A finite exact algorithm for epsiloncore membership in two dimensions.
Math. Soc. Sci., 2010
A critique of distributional analysis in the spatial model.
Math. Soc. Sci., 2010
The almost surely shrinking yolk.
Math. Soc. Sci., 2010
The instability of instability of centered distributions.
Math. Soc. Sci., 2010
Approximation of the yolk by the LP yolk.
Math. Soc. Sci., 2010
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., 2010
ESP: pursuit evasion on seriesparallel graphs.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010
Lazy Theta*: AnyAngle Path Planning and Path Length Analysis in 3D.
Proceedings of the TwentyFourth AAAI Conference on Artificial Intelligence, 2010
Progress on Agent Coordination with Cooperative Auctions.
Proceedings of the TwentyFourth AAAI Conference on Artificial Intelligence, 2010
2009
A NearTight Approximation Algorithm for the Robot Localization Problem.
SIAM J. Comput., 2009
Smallest tournaments not realizable by \frac23majority voting.
Social Choice and Welfare, 2009
Algorithms and Complexity Results for PursuitEvasion Problems.
Proceedings of the IJCAI 2009, 2009
2008
Polarity and the complexity of the shooting experiment.
Discret. Optim., 2008
Solving problems on recursively constructed graphs.
ACM Comput. Surv., 2008
Agent Coordination with Regret Clearing.
Proceedings of the TwentyThird AAAI Conference on Artificial Intelligence, 2008
2007
Multirobot routing with rewards and disjoint time windows.
Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 29, 2007
Sequential BundleBid SingleSale Auction Algorithms for Decentralized Control.
Proceedings of the IJCAI 2007, 2007
2006
A neartight approximation lower bound and algorithm for the kidnapped robot problem.
Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithms, 2006
Improving Sequential SingleItem Auctions.
Proceedings of the 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2006
The Power of Sequential SingleItem Auctions for Agent Coordination.
Proceedings of the Proceedings, 2006
2005
Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic.
SIAM J. Discret. Math., 2005
Simple lifted cover inequalities and hard knapsack problems.
Discret. Optim., 2005
AuctionBased MultiRobot Routing.
Proceedings of the Robotics: Science and Systems I, 2005
2004
Nonapproximability of precedenceconstrained sequencing to minimize setups.
Discret. Appl. Math., 2004
On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers.
Adaptive Behaviour, 2004
Analysis of Greedy RobotNavigation Methods.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004
2003
Optimal Online Algorithms for Minimax Resource Scheduling.
SIAM J. Discret. Math., 2003
Performance bounds for planning in unknown terrain.
Artif. Intell., 2003
Improved analysis of greedy mapping.
Proceedings of the 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, Las Vegas, Nevada, USA, October 27, 2003
Improved analysis of D.
Proceedings of the 2003 IEEE International Conference on Robotics and Automation, 2003
Graphs in Computer Science.
Proceedings of the Handbook of Graph Theory., 2003
Graph Representation.
Proceedings of the Handbook of Graph Theory., 2003
2002
Analyzing the Multipletargetmultipleagent Scenario Using Optimal Assignment Algorithms.
J. Intell. Robotic Syst., 2002
Tutorial on Computational Complexity.
Interfaces, 2002
2001
Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results.
Comp. Opt. and Appl., 2001
Greedy localization.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2001
Greedy Mapping of Terrain.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001
2000
Gridworlds as Testbeds for Planning with Incomplete Information.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000
1999
Singleprobe traversal optimization for testing of MCM substrate interconnections.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1999
New Results on the Old kopt Algorithm for the Traveling Salesman Problem.
SIAM J. Comput., 1999
Online Resource Minimization.
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
1998
The complexity of cover inequality separation.
Oper. Res. Lett., 1998
1997
New Ramsey Bounds from Cyclic Graphs of Prime Order.
SIAM J. Discret. Math., 1997
1996
Circuit Partitioning Via Set Partitioning and Column Generation.
Oper. Res., 1996
Optimal single probe traversal algorithm for testing of MCM substrat.
Proceedings of the 1996 International Conference on Computer Design (ICCD '96), 1996
1994
New Results on the Old kOpt Algorithm for the TSP.
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms. 2325 January 1994, 1994
1993
Planar Ramsey Numbers.
J. Comb. Theory, Ser. B, 1993
Erratum: Local Optimization on Graphs.
Discret. Appl. Math., 1993
Dividing and Conquering the Square.
Discret. Appl. Math., 1993
1992
A polynomialtime algorithm for computing the yolk in fixed dimension.
Math. Program., 1992
When Is the Classroom Assignment Problem Hard?
Oper. Res., 1992
Automatic Generation of LinearTime Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families.
Algorithmica, 1992
1991
Erratum: The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods.
SIAM Review, 1991
The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods.
SIAM Review, 1991
Deterministic Decomposition of Recursive Graph Classes.
SIAM J. Discret. Math., 1991
Routing Printed Circuit Cards Through an Assembly Cell.
Oper. Res., 1991
Algorithms for recognition of regular properties and decomposition of recursive graph families.
Annals OR, 1991
1990
A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling.
SIAM J. Discret. Math., 1990
1989
Local optimization on graphs.
Discret. Appl. Math., 1989
1987
Multiple Optima in Local Search.
J. Algorithms, 1987
1986
Low order polynomial bounds on the expected performance of local improvement algorithms.
Math. Program., 1986
Affirmative action algorithms.
Math. Program., 1986
Layered Augmenting Path Algorithms.
Math. Oper. Res., 1986
1984
A simplified NPcomplete satisfiability problem.
Discret. Appl. Math., 1984