| Computing knock-out strategies in metabolic networks UU Haus, S Klamt, T Stephen Journal of Computational Biology 15 (3), 259-268, 2008 | 98 | 2008 |
| On a representation of the matching polytope via semidefinite liftings T Stephen, L Tunçel Mathematics of Operations Research 24 (1), 1-7, 1999 | 77 | 1999 |
| Counting inequivalent monotone boolean functions T Stephen, T Yusun Discrete Applied Mathematics 167, 15-24, 2014 | 51 | 2014 |
| Colourful simplicial depth A Deza, S Huang, T Stephen, T Terlaky Discrete & Computational Geometry 35, 597-615, 2006 | 33 | 2006 |
| 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 | 25 | 2010 |
| 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 | 25 | 2009 |
| On the circuit diameter conjecture S Borgwardt, T Stephen, T Yusun Discrete & Computational Geometry 60 (3), 558-587, 2018 | 20 | 2018 |
| The distribution of values in the quadratic assignment problem A Barvinok, T Stephen Mathematics of Operations Research 28 (1), 64-91, 2003 | 20 | 2003 |
| A quadratic lower bound for colourful simplicial depth T Stephen, H Thomas Journal of combinatorial optimization 16 (4), 324-327, 2008 | 19 | 2008 |
| The colourful feasibility problem A Deza, S Huang, T Stephen, T Terlaky Discrete Applied Mathematics 156 (11), 2166-2177, 2008 | 19 | 2008 |
| More colourful simplices A Deza, T Stephen, F Xie Discrete & Computational Geometry 45, 272-278, 2011 | 15 | 2011 |
| 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 | 14 | 2017 |
| 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, 569-576, 2012 | 12 | 2012 |
| A Majorization bound for the eigenvalues of some graph Laplacians T Stephen SIAM Journal on Discrete Mathematics 21 (2), 303-312, 2007 | 11 | 2007 |
| Optimising nurse schedules at a community health centre SL Zimmerman, A Bi, T Dallow, AR Rutherford, T Stephen, C Bye, D Hall, ... Operations Research for Health Care 30, 100308, 2021 | 10 | 2021 |
| MCS2: minimal coordinated supports for fast enumeration of minimal cut sets in metabolic networks R Miraskarshahi, H Zabeti, T Stephen, L Chindelevitch Bioinformatics 35 (14), i615-i623, 2019 | 9 | 2019 |
| Circuit diameter and Klee-Walkup constructions T Stephen, T Yusun arXiv preprint arXiv:1503.05252, 2015 | 9* | 2015 |
| Expected crossing numbers B Mohar, T Stephen Electronic Notes in Discrete Mathematics 38, 651-656, 2011 | 8 | 2011 |
| Small Octahedral Systems. G Custard, A Deza, T Stephen, F Xie CCCG, 2011 | 8 | 2011 |
| The bipartite boolean quadric polytope P Sripratak, AP Punnen, T Stephen Discrete Optimization 44, 100657, 2022 | 7 | 2022 |
