On a Representation of the Matching Polytope Via Semidefinite Liftings. - Tamon Stephen; Levent Tunçel (Math. Oper. Res., 1999)

The Distribution of Values in the Quadratic Assignment Problem. - Alexander I. Barvinok; Tamon Stephen (Math. Oper. Res., 2003)

Colourful Simplicial Depth. - Antoine Deza; Sui Huang; Tamon Stephen; Tamás Terlaky (Discret. Comput. Geom., 2006)

A Majorization Bound for the Eigenvalues of Some Graph Laplacians. - Tamon Stephen (SIAM J. Discret. Math., 2007)

The colourful feasibility problem. - Antoine Deza; Sui Huang; Tamon Stephen; Tamás Terlaky (Discret. Appl. Math., 2008)

Computing Knock-Out Strategies in Metabolic Networks. - Utz-Uwe Haus; Steffen Klamt; Tamon Stephen (J. Comput. Biol., 2008)

A quadratic lower bound for colourful simplicial depth. - Tamon Stephen; Hugh Thomas (J. Comb. Optim., 2008)

Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction. - Cédric Chauve; Utz-Uwe Haus; Tamon Stephen; Vivija P. You (J. Comput. Biol., 2010)

Small Octahedral Systems. - Grant Custard; Antoine Deza; Tamon Stephen; Feng Xie 007 (CCCG, 2011)

More Colourful Simplices. - Antoine Deza; Tamon Stephen; Feng Xie 007 (Discret. Comput. Geom., 2011)

Expected Crossing Numbers. - Bojan Mohar; Tamon Stephen (Electron. Notes Discret. Math., 2011)

Computational Lower Bounds for Colourful Simplicial Depth - Antoine Deza; Tamon Stephen; Feng Xie 007 (CoRR, 2012)

Embedding a Pair of Graphs in a Surface, and the Width of 4-dimensional Prismatoids. - Francisco Santos; Tamon Stephen; Hugh Thomas (Discret. Comput. Geom., 2012)

A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix. - Mehrnoush Malekesmaeili; Cédric Chauve; Tamon Stephen (Inf. Process. Lett., 2012)

A Note on Lower Bounds for Colourful Simplicial Depth. - Antoine Deza; Tamon Stephen; Feng Xie 007 (Symmetry, 2013)

Counting inequivalent monotone Boolean functions. - Tamon Stephen; Timothy Yusun (Discret. Appl. Math., 2014)

Circuit diameter and Klee-Walkup constructions. - Tamon Stephen; Timothy Yusun (CoRR, 2015)

A Linear Time Algorithm for the $3$-Neighbour Traveling Salesman Problem on Halin graphs and extensions. - Brad D. Woods; Abraham P. Punnen; Tamon Stephen (CoRR, 2015)

The Circuit Diameter of the Klee-Walkup Polyhedron. - Tamon Stephen; Timothy Yusun (Electron. Notes Discret. Math., 2015)

Algorithms for Colourful Simplicial Depth and Medians in the Plane. - Olga Zasenko; Tamon Stephen (COCOA, 2016)

A linear time algorithm for the -neighbour Travelling Salesman Problem on a Halin graph and extensions. - Brad D. Woods; Abraham P. Punnen; Tamon Stephen (Discret. Optim., 2017)

A Duality-Based Method for Identifying Elemental Balance Violations in Metabolic Network Models. - Hooman Zabeti; Tamon Stephen; Bonnie Berger; Leonid Chindelevitch (WABI, 2018)

Speeding up Dualization in the Fredman-Khachiyan Algorithm B. - Nafiseh Sedaghat; Tamon Stephen; Leonid Chindelevitch (SEA, 2018)

On the Circuit Diameter Conjecture. - Steffen Borgwardt; Tamon Stephen; Timothy Yusun (Discret. Comput. Geom., 2018)

MCS2: minimal coordinated supports for fast enumeration of minimal cut sets in metabolic networks. - Reza Miraskarshahi; Hooman Zabeti; Tamon Stephen; Leonid Chindelevitch (Bioinform., 2019)

The Bipartite Boolean Quadric Polytope. - Piyashat Sripratak; Abraham P. Punnen; Tamon Stephen (Discret. Optim., 2022)

Computing Colourful Simplicial Depth and Median in ℝ2. - Greg Aloupis; Tamon Stephen; Olga Zasenko (Theory Comput. Syst., 2022)

Speeding Up the Structural Analysis of Metabolic Network Models Using the Fredman-Khachiyan Algorithm B. - Nafiseh Sedaghat; Tamon Stephen; Leonid Chindelevitch (J. Comput. Biol., 2023)