Craig A. Tovey

According to our database1, Craig A. Tovey authored at least 75 papers between 1984 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
On the uniqueness of the yolk.
Social Choice and Welfare, 2016

Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
The complexity of power indexes with graph restricted coalitions.
Mathematical Social Sciences, 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 graph-based pursuit evasion.
Auton. Robots, 2011

Design Patterns and Cross-Domain 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 epsilon-core membership in two dimensions.
Mathematical Social Sciences, 2010

A critique of distributional analysis in the spatial model.
Mathematical Social Sciences, 2010

The almost surely shrinking yolk.
Mathematical Social Sciences, 2010

The instability of instability of centered distributions.
Mathematical Social Sciences, 2010

Approximation of the yolk by the LP yolk.
Mathematical Social Sciences, 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

Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

ESP: pursuit evasion on series-parallel graphs.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Progress on Agent Coordination with Cooperative Auctions.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
A Near-Tight Approximation Algorithm for the Robot Localization Problem.
SIAM J. Comput., 2009

Smallest tournaments not realizable by \frac23-majority voting.
Social Choice and Welfare, 2009

Algorithms and Complexity Results for Pursuit-Evasion Problems.
Proceedings of the IJCAI 2009, 2009

2008
Polarity and the complexity of the shooting experiment.
Discrete Optimization, 2008

Solving problems on recursively constructed graphs.
ACM Comput. Surv., 2008

Agent Coordination with Regret Clearing.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Multi-robot routing with rewards and disjoint time windows.
Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 29, 2007

Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control.
Proceedings of the IJCAI 2007, 2007

2006
A near-tight approximation lower bound and algorithm for the kidnapped robot problem.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Improving Sequential Single-Item Auctions.
Proceedings of the 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2006

The Power of Sequential Single-Item Auctions for Agent Coordination.
Proceedings of the Proceedings, 2006

2005
Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic.
SIAM J. Discrete Math., 2005

Simple lifted cover inequalities and hard knapsack problems.
Discrete Optimization, 2005

Auction-Based Multi-Robot Routing.
Proceedings of the Robotics: Science and Systems I, 2005

2004
Non-approximability of precedence-constrained sequencing to minimize setups.
Discrete Applied Mathematics, 2004

On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers.
Adaptive Behaviour, 2004

Analysis of Greedy Robot-Navigation Methods.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004

2003
Optimal Online Algorithms for Minimax Resource Scheduling.
SIAM J. Discrete 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

2002
Analyzing the Multiple-target-multiple-agent Scenario Using Optimal Assignment Algorithms.
Journal of Intelligent and Robotic Systems, 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
Single-probe traversal optimization for testing of MCM substrate interconnections.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1999

New Results on the Old k-opt Algorithm for the Traveling Salesman Problem.
SIAM J. Comput., 1999

Online Resource Minimization.
Proceedings of the Tenth Annual ACM-SIAM 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. Discrete Math., 1997

1996
Circuit Partitioning Via Set Partitioning and Column Generation.
Operations Research, 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 k-Opt Algorithm for the TSP.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
Planar Ramsey Numbers.
J. Comb. Theory, Ser. B, 1993

Erratum: Local Optimization on Graphs.
Discrete Applied Mathematics, 1993

Dividing and Conquering the Square.
Discrete Applied Mathematics, 1993

1992
A polynomial-time algorithm for computing the yolk in fixed dimension.
Math. Program., 1992

When Is the Classroom Assignment Problem Hard?
Operations Research, 1992

Automatic Generation of Linear-Time 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. Discrete Math., 1991

Routing Printed Circuit Cards Through an Assembly Cell.
Operations Research, 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. Discrete Math., 1990

1989
Local optimization on graphs.
Discrete Applied Mathematics, 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 NP-complete satisfiability problem.
Discrete Applied Mathematics, 1984


  Loading...