If you would like a copy of a paper that has not been posted, please e-mail me at: tamon at sfu ca. All articles on this page are copyright.

Journal Articles

Computing Colourful Simplicial Depth and Median in R2 (with Greg Aloupis and Olga Zasenko).
Submitted. pdf

On the Circuit Diameter Conjecture (with Steffen Borgwardt and Timothy Yusun).
Discrete and Computational Geometry, to appear. pdf

A Linear Time Algorithm for the 3-Neighbour Travelling Salesman Problem on Halin Graphs and Extensions (Brad Woods, Abraham Punnen and TS).
Discrete Optimization 26 (2017) 163-182. pdf2

Counting Inequivalent Monotone Boolean Functions (with Timothy Yusun).
Discrete Applied Mathematics, 167 (2014) no.1, 15-24. pdf2

A Note on Lower Bounds for Colourful Simplicial Depth (with Antoine Deza and Feng Xie).
Symmetry, 5 (2013) no. 1, 47-52. link

A Tight Bound on the Length of Odd Cycles in the Incompatibility Graph of a non-C1P Matrix (Mehrnoush Malekesmaeili, Cedric Chauve and TS).
Information Processing Letters, 112 (2012) no.20, 799-803. pdf2

Embedding a Pair of Graphs in a Surface, and the Width of 4-dimensional Prismatoids (with Francisco Santos and Hugh Thomas).
Discrete and Computational Geometry, 47 (2012) no.3, 569-576. pdf1

More Colourful Simplices (with Antoine Deza and Feng Xie).
Discrete and Computational Geometry, 45 (2011) no.2, 272-278. ps pdf1

Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction (with Cedric Chauve, Utz-Uwe Haus and Vivija You).
Journal of Computational Biology, 17 (2010) no.9, 1167-1181. link

A Quadratic Lower Bound for Colourful Simplicial Depth (with Hugh Thomas).
Journal of Combinatorial Optimization, 16 (2008) no.4, 324-327. ps pdf1

Computing Knock out Strategies in Metabolic Networks (with Utz-Uwe Haus and Steffen Klamt).
Journal of Computational Biology, 15 (2008) no.3, 259-268. link

The Colourful Feasibility Problem (with Antoine Deza, Sui Huang and Tamás Terlaky).
Discrete Applied Mathematics, 156 (2008) no.11, 2166-2177. ps pdf2

A Majorization Bound for the Eigenvalues of some Graph Laplacians.
SIAM Journal on Discrete Mathematics, 21 (2007) no.2, 303-312. pdf3

Colourful Simplicial Depth (with Antoine Deza, Sui Huang and Tamás Terlaky).
Discrete and Computational Geometry, 35 (2006) no.4, 597-615. ps pdf1

The Distribution of Values in the Quadratic Assignment Problem (with Alexander Barvinok).
Mathematics of Operations Research, 28 (2003) no.1, 64-91. ps pdf

On a Representation of the Matching Polytope via Semidefinite Liftings (with Levent Tunçel).
Mathematics of Operations Research, 24 (1999) no.1, 1-7. ps pdf

Chapters in books

Expected Crossing Numbers (with Bojan Mohar).
In: K. Bezdek, A. Deza and Y. Ye, editors, Discrete Geometry and Optimization,
Fields Institute Communications 69, pp. 191-211, Springer, New York, 2013. pdf1

On The Distribution of Values in the Quadratic Assignment Problem (with Alexander Barvinok).
In: P.M. Pardalos and H. Wolkowicz, editors, Novel Approaches to Hard Discrete Optimization,
Fields Institute Communications 37, pp. 1-16, Amer. Math. Soc., Providence, RI, 2003.

Conference Proceedings

A Duality-Based Method for Identifying Elemental Balance Violations in Metabolic Network Models (Hooman Zabeti, TS, Bonnie Berger and Leonid Chindelevitch).
In: L. Parida and E. Ukkonen, editors, Proceedings of the 18th International Workshop on Algorithms in Bioinformatics (WABI 2018),
Leibniz International Proceedings in Informatics (LIPIcs) 113, Dagstuhl, Germany 1:1-1:13. link

Speeding up Dualization in the Fredman-Khachiyan Algorithm B (Nafiseh Sedaghat, TS and Leonid Chindelevitch).
In: G. D'Angelo, editor, Proceedings of the 17th International Symposium on Experimental Algorithms (SEA 2018),
Leibniz International Proceedings in Informatics (LIPIcs) 103, Dagstuhl, Germany 6:1-6:13. link

Algorithms for Colourful Simplicial Depth and Medians in the Plane (Olga Zasenko and TS).
In: T.-H. H. Chan, M. Li and L. Wang, editors, Proceedings of Combinatorial Optimization and Applications (COCOA),
Lecture Notes in Computer Science (LNCS) 10043, Springer, Berlin (2016) 378-392. pdf1

The Circuit Diameter of the Klee-Walkup Polyhedron (with Timothy Yusun).
In: J. Nesetril, O. Serra and J. A. Telle, editors, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications 2015,
Electronic Notes in Discrete Mathematics (ENDM), Elsevier 49 (2015) 505-512. pdf2

Expected Crossing Numbers (with Bojan Mohar).
In: J. Nesetril and E. Gyori and A. Sali, editors, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications 2011,
Electronic Notes in Discrete Mathematics (ENDM), Elsevier 38 (2011) 651-656. pdf2

Small Octahedral Systems (with Grant Custard, Antoine Deza and Feng Xie).
In: G. Aloupis and D. Bremner, editors, Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG2011),
Toronto (2011) 267-272. ps pdf

Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction (with Cedric Chauve, Utz-Uwe Haus and Vivija You).
In: F. D. Ciccarelli and I. Miklós, editors, Proceedings of the Comparative Genomics International Workshop RECOMB-CG 2009,
Lecture Notes in Computer Science (LNCS) 5817, Springer, Berlin (2009) 48-58. ps pdf1
Note: Some experimental results were mistranscribed, please refer instead to the journal version.

On the Grone-Merris Conjecture.
In: S. Felsner, editor, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications 2005,
Discrete Math and Theoretical Computer Science AE (2005) 187-192. link

The Distribution of Values in the Quadratic Assignment Problem (with Alexander Barvinok).
In: W.J. Cook and A.S. Schulz, editors, Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization,
Lecture Notes in Computer Science (LNCS) 2337, Springer, Berlin (2002) 367-383.

Ph.D. Thesis

The Distribution of Values in Combinatorial Optimization Problems, University of Michigan, 2002. ps pdf

Footnotes:
  1 The final publication is available at http://link.springer.com/. See DHST06, ST08, CHSY09, DSX11 SST12, BS13, and ZS16.
  2 This is the author's version of a work that was accepted for publication. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete Applied Mathematics for DHST08 and SY14; Discrete Optimization for WPS17; Electronic Notes in Discrete Mathematics for MS11 and SY15; and Information Processing Letters for MCS12.
Incidentally, there are some good reasons to avoid Elsevier as a publisher, although I'm ambivalent enough that I haven't yet joined the boycott.

  3 The copyright for this article is held by SIAM, the Society for Industrial and Applied Mathematics.

Back to Tamon Stephen's homepage.
Last modified August 2018.