Antoine Deza

Professor and Canada Research Chair in Combinatorial Optimization
Associate Chair (Graduate)
Department of Computing and Software, McMaster University

Selected Publications

  1. Antoine Deza, Sonoko Moriyama, Hiroyuki Miyata, and Feng Xie:
    Hyperplane arrangements with large average diameter: a computational approach.
    Advanced Studies in Pure Mathematics 62 (2012) 59 - 74.

  2. Andrew Baker, Antoine Deza, and Frantisek Franek:
    On the structure of run-maximal strings.
    Journal of Discrete Algorithms 14 (2012) 10 - 14.

  3. Antoine Deza, Tamon Stephen, and Feng Xie:
    More colourful simplices.
    Discrete and Computational Geometry 45 (2011) 272 - 278.

  4. David Bremner, Antoine Deza, Hiroshi Imai, and Sonoko Moriyama (Editors):
    Special Issue on Geometry and Optimization.
    Computational Geometry: Theory and Application (to appear).

  5. David Bremner, Antoine Deza, William Hua, and Lars Schewe:
    Pushing the boundaries of polytopal realizability.
    Proceedings of the 23rd Canadian Conference on Computational Geometry, Fields Institute, Toronto, Canada (2011) 193 - 198.

  6. Andrew Baker, Antoine Deza, and Frantisek Franek:
    A computational framework for determining run-maximal strings.
    AdvOL-Report 2011/6, McMaster University (2011).

  7. Antoine Deza, Frantisek Franek, and Mei Jiang:
    A d-step approach for distinct squares in strings.
    Lecture Notes in Computer Science 6661 Springer-Verlag, Berlin (2011) 77 - 89.

  8. Frédéric Meunier and Antoine Deza:
    A further generalization of the colourful Carathéodory theorem.
    AdvOL-Report 2011/4, McMaster University (2011).

  9. Grant Custard, Antoine Deza, Tamon Stephen, and Feng Xie:
    Small octahedral systems.
    Proceedings of the 23rd Canadian Conference on Computational Geometry, Fields Institute, Toronto, Canada (2011) 267 - 271.

  10. Andrew Baker, Antoine Deza, and Frantisek Franek:
    A parameterized formulation for the maximum number of runs problem.
    Proceedings of Prague Stringology Conference, Prague, Czech Republic (2011) 74 - 82.

  11. Antoine Deza, Frantisek Franek, and Min Jing Liu:
    On Erdős conjecture for multiplicities of cliques.
    AdvOL-Report 2010/4, McMaster University (2010) (submitted).

  12. Antoine Deza, Chris Dickson, Tamas Terlaky, Anthony Vannelli, and Hu Zhang:
     Global routing in VLSI design: algorithms, theory, and computational practice.
    Journal of Combinatorial Mathematics and Combinatorial Computing (to appear).

  13. Antoine Deza and Frantisek Franek:
    A d-step analogue for runs on strings.
    AdvOL-Report 2010/2, McMaster University (2010) (submitted).

  14. Antoine Deza and Feng Xie:
    On the generalized Berge sorting conjecture.
    Journal of Discrete Algorithms 8 (2010) 1 - 7.

  15. Antoine Deza, Frantisek Franek, William Hua, Mariusz Meszka, and Alexander Rosa:
    Solutions to the Oberwolfach problem for orders 18 to 40.
    Journal of Combinatorial Mathematics and Combinatorial Computing 74 (2010) 95 - 102.

  16. Antoine Deza, Tamas Terlaky, and Yuriy Zinchenko:
    Central path curvature and iteration-complexity for redundant Klee-Minty cubes.
    Advances in Mechanics and Mathematics 17 (2009) 223 - 256.

  17. Antoine Deza and Feng Xie:
    Hyperplane arrangements with large average diameter.
    Centre de Recherches Mathematiques Series 48 (2009) 103 - 114.

  18. Antoine Deza, Tamas Terlaky, and Yuriy Zinchenko:
    A continuous d-step conjecture for polytopes.
    Discrete and Computational Geometry 41 (2009) 318 - 327.

  19. David Avis, David Bremner, and Antoine Deza (Editors):
    Polyhedral Computation.
    Centre de Recherches Mathematiques Series 48 (2009).

  20. David Bremner, Antoine Deza, and Michael Soltys (Editors):
    Selected Papers from the Franco-Canadian Workshop on Combinatorial Algorithms.
    Journal of Combinatorial Optimization 16 (2008) 323.

  21. Antoine Deza, Sui Huang, Tamon Stephen, and Tamas Terlaky:
    The colourful feasibility problem.
    Discrete Applied Mathematics 156 (2008) 2166 - 2177.

  22. Antoine Deza, Tamas Terlaky, Feng Xie, and Yuriy Zinchenko:
    Diameter and curvature: intriguing analogies.
    Electronic Notes in Discrete Mathematics 31 (2008) 221 - 225.

  23. David Bremner, Antoine Deza, and Feng Xie:
    The complexity of the envelope of line and plane arrangements.
    Optimization - Modeling and Algorithms 21 Institute of Statistical Mathematics, Tokyo, Japan (2008) 1 - 7.

  24. Antoine Deza, Tamas Terlaky, and Yuriy Zinchenko:
    Polytopes and arrangements : diameter and curvature.
    Operations Research Letters 36 (2008) 215 - 222.

  25. Antoine Deza, Eissa Nematollahi, and Tamas Terlaky:
    How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
    Mathematical Programming 113 (2008) 1 - 14.

  26. Antoine Deza and Feng Xie:
    Line and plane arrangements with large average diameter.
    Proceedings of the 5th Hungarian-Japanese Symposium on Discrete Mathematics and its Applications, Sendai, Japan (2007) 106 - 111.

  27. Antoine Deza and Gabriel Indik:
    A counterexample to the dominating set conjecture.
    Optimization Letters 1 (2007) 163 - 169.

  28. Antoine Deza and William Hua:
    Berge sorting.
    Pacific Journal of Optimization 3 (2007) 27 - 35.

  29. David Avis, and Antoine Deza:
    Un des "problemes plaisans et delectables" de Claude Berge.
    Discrete Mathematics 306 (2006) 2299 - 2302.

  30. Antoine Deza, Eissa Nematollahi, Reza Peyghami, and Tamas Terlaky:
    The central path visits all the vertices of the Klee-Minty cube.
    Optimization Methods and Software 21 (2006) 851 - 865.

  31. Antoine Deza, Sui Huang, Tamon Stephen, and Tamas Terlaky:
    Colourful simplicial depth.
    Discrete and Computational Geometry 35 (2006) 597 - 615.

  32. Antoine Deza, Boris Goldengorin, and Dimitrii Pasechnik:
    The isometries of the cut, metric and hypermetric cones.
    Journal of Algebraic Combinatorics 23 (2006) 197 - 203.

  33. Antoine Deza, Komei Fukuda, Tomohiko Mizutani, and Cong Vo:
    On the face-lattice of the metric polytope.
    Lecture Notes in Computer Science 2866 Springer-Verlag, Berlin (2003) 118 - 128.

  34. Antoine Deza and Shmuel Onn:
    Solitaire lattices.
    Graphs and Combinatorics 18 (2002) 227 - 243.

  35. Antoine Deza, Tomohiko Mizutani, and Dimitrii Pasechnik:
    Enumerating faces of polyhedra with large symmetry group.
    Optimization - Modeling and Algorithms 15 Institute of Statistical Mathematics, Tokyo, Japan (2002) 179 - 185.

  36. David Avis and Antoine Deza:
    On the binary solitaire cone.
    Discrete Applied Mathematics 115 (2001) 3 - 14.

  37. Antoine Deza, Komei Fukuda, Dimitrii Pasechnik, and Masanori Sato:
    On the skeleton of the metric polytope.
    Lecture Notes in Computer Science 2098 Springer-Verlag, Berlin (2001) 125 - 136.

  38. David Avis and Antoine Deza:
    On the solitaire cone and its relationship to multi-commodity flows.
    Mathematical Programming 90 (2001) 27 - 57.

  39. Antoine Deza, Komei Fukuda, Dimitrii Pasechnik, and Masanori Sato:
    Generating vertices with symmetries.
    Proceedings of the 5th Workshop on Algorithms and Computation, Tokyo University, Japan (2000) 1 - 8.

  40. David Avis, Antoine Deza, and Shmuel Onn:
    A combinatorial approach to the solitaire game.
    IEICE Transactions E83-A (2000) 656 - 661.

  41. Antoine Deza:
    Necessary conditions for solitaire feasibility.
    Optimization - Modeling and Algorithms 13 Institute of Statistical Mathematics, Tokyo, Japan (2000) 200 - 215.

  42. Antoine Deza and Shmuel Onn:
    Odd central square solitaire.
    Kokyuroku 1114 Research Institute for Mathematical Sciences, Kyoto University, Japan (1999) 96 - 105.

  43. Antoine Deza, Michel Deza and, Viatcheslav Grishukhin:
    Fullerenes and coordinations polyhedra versus half-cubes embeddings.
    Discrete Mathematics 192 (1998) 41 - 80.

  44. Antoine Deza, Michel Deza, and Komei Fukuda:
    On skeletons, diameters and volumes of metric polyhedra.
    Lecture Notes in Computer Science 1120 Springer-Verlag, Berlin (1996) 112 - 128.

  45. Antoine Deza and Michel Deza:
    The combinatorial structure of small cut and metric polytopes.
    Combinatorics and Graph Theory 95 World Scientific, Singapore (1995) 70 - 88.

  46. Antoine Deza and Michel Deza:
    Skeletons of some polytopes related to the n-cube.
    Selected Papers of the Berlin International Conference on Operations Research Springer-Verlag (1995) 81 - 85.

  47. Antoine Deza and Michel Deza:
    On the skeleton of the dual cut polytope.
    Contemporary Mathematics 178 (1994) 101 - 111.

  48. Antoine Deza:
    Shape of the equicut polytope.
    Optimization - Modeling and Algorithms 61 - 5 Institute of Statistical Mathematics, Tokyo, Japan (1994) 81 - 87.

  49. Antoine Deza, Komei Fukuda, and Vera Rosta:
    Wagner's theorem and combinatorial enumeration of 3-polytopes.
    Kokyuroku 872 Research Institute for Mathematical Sciences, Kyoto University, Japan (1994) 30 - 34.

  50. Antoine Deza and Michel Deza:
    The ridge graph of the metric polytope and some relatives.
    Polytopes: Abstract, Convex and Computational NATO ASI Series, Kluwer (1994) 359 - 372.

  51. Antoine Deza:
    On lower bound for general convex polytopes.
    Mathematica Japonica 40 (1994) 371 - 380.

  52. Antoine Deza and Komei Fukuda:
    McMullen's conditions and some lower bounds for general convex polytopes.
    Geometriae Dedicata 52 (1994) 165 - 173.

Selected Talks