Tom Coleman

According to our database, Tom Coleman authored at least 7 papers between 1998 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

IT-Led Process Reengineering: How Sloan Valve Redesigned its New Product Development Process.

Balaji Sankaranarayanan, Chandrasekaran Ranganathan, Tom Coleman

MIS Q. Executive, 2011

2010

A Polynomial Time Approximation Scheme for k-Consensus Clustering.

Tom Coleman, Anthony Wirth

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Ranking tournaments: Local search and a new algorithm.

Tom Coleman, Anthony Wirth

ACM J. Exp. Algorithmics, 2009

2008

Spectral clustering with inconsistent advice.

Tom Coleman, James Saunderson, Anthony Wirth

Proceedings of the Machine Learning, 2008

A Local-Search 2-Approximation for 2-Correlation-Clustering.

Tom Coleman, James Saunderson, Anthony Wirth

Proceedings of the Algorithms, 2008

2007

On The Complexity of Manipulating Elections.

Tom Coleman, Vanessa Teague

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

1998

Would-Be Worlds. How Simulation Is Changing The Frontiers Of Science By John L. Casti, John Wiley and Sons, New York, 242 Pages.

Tom Coleman

Simul., 1998