Author Info
Name
Affiliation
Papers
TAMON STEPHEN
Department of Mathematics, Simon Fraser University, Burnaby, British Columbia, V5A 1S6 Canada Canada
24
Collaborators
Citations 
PageRank 
28
121
16.03
Referers 
Referees 
References 
176
203
134
Search Limit
100203
Title
Citations
PageRank
Year
The Bipartite Boolean Quadric Polytope00.342022
MCS2: minimal coordinated supports for fast enumeration of minimal cut sets in metabolic networks.00.342019
On the Circuit Diameter Conjecture.00.342018
A Duality-Based Method for Identifying Elemental Balance Violations in Metabolic Network Models.00.342018
Speeding up Dualization in the Fredman-Khachiyan Algorithm B.00.342018
A linear time algorithm for the -neighbour Travelling Salesman Problem on a Halin graph and extensions.00.342017
Algorithms for Colourful Simplicial Depth and Medians in the Plane.00.342016
The Circuit Diameter of the Klee-Walkup Polyhedron10.362015
A Note on Lower Bounds for Colourful Simplicial Depth.00.342013
Counting inequivalent monotone Boolean functions.50.542012
Embedding a Pair of Graphs in a Surface, and the Width of 4-dimensional Prismatoids30.442012
Computational Lower Bounds for Colourful Simplicial Depth10.372012
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix10.392012
Efficient Algorithms for Finding Tucker Patterns00.342012
Small Octahedral Systems.00.342011
More Colourful Simplices20.432011
Expected Crossing Numbers10.362011
Minimal conflicting sets for the consecutive ones property in ancestral genome reconstruction.130.782010
The colourful feasibility problem100.762008
A quadratic lower bound for colourful simplicial depth80.852008
Computing knock-out strategies in metabolic networks.281.502008
A Majorization Bound for the Eigenvalues of Some Graph Laplacians10.392007
Colourful Simplicial Depth111.262006
On a Representation of the Matching Polytope Via Semidefinite Liftings364.251999