Tamon Stephen
Tamon Stephen
Associate Professor of Mathematics, Simon Fraser University
Verifisert e-postadresse på sfu.ca - Startside
Tittel
Sitert av
Sitert av
År
Computing knock-out strategies in metabolic networks
UU Haus, S Klamt, T Stephen
Journal of Computational Biology 15 (3), 259-268, 2008
902008
On a representation of the matching polytope via semidefinite liftings
T Stephen, L Tunçel
Mathematics of Operations Research 24 (1), 1-7, 1999
741999
Colourful simplicial depth
A Deza, S Huang, T Stephen, T Terlaky
Discrete & Computational Geometry 35 (4), 597-615, 2006
312006
Counting inequivalent monotone boolean functions
T Stephen, T Yusun
Discrete Applied Mathematics 167, 15-24, 2014
252014
Minimal Conflicting Sets for the Consecutive Ones Property in ancestral genome reconstruction
C Chauve, UU Haus, T Stephen, VP You
Journal of Computational Biology 17 (9), 1167-1181, 2010
252010
Minimal conflicting sets for the consecutive ones property in ancestral genome reconstruction
C Chauve, UU Haus, T Stephen, VP You
Comparative Genomics, 48-58, 2009
252009
A quadratic lower bound for colourful simplicial depth
T Stephen, H Thomas
Journal of combinatorial optimization 16 (4), 324-327, 2008
192008
The colourful feasibility problem
A Deza, S Huang, T Stephen, T Terlaky
Discrete Applied Mathematics 156 (11), 2166-2177, 2008
182008
The distribution of values in the quadratic assignment problem
A Barvinok, T Stephen
Mathematics of Operations Research 28 (1), 64-91, 2003
182003
More colourful simplices
A Deza, T Stephen, F Xie
Discrete & Computational Geometry 45 (2), 272-278, 2011
152011
A linear time algorithm for the 3-neighbour Travelling Salesman Problem on a Halin graph and extensions
B Woods, A Punnen, T Stephen
Discrete optimization 26, 163-182, 2017
112017
A Majorization bound for the eigenvalues of some graph Laplacians
T Stephen
SIAM Journal on Discrete Mathematics 21 (2), 303-312, 2007
92007
Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids
F Santos, T Stephen, H Thomas
Discrete & Computational Geometry 47 (3), 569-576, 2012
82012
Small Octahedral Systems.
G Custard, A Deza, T Stephen, F Xie
CCCG, 2011
82011
Expected crossing numbers
B Mohar, T Stephen
Electronic Notes in Discrete Mathematics 38, 651-656, 2011
72011
CL-JOINTGEN: a common lisp implementation of the joint generation method
UU Haus, T Stephen
62008
On the circuit diameter conjecture
S Borgwardt, T Stephen, T Yusun
Discrete & Computational Geometry 60 (3), 558-587, 2018
52018
Circuit diameter and Klee-Walkup constructions
T Stephen, T Yusun
arXiv preprint arXiv:1503.05252, 2015
5*2015
MCS^ 2: Minimal coordinated supports for fast enumeration of minimal cut sets in metabolic networks
R Miraskarshahi, H Zabeti, T Stephen, L Chindelevitch
bioRxiv, 471250, 2018
42018
The Circuit Diameter of the Klee-Walkup Polyhedron
T Stephen, T Yusun
Electronic Notes in Discrete Mathematics 49, 505-512, 2015
42015
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–20