Antoine Deza

According to our database1, Antoine Deza authored at least 53 papers between 1995 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Correction to: Distance between vertices of lattice polytopes.
Optim. Lett., 2020

Distance between vertices of lattice polytopes.
Optim. Lett., 2020

Preface: Workshop on Advances in Optimization.
Discret. Appl. Math., 2020

On inventory allocation for periodic review assemble-to-order systems.
Discret. Appl. Math., 2020

2019
Hypergraphic Degree Sequences are Hard.
Bull. EATCS, 2019

2018
Optimization over Degree Sequences.
SIAM J. Discret. Math., 2018

Managing losses in exotic horse race wagering.
J. Oper. Res. Soc., 2018

Primitive Zonotopes.
Discret. Comput. Geom., 2018

Preface: Linear optimization.
Discret. Appl. Math., 2018

On component commonality for periodic review assemble-to-order systems.
Ann. Oper. Res., 2018

Paths, pivots, and practice: the power of optimization.
Ann. Oper. Res., 2018

2017
Computational determination of the largest lattice polytope diameter.
Electron. Notes Discret. Math., 2017

Bannai et al. method proves the d-step conjecture for strings.
Discret. Appl. Math., 2017

2016
Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22].
J. Discrete Algorithms, 2016

A computational substantiation of the d-step approach to the number of distinct squares problem.
Discret. Appl. Math., 2016

2015
A primal-simplex based Tardos' algorithm.
Oper. Res. Lett., 2015

On a lemma of Crochemore and Rytter.
J. Discrete Algorithms, 2015

How many double squares can a string contain?
Discret. Appl. Math., 2015

2014
A Combinatorial Approach to Colourful Simplicial Depth.
SIAM J. Discret. Math., 2014

A d-step approach to the maximum number of distinct squares and runs in strings.
Discret. Appl. Math., 2014

Chance Constrained Optimization for Targeted Internet Advertising.
CoRR, 2014

2013
A Note on Lower Bounds for Colourful Simplicial Depth.
Symmetry, 2013

More bounds on the diameters of convex polytopes.
Optim. Methods Softw., 2013

A computational framework for determining run-maximal strings.
J. Discrete Algorithms, 2013

Editorial.
Comput. Geom., 2013

2012
On a conjecture of Erdős for multiplicities of cliques.
J. Discrete Algorithms, 2012

On the structure of run-maximal strings.
J. Discrete Algorithms, 2012

Computational Lower Bounds for Colourful Simplicial Depth
CoRR, 2012

A Computational Framework for Determining Square-maximal Strings.
Proceedings of the Prague Stringology Conference 2012, 2012

2011
More Colourful Simplices.
Discret. Comput. Geom., 2011

A further generalization of the colourful Carathéodory theorem
CoRR, 2011

A Parameterized Formulation for the Maximum Number of Runs Problem.
Proceedings of the Prague Stringology Conference 2011, 2011

A <i>d</i>-Step Approach for Distinct Squares in Strings.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Small Octahedral Systems.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Pushing the boundaries of polytopal realizability.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
On the generalized Berge sorting conjecture.
J. Discrete Algorithms, 2010

2009
A Continuous <i>d</i> -Step Conjecture for Polytopes.
Discret. Comput. Geom., 2009

2008
Polytopes and arrangements: Diameter and curvature.
Oper. Res. Lett., 2008

How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
Math. Program., 2008

Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms.
J. Comb. Optim., 2008

Diameter and Curvature: Intriguing Analogies.
Electron. Notes Discret. Math., 2008

The colourful feasibility problem.
Discret. Appl. Math., 2008

2007
A counterexample to the dominating set conjecture.
Optim. Lett., 2007

2006
The central path visits all the vertices of the Klee-Minty cube.
Optim. Methods Softw., 2006

Un des "problèmes plaisans et délectables" de Claude Berge.
Discret. Math., 2006

Colourful Simplicial Depth.
Discret. Comput. Geom., 2006

2002
Solitaire Lattices.
Graphs Comb., 2002

On the Face Lattice of the Metric Polytope.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001
On the solitaire cone and its relationship to multi-commodity flows.
Math. Program., 2001

On the binary solitaire cone.
Discret. Appl. Math., 2001

2000
On the Skeleton of the Metric Polytope.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1998
Fullerenes and coordination polyhedra versus half-cube embeddings.
Discret. Math., 1998

1995
On Skeletons, Diameters and Volumes of Metric Polyhedra.
Proceedings of the Combinatorics and Computer Science, 1995


  Loading...