Tamon M. Stephen, Ph.D.
Affiliations: | 2002 | University of Michigan, Ann Arbor, Ann Arbor, MI |
Area:
MathematicsGoogle:
"Tamon Stephen"Parents
Sign in to add mentor| Alexandre I. Barvinok | grad student | 2002 | University of Michigan | |
| (The distribution of values in combinatorial optimization problems.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Borgwardt S, Stephen T, Yusun T. (2018) On the Circuit Diameter Conjecture Discrete and Computational Geometry. 60: 558-587 |
| Woods BD, Punnen AP, Stephen T. (2017) A linear time algorithm for the 3-neighbour Travelling Salesman Problem on a Halin graph and extensions Discrete Optimization. 26: 163-182 |
| Stephen T, Yusun T. (2015) The Circuit Diameter of the Klee-Walkup Polyhedron Electronic Notes in Discrete Mathematics. 49: 505-512 |
| Deza A, Stephen T, Xie F. (2013) A note on lower bounds for colourful simplicial depth Symmetry. 5: 47-53 |
| Malekesmaeili M, Chauve C, Stephen T. (2012) A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix Information Processing Letters. 112: 799-803 |
| Santos F, Stephen T, Thomas H. (2012) Embedding a Pair of Graphs in a Surface, and the Width of 4-dimensional Prismatoids Discrete and Computational Geometry. 47: 569-576 |
| Deza A, Stephen T, Xie F. (2011) More Colourful Simplices Discrete and Computational Geometry. 45: 272-278 |
| Chauve C, Haus U, Stephen T, et al. (2010) Minimal conflicting sets for the consecutive ones property in ancestral genome reconstruction. Journal of Computational Biology. 17: 1167-1181 |
| Stephen T, Thomas H. (2008) A quadratic lower bound for colourful simplicial depth Journal of Combinatorial Optimization. 16: 324-327 |
| Stephen T. (2007) A Majorization Bound for the Eigenvalues of Some Graph Laplacians Siam Journal On Discrete Mathematics. 21: 303-312 |