On the Circuit Diameter Conjecture (with Steffen Borgwardt and Timothy Yusun).

A Linear Time Algorithm for the 3-Neighbour Travelling Salesman Problem on Halin Graphs and Extensions (Brad Woods, Abraham Punnen and TS).

Counting Inequivalent Monotone Boolean Functions (with Timothy Yusun).

A Note on Lower Bounds for Colourful Simplicial Depth (with Antoine Deza and Feng Xie).

A Tight Bound on the Length of Odd Cycles in the Incompatibility Graph of a non-C1P Matrix (Mehrnoush Malekesmaeili, Cedric Chauve and TS).

Embedding a Pair of Graphs in a Surface, and the Width of 4-dimensional Prismatoids (with Francisco Santos and Hugh Thomas).

More Colourful Simplices (with Antoine Deza and Feng Xie).

Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction (with Cedric Chauve, Utz-Uwe Haus and Vivija You).

A Quadratic Lower Bound for Colourful Simplicial Depth (with Hugh Thomas).

Computing Knock out Strategies in Metabolic Networks (with Utz-Uwe Haus and Steffen Klamt).

The Colourful Feasibility Problem (with Antoine Deza, Sui Huang and Tamás Terlaky).

A Majorization Bound for the Eigenvalues of some Graph Laplacians.

Colourful Simplicial Depth (with Antoine Deza, Sui Huang and Tamás Terlaky).

The Distribution of Values in the Quadratic Assignment Problem (with Alexander Barvinok).

On a Representation of the Matching Polytope via Semidefinite Liftings (with Levent Tunçel).

In: K. Bezdek, A. Deza and Y. Ye, editors, Discrete Geometry and Optimization,

On The Distribution of Values in the Quadratic Assignment Problem (with Alexander Barvinok).

In: P.M. Pardalos and H. Wolkowicz, editors, Novel Approaches to Hard Discrete Optimization,

In: L. Parida and E. Ukkonen, editors, Proceedings of the 18th International Workshop on Algorithms in Bioinformatics (WABI 2018),

Speeding up Dualization in the Fredman-Khachiyan Algorithm B (Nafiseh Sedaghat, TS and Leonid Chindelevitch).

In: G. D'Angelo, editor, Proceedings of the 17th International Symposium on Experimental Algorithms (SEA 2018),

Algorithms for Colourful Simplicial Depth and Medians in the Plane (Olga Zasenko and TS).

In: T.-H. H. Chan, M. Li and L. Wang, editors, Proceedings of Combinatorial Optimization and Applications (COCOA),

The Circuit Diameter of the Klee-Walkup Polyhedron (with Timothy Yusun).

In: J. Nesetril, O. Serra and J. A. Telle, editors, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications 2015,

Expected Crossing Numbers (with Bojan Mohar).

In: J. Nesetril and E. Gyori and A. Sali, editors, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications 2011,

Small Octahedral Systems (with Grant Custard, Antoine Deza and Feng Xie).

In: G. Aloupis and D. Bremner, editors, Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG2011),

Toronto (2011) 267-272. ps pdf

Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction (with Cedric Chauve, Utz-Uwe Haus and Vivija You).

In: F. D. Ciccarelli and I. Miklós, editors, Proceedings of the Comparative Genomics International Workshop RECOMB-CG 2009,

Note: Some experimental results were mistranscribed, please refer instead to the journal version.

On the Grone-Merris Conjecture.

In: S. Felsner, editor, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications 2005,

The Distribution of Values in the Quadratic Assignment Problem (with Alexander Barvinok).

In: W.J. Cook and A.S. Schulz, editors, Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization,

Incidentally, there are some good reasons to avoid Elsevier as a publisher, although I'm ambivalent enough that I haven't yet joined the boycott.

Last modified August 2018.