Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Tamon Stephen
Observed name:
Stephen, Tamon
Institution:
Simon Fraser University
Observed institutions:
University of Minnesota,
University of Waterloo,
Simon Fraser University,
University of Michigan,
McMaster University
ORCID:
0000-0003-0156-7415
Observed ORCID:
0000-0003-0156-7415
OpenAlex ID:
A5043510929
Computing Knock-Out Strategies in Metabolic Networks
2008
·
Utz-Uwe Haus
, Steffen Klamt
, et al.
·
Journal of Computational Biology
·
78
PDF
On a Representation of the Matching Polytope Via Semidefinite Liftings
1999
·
Tamon Stephen
, Levent Tunçel
·
Mathematics of Operations Research
·
54
Counting inequivalent monotone Boolean functions
2013
·
Tamon Stephen
, Timothy Yusun
·
Discrete Applied Mathematics
·
29
PDF
Colourful Simplicial Depth
2006
·
Antoine Deza
, Sui Huang
, et al.
·
Discrete & Computational Geometry
·
27
PDF
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
2010
·
Cedric Chauve
, Utz-Uwe Haus
, et al.
·
Journal of Computational Biology
·
20
PDF
A quadratic lower bound for colourful simplicial depth
2008
·
Tamon Stephen
, Hugh Thomas
·
Journal of Combinatorial Optimization
·
19
PDF
The colourful feasibility problem
2008
·
Antoine Deza
, Sui Huang
, et al.
·
Discrete Applied Mathematics
·
19
The Distribution of Values in the Quadratic Assignment Problem
2003
·
Alexander Barvinok
, Tamon Stephen
·
Mathematics of Operations Research
·
18
On the Circuit Diameter Conjecture
2018
·
Steffen Borgwardt
, Tamon Stephen
, et al.
·
Discrete & Computational Geometry
·
11
PDF
Optimising nurse schedules at a community health centre
2021
·
Samantha L. Zimmerman
, Alan Bi
, et al.
·
Operations Research for Health Care
·
10
More Colourful Simplices
2010
·
Antoine Deza
, Tamon Stephen
, et al.
·
Discrete & Computational Geometry
·
10
PDF
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
2009
·
Cedric Chauve
, Utz-Uwe Haus
, et al.
·
Lecture notes in computer science
·
9
MCS2: minimal coordinated supports for fast enumeration of minimal cut sets in metabolic networks
2019
·
Reza Miraskarshahi
, Hooman Zabeti
, et al.
·
Bioinformatics
·
8
PDF
The Bipartite Boolean Quadric Polytope
2021
·
Piyashat Sripratak
, Abraham P. Punnen
, et al.
·
Discrete Optimization
·
7
Embedding a Pair of Graphs in a Surface, and the Width of 4-dimensional Prismatoids
2012
·
Santos, Francisco
, Stephen, Tamon
, et al.
·
Archipel (Université du Québec à Montréal)
·
7
A Majorization Bound for the Eigenvalues of Some Graph Laplacians
2007
·
Tamon Stephen
·
SIAM Journal on Discrete Mathematics
·
7
PDF
A linear time algorithm for the 3 -neighbour Travelling Salesman Problem on a Halin graph and extensions
2017
·
Brad Woods
, Abraham Punnen
, et al.
·
Discrete Optimization
·
5
Circuit diameter and Klee-Walkup constructions
2015
·
Stephen, Tamon
, Yusun, Timothy
·
arXiv (Cornell University)
·
5
PDF
Small Octahedral Systems
2011
·
Grant Custard
, Antoine Deza
, et al.
·
5
The Circuit Diameter of the Klee-Walkup Polyhedron
2015
·
Tamon Stephen
, Timothy Yusun
·
Electronic Notes in Discrete Mathematics
·
4
A Linear Time Algorithm for the $3$-neighbour Traveling Salesman Problem on Halin graphs and extensions
2015
·
Woods, Brad
, Punnen, Abraham
, et al.
·
arXiv (Cornell University)
·
4
PDF
Expected Crossing Numbers
2013
·
Bojan Mohar
, Tamon Stephen
·
Fields Institute communications
·
4
Speeding Up the Structural Analysis of Metabolic Network Models Using the Fredman–Khachiyan Algorithm B
2023
·
Nafiseh Sedaghat
, Tamon Stephen
, et al.
·
Journal of Computational Biology
·
2
Speeding up Dualization in the Fredman-Khachiyan Algorithm B
2018
·
Sedaghat, Nafiseh
, Stephen, Tamon
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
PDF
A Duality-Based Method for Identifying Elemental Balance Violations in Metabolic Network Models
2018
·
Zabeti, Hooman
, Stephen, Tamon
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
PDF
Show more works
View as search
Works count:
52
Citation count:
383
H-index:
10
I10-index:
11
Year
Topic
Type