On Skeletons, Diameters and Volumes of Metric Polyhedra. - Antoine Deza; Michel Deza; Komei Fukuda (Combinatorics and Computer Science, 1995)

Fullerenes and coordination polyhedra versus half-cube embeddings. - Antoine Deza; Michel Deza; Viatcheslav P. Grishukhin (Discret. Math., 1998)

On the Skeleton of the Metric Polytope. - Antoine Deza; Komei Fukuda; Dmitrii V. Pasechnik; Masanori Sato (JCDCG, 2000)

On the binary solitaire cone. - David Avis; Antoine Deza (Discret. Appl. Math., 2001)

On the solitaire cone and its relationship to multi-commodity flows. - David Avis; Antoine Deza (Math. Program., 2001)

On the Face Lattice of the Metric Polytope. - Antoine Deza; Komei Fukuda; Tomohiko Mizutani; Cong Vo (JCDCG, 2002)

Solitaire Lattices. - Antoine Deza; Shmuel Onn (Graphs Comb., 2002)

Colourful Simplicial Depth. - Antoine Deza; Sui Huang; Tamon Stephen; Tamás Terlaky (Discret. Comput. Geom., 2006)

Un des "problèmes plaisans et délectables" de Claude Berge. - David Avis; Antoine Deza (Discret. Math., 2006)

The central path visits all the vertices of the Klee-Minty cube. - Antoine Deza; Eissa Nematollahi; M. Reza Peyghami; Tamás Terlaky (Optim. Methods Softw., 2006)

A counterexample to the dominating set conjecture. - Antoine Deza; Gabriel Indik (Optim. Lett., 2007)

The colourful feasibility problem. - Antoine Deza; Sui Huang; Tamon Stephen; Tamás Terlaky (Discret. Appl. Math., 2008)

Diameter and Curvature: Intriguing Analogies. - Antoine Deza; Tamás Terlaky; Feng Xie 007; Yuriy Zinchenko (Electron. Notes Discret. Math., 2008)

Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. - David Bremner; Antoine Deza; Michael Soltys (J. Comb. Optim., 2008)

How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds. - Antoine Deza; Eissa Nematollahi; Tamás Terlaky (Math. Program., 2008)

Polytopes and arrangements: Diameter and curvature. - Antoine Deza; Tamás Terlaky; Yuriy Zinchenko (Oper. Res. Lett., 2008)

A Continuous d -Step Conjecture for Polytopes. - Antoine Deza; Tamás Terlaky; Yuriy Zinchenko (Discret. Comput. Geom., 2009)

On the generalized Berge sorting conjecture. - Antoine Deza; Feng Xie 007 (J. Discrete Algorithms, 2010)

Pushing the boundaries of polytopal realizability. - David Bremner; Antoine Deza; William Hua; Lars Schewe (CCCG, 2011)

Small Octahedral Systems. - Grant Custard; Antoine Deza; Tamon Stephen; Feng Xie 007 (CCCG, 2011)

A d-Step Approach for Distinct Squares in Strings. - Antoine Deza; Frantisek Franek; Mei Jiang (CPM, 2011)

A Parameterized Formulation for the Maximum Number of Runs Problem. - Andrew Baker; Antoine Deza; Frantisek Franek (Stringology, 2011)

A further generalization of the colourful Carathéodory theorem - Frédéric Meunier; Antoine Deza (CoRR, 2011)

More Colourful Simplices. - Antoine Deza; Tamon Stephen; Feng Xie 007 (Discret. Comput. Geom., 2011)

A Computational Framework for Determining Square-maximal Strings. - Antoine Deza; Frantisek Franek; Mei Jiang (Stringology, 2012)

Computational Lower Bounds for Colourful Simplicial Depth - Antoine Deza; Tamon Stephen; Feng Xie 007 (CoRR, 2012)

On the structure of run-maximal strings. - Andrew Baker; Antoine Deza; Frantisek Franek (J. Discrete Algorithms, 2012)

On a conjecture of Erdős for multiplicities of cliques. - Antoine Deza; Frantisek Franek; Min Jing Liu (J. Discrete Algorithms, 2012)

Editorial. - David Bremner; Antoine Deza; Hiroshi Imai; Sonoko Moriyama (Comput. Geom., 2013)

A computational framework for determining run-maximal strings. - Andrew Baker; Antoine Deza; Frantisek Franek (J. Discrete Algorithms, 2013)

More bounds on the diameters of convex polytopes. - David Bremner; Antoine Deza; William Hua; Lars Schewe (Optim. Methods Softw., 2013)

A Note on Lower Bounds for Colourful Simplicial Depth. - Antoine Deza; Tamon Stephen; Feng Xie 007 (Symmetry, 2013)

Chance Constrained Optimization for Targeted Internet Advertising. - Antoine Deza; Kai Huang 003; Michael R. Metel (CoRR, 2014)

A d-step approach to the maximum number of distinct squares and runs in strings. - Antoine Deza; Frantisek Franek (Discret. Appl. Math., 2014)

A Combinatorial Approach to Colourful Simplicial Depth. - Antoine Deza; Frédéric Meunier; Pauline Sarrabezolles (SIAM J. Discret. Math., 2014)

How many double squares can a string contain? - Antoine Deza; Frantisek Franek; Adrien Thierry (Discret. Appl. Math., 2015)

On a lemma of Crochemore and Rytter. - Haoyue Bai 005; Antoine Deza; Frantisek Franek (J. Discrete Algorithms, 2015)

A primal-simplex based Tardos' algorithm. - Shinji Mizuno; Noriyoshi Sukegawa; Antoine Deza (Oper. Res. Lett., 2015)

A computational substantiation of the d-step approach to the number of distinct squares problem. - Antoine Deza; Frantisek Franek; Mei Jiang (Discret. Appl. Math., 2016)

Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22]. - Haoyue Bai 005; Antoine Deza; Frantisek Franek (J. Discrete Algorithms, 2016)

Bannai et al. method proves the d-step conjecture for strings. - Antoine Deza; Frantisek Franek (Discret. Appl. Math., 2017)

Paths, pivots, and practice: the power of optimization. - Miguel F. Anjos; Antoine Deza (Ann. Oper. Res., 2018)

On component commonality for periodic review assemble-to-order systems. - Antoine Deza; Kai Huang 003; Hongfeng Liang; Xiao Jiao Wang (Ann. Oper. Res., 2018)

Preface: Linear optimization. - Antoine Deza; Frédéric Meunier (Discret. Appl. Math., 2018)

Primitive Zonotopes. - Antoine Deza; George Manoussakis; Shmuel Onn (Discret. Comput. Geom., 2018)

Managing losses in exotic horse race wagering. - Antoine Deza; Kai Huang 003; Michael R. Metel (J. Oper. Res. Soc., 2018)

Optimization over Degree Sequences. - Antoine Deza; Asaf Levin; Syed Mohammad Meesum; Shmuel Onn (SIAM J. Discret. Math., 2018)

Hypergraphic Degree Sequences are Hard. - Antoine Deza; Asaf Levin; Syed Mohammad Meesum; Shmuel Onn (Bull. EATCS, 2019)

Computational determination of the largest lattice polytope diameter. - Nathan Chadder; Antoine Deza (Discret. Appl. Math., 2020)

On inventory allocation for periodic review assemble-to-order systems. - Antoine Deza; Kai Huang 003; Hongfeng Liang; Xiao Jiao Wang (Discret. Appl. Math., 2020)

Preface: Workshop on Advances in Optimization. - Antoine Deza; Tomonari Kitahara; Noriyoshi Sukegawa (Discret. Appl. Math., 2020)

Distance between vertices of lattice polytopes. - Anna Deza; Antoine Deza; Zhongyan Guan; Lionel Pournin (Optim. Lett., 2020)

Correction to: Distance between vertices of lattice polytopes. - Anna Deza; Antoine Deza; Zhongyan Guan; Lionel Pournin; Carlos Aníbal Suárez (Optim. Lett., 2020)

Polytopal balls arising in optimization. - Antoine Deza; Jean-Baptiste Hiriart-Urruty; Lionel Pournin (Contributions Discret. Math., 2021)

Multiperiod refinery optimization for mitigating the impact of process unit shutdowns. - Ariel Boucheikhchoukh; Valentin Berger; Christopher L. E. Swartz; Antoine Deza; Alexander Nguyen; Shaffiq Jaffer (Comput. Chem. Eng., 2022)

A linear optimization oracle for zonotope computation. - Antoine Deza; Lionel Pournin (Comput. Geom., 2022)

Charging station optimization for balanced electric car sharing. - Antoine Deza; Kai Huang 003; Michael R. Metel (Discret. Appl. Math., 2022)

Preface: Optimization and Discrete Geometry. - Antoine Deza; Frédéric Meunier; Tal Raviv (Discret. Optim., 2022)

The complexity of geometric scaling. - Antoine Deza; Sebastian Pokutta; Lionel Pournin (Oper. Res. Lett., 2024)

Kissing Polytopes. - Antoine Deza; Shmuel Onn; Sebastian Pokutta; Lionel Pournin (SIAM J. Discret. Math., 2024)