- Antoine Deza, Michel Deza, Polytopes: Abstract, Convex and Computational, 1994, 359
- Michel Deza, Monique Laurent, “Facets for the cut cone II: Clique-web inequalities”, Mathematical Programming, 56, № 1-3, 1992, 161
- Antoine Deza, Boris Goldengorin, Dmitrii V. Pasechnik, “The isometries of the cut, metric and hypermetric cones”, J Algebr Comb, 23, № 2, 2006, 197
- Miguel F. Anjos, Bissan Ghaddar, Lena Hupp, Frauke Liers, Angelika Wiegele, Facets of Combinatorial Optimization, 2013, 355
- David Avis, Michel Deza, “The cut cone, L1 embeddability, complexity, and multicommodity flows”, Networks, 21, № 6, 1991, 595
- Antoine Deza, Gabriel Indik, “A counterexample to the dominating set conjecture”, Optimization Letters, 1, № 2, 2007, 163
- Caterina De Simone, Michel Deza, Monique Laurent, “Collapsing and lifting for the cut cone”, Discrete Mathematics, 127, № 1-3, 1994, 105
- François Laburthe, 920, Integer Programming and Combinatorial Optimization, 1995, 252
- Bissan Ghaddar, Miguel F. Anjos, Frauke Liers, “A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem”, Ann Oper Res, 188, № 1, 2011, 155
- Antoine Deza, Michel Deza, Komei Fukuda, 1120, Combinatorics and Computer Science, 1996, 112