Antoine Deza

From MaRDI portal
Person:173841

Available identifiers

zbMath Open deza.antoineMaRDI QIDQ173841

List of research outcomes





PublicationDate of PublicationType
Kissing polytopes2024-10-22Paper
On skeletons, diameters and volumes of metric polyhedra2024-07-05Paper
The complexity of geometric scaling2024-06-17Paper
Primitive point packing2023-09-20Paper
Kissing polytopes2023-05-29Paper
Sizing the White Whale2022-05-26Paper
Polytopal balls arising in optimization2022-03-28Paper
Charging station optimization for balanced electric car sharing2022-01-05Paper
A linear optimization oracle for zonotope computation2021-12-15Paper
The vertices of primitive zonotopes2021-07-09Paper
The diameter of lattice zonotopes2020-06-11Paper
Computational determination of the largest lattice polytope diameter2020-05-29Paper
Distance between vertices of lattice polytopes2020-04-27Paper
Correction to: ``Distance between vertices of lattice polytopes2020-04-27Paper
On inventory allocation for periodic review assemble-to-order systems2020-02-20Paper
Hypergraphic Degree Sequences are Hard2020-01-13Paper
Diameter, Decomposability, and Minkowski Sums of Polytopes2019-11-12Paper
Small primitive zonotopes2019-04-30Paper
A primal-simplex based Tardos' algorithm2018-09-28Paper
https://portal.mardi4nfdi.de/entity/Q53763702018-09-17Paper
On component commonality for periodic review assemble-to-order systems2018-08-13Paper
Optimization over Degree Sequences2018-08-10Paper
Primitive zonotopes2018-07-26Paper
Computational determination of the largest lattice polytope diameter2018-04-09Paper
SMALL DEGENERATE SIMPLICES CAN BE BAD FOR SIMPLEX METHODS2018-03-29Paper
Bannai et al. method proves the \(d\)-step conjecture for strings2017-03-15Paper
A note on lower bounds for colourful simplicial depth2016-12-09Paper
Corrigendum to: ``On a lemma of Crochemore and Rytter2016-12-09Paper
A computational substantiation of the \(d\)-step approach to the number of distinct squares problem2016-09-12Paper
Imperfect demand estimation for new product production planning2015-10-22Paper
A \(d\)-step approach to the maximum number of distinct squares and runs in strings2015-09-22Paper
On a lemma of Crochemore and Rytter2015-08-24Paper
Managing losses in exotic horse race wagering2015-03-23Paper
How many double squares can a string contain?2014-11-28Paper
A computational framework for determining run-maximal strings2014-08-13Paper
https://portal.mardi4nfdi.de/entity/Q51695792014-07-10Paper
A Combinatorial Approach to Colourful Simplicial Depth2014-06-19Paper
A Combinatorial Approach to Colourful Simplicial Depth2014-06-11Paper
A Further Generalization of the Colourful Carathéodory Theorem2013-09-13Paper
Selected Open Problems in Discrete Geometry and Optimization2013-09-13Paper
Diameter and Curvature: Intriguing Analogies2013-06-28Paper
More bounds on the diameters of convex polytopes2013-06-24Paper
On a conjecture of Erdős for multiplicities of cliques2013-06-24Paper
Computational Lower Bounds for Colourful Simplicial Depth2012-10-29Paper
Hyperplane arrangements with large average diameter: a computational approach2012-09-05Paper
Global routing in VLSI design: algorithms, theory, and computational practice2012-07-02Paper
On the structure of run-maximal strings2012-05-11Paper
https://portal.mardi4nfdi.de/entity/Q30125742011-07-06Paper
A d-Step Approach for Distinct Squares in Strings2011-06-29Paper
More colourful simplices2011-03-10Paper
Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes2010-06-04Paper
On the generalized Berge sorting conjecture2010-02-26Paper
Discrete and Computational Geometry2010-02-05Paper
A continuous \(d\)-step conjecture for polytopes2009-05-13Paper
Hyperplane Arrangements with Large Average Diameter2009-04-28Paper
The colourful feasibility problem2008-09-10Paper
Polytopes and arrangements: diameter and curvature2008-08-06Paper
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds2008-03-12Paper
https://portal.mardi4nfdi.de/entity/Q54424822008-02-22Paper
A counterexample to the dominating set conjecture2007-11-05Paper
The complexity of the envelope of line and plane arrangements2007-09-21Paper
The central path visits all the vertices of the Klee–Minty cube2007-02-14Paper
One of the ``problèmes plaisants et délectables by Claude Berge (Un des ``problèmes plaisants et délectables de Claude Berge).2006-10-30Paper
Colourful simplicial depth2006-08-11Paper
The isometries of the cut, metric and hypermetric cones2006-06-26Paper
https://portal.mardi4nfdi.de/entity/Q45477982002-08-21Paper
Solitaire lattices2002-07-29Paper
On the binary solitaire cone2002-07-16Paper
https://portal.mardi4nfdi.de/entity/Q47619582001-02-21Paper
On the solitaire cone and its relationship to multi-commodity flows.2001-01-01Paper
Fullerenes and coordination polyhedra versus half-cube embeddings2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q49351572000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q49350292000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q48362921995-06-14Paper
https://portal.mardi4nfdi.de/entity/Q43138811995-05-16Paper
McMullen's conditions and some lower bounds for general convex polytopes1995-05-02Paper
https://portal.mardi4nfdi.de/entity/Q43208101995-03-16Paper
https://portal.mardi4nfdi.de/entity/Q43099681994-10-24Paper
The complexity of geometric scalingN/APaper

Research outcomes over time

This page was built for person: Antoine Deza