default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamon Stephen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j21]Nafiseh Sedaghat, Tamon Stephen
, Leonid Chindelevitch:
Speeding Up the Structural Analysis of Metabolic Network Models Using the Fredman-Khachiyan Algorithm B. J. Comput. Biol. 30(6): 678-694 (2023)- 2022
- [j20]Piyashat Sripratak, Abraham P. Punnen, Tamon Stephen:
The Bipartite Boolean Quadric Polytope. Discret. Optim. 44(Part): 100657 (2022) - [j19]Greg Aloupis, Tamon Stephen, Olga Zasenko:
Computing Colourful Simplicial Depth and Median in ℝ2. Theory Comput. Syst. 66(2): 417-431 (2022)
2010 – 2019
- 2019
- [j18]Reza Miraskarshahi, Hooman Zabeti, Tamon Stephen, Leonid Chindelevitch:
MCS2: minimal coordinated supports for fast enumeration of minimal cut sets in metabolic networks. Bioinform. 35(14): i615-i623 (2019) - 2018
- [j17]Steffen Borgwardt, Tamon Stephen, Timothy Yusun:
On the Circuit Diameter Conjecture. Discret. Comput. Geom. 60(3): 558-587 (2018) - [c6]Hooman Zabeti, Tamon Stephen, Bonnie Berger, Leonid Chindelevitch:
A Duality-Based Method for Identifying Elemental Balance Violations in Metabolic Network Models. WABI 2018: 1:1-1:13 - [c5]Nafiseh Sedaghat, Tamon Stephen, Leonid Chindelevitch:
Speeding up Dualization in the Fredman-Khachiyan Algorithm B. SEA 2018: 6:1-6:13 - 2017
- [j16]Brad D. Woods, Abraham P. Punnen, Tamon Stephen:
A linear time algorithm for the -neighbour Travelling Salesman Problem on a Halin graph and extensions. Discret. Optim. 26: 163-182 (2017) - 2016
- [c4]Olga Zasenko, Tamon Stephen:
Algorithms for Colourful Simplicial Depth and Medians in the Plane. COCOA 2016: 378-392 - [i8]Olga Zasenko, Tamon Stephen:
Algorithms for Colourful Simplicial Depth and Medians in the Plane. CoRR abs/1608.07348 (2016) - 2015
- [j15]Tamon Stephen, Timothy Yusun:
The Circuit Diameter of the Klee-Walkup Polyhedron. Electron. Notes Discret. Math. 49: 505-512 (2015) - [i7]Tamon Stephen, Timothy Yusun:
Circuit diameter and Klee-Walkup constructions. CoRR abs/1503.05252 (2015) - [i6]Brad D. Woods, Abraham P. Punnen, Tamon Stephen:
A Linear Time Algorithm for the $3$-Neighbour Traveling Salesman Problem on Halin graphs and extensions. CoRR abs/1504.02151 (2015) - 2014
- [j14]Tamon Stephen, Timothy Yusun:
Counting inequivalent monotone Boolean functions. Discret. Appl. Math. 167: 15-24 (2014) - 2013
- [j13]Antoine Deza, Tamon Stephen, Feng Xie:
A Note on Lower Bounds for Colourful Simplicial Depth. Symmetry 5(1): 47-53 (2013) - 2012
- [j12]Francisco Santos, Tamon Stephen, Hugh Thomas:
Embedding a Pair of Graphs in a Surface, and the Width of 4-dimensional Prismatoids. Discret. Comput. Geom. 47(3): 569-576 (2012) - [j11]Mehrnoush Malekesmaeili, Cédric Chauve, Tamon Stephen:
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix. Inf. Process. Lett. 112(20): 799-803 (2012) - [i5]Tamon Stephen, Timothy Yusun:
Counting inequivalent monotone Boolean functions. CoRR abs/1209.4623 (2012) - [i4]Antoine Deza, Tamon Stephen, Feng Xie:
Computational Lower Bounds for Colourful Simplicial Depth. CoRR abs/1210.7621 (2012) - 2011
- [j10]Antoine Deza, Tamon Stephen, Feng Xie:
More Colourful Simplices. Discret. Comput. Geom. 45(2): 272-278 (2011) - [j9]Bojan Mohar, Tamon Stephen:
Expected Crossing Numbers. Electron. Notes Discret. Math. 38: 651-656 (2011) - [c3]Grant Custard, Antoine Deza, Tamon Stephen, Feng Xie:
Small Octahedral Systems. CCCG 2011 - [i3]Francisco Santos, Tamon Stephen, Hugh Thomas:
Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids. CoRR abs/1104.2630 (2011) - [i2]Mehrnoush Malekesmaeili, Cédric Chauve, Tamon Stephen:
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix. CoRR abs/1109.0562 (2011) - 2010
- [j8]Cédric Chauve, Utz-Uwe Haus, Tamon Stephen, Vivija P. You:
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction. J. Comput. Biol. 17(9): 1167-1181 (2010)
2000 – 2009
- 2009
- [c2]Cédric Chauve, Utz-Uwe Haus, Tamon Stephen, Vivija P. You:
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction. RECOMB-CG 2009: 48-58 - [i1]Cédric Chauve, Utz-Uwe Haus, Tamon Stephen, Vivija P. You:
Minimal Conflicting Sets for the Consecutive Ones Property in ancestral genome reconstruction. CoRR abs/0912.4196 (2009) - 2008
- [j7]Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky:
The colourful feasibility problem. Discret. Appl. Math. 156(11): 2166-2177 (2008) - [j6]Utz-Uwe Haus, Steffen Klamt, Tamon Stephen:
Computing Knock-Out Strategies in Metabolic Networks. J. Comput. Biol. 15(3): 259-268 (2008) - [j5]Tamon Stephen, Hugh Thomas:
A quadratic lower bound for colourful simplicial depth. J. Comb. Optim. 16(4): 324-327 (2008) - 2007
- [j4]Tamon Stephen:
A Majorization Bound for the Eigenvalues of Some Graph Laplacians. SIAM J. Discret. Math. 21(2): 303-312 (2007) - 2006
- [j3]Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky:
Colourful Simplicial Depth. Discret. Comput. Geom. 35(4): 597-615 (2006) - 2003
- [j2]Alexander I. Barvinok, Tamon Stephen:
The Distribution of Values in the Quadratic Assignment Problem. Math. Oper. Res. 28(1): 64-91 (2003) - 2002
- [c1]Alexander I. Barvinok, Tamon Stephen:
The Distribution of Values in the Quadratic Assignment Problem. IPCO 2002: 367-383
1990 – 1999
- 1999
- [j1]Tamon Stephen, Levent Tunçel:
On a Representation of the Matching Polytope Via Semidefinite Liftings. Math. Oper. Res. 24(1): 1-7 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-21 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
