default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoine Deza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j50]Antoine Deza, Sebastian Pokutta, Lionel Pournin
:
The complexity of geometric scaling. Oper. Res. Lett. 52: 107057 (2024)- [j49]Antoine Deza, Shmuel Onn, Sebastian Pokutta, Lionel Pournin:
Kissing Polytopes. SIAM J. Discret. Math. 38(4): 2643-2664 (2024) - 2022
- [j48]Ariel Boucheikhchoukh, Valentin Berger, Christopher L. E. Swartz, Antoine Deza, Alexander Nguyen, Shaffiq Jaffer:
Multiperiod refinery optimization for mitigating the impact of process unit shutdowns. Comput. Chem. Eng. 164: 107873 (2022) - [j47]Antoine Deza, Lionel Pournin:
A linear optimization oracle for zonotope computation. Comput. Geom. 100: 101809 (2022) - [j46]Antoine Deza, Kai Huang, Michael R. Metel:
Charging station optimization for balanced electric car sharing. Discret. Appl. Math. 308: 187-197 (2022) - [j45]Antoine Deza, Frédéric Meunier, Tal Raviv:
Preface: Optimization and Discrete Geometry. Discret. Optim. 44(Part): 100658 (2022) - 2021
- [j44]Antoine Deza, Jean-Baptiste Hiriart-Urruty, Lionel Pournin:
Polytopal balls arising in optimization. Contributions Discret. Math. 16(3): 125-138 (2021) - 2020
- [j43]Antoine Deza, Tomonari Kitahara, Noriyoshi Sukegawa:
Preface: Workshop on Advances in Optimization. Discret. Appl. Math. 275: 1-2 (2020) - [j42]Antoine Deza, Kai Huang, Hongfeng Liang, Xiao Jiao Wang:
On inventory allocation for periodic review assemble-to-order systems. Discret. Appl. Math. 275: 29-41 (2020) - [j41]Nathan Chadder, Antoine Deza:
Computational determination of the largest lattice polytope diameter. Discret. Appl. Math. 281: 106-110 (2020) - [j40]Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin:
Distance between vertices of lattice polytopes. Optim. Lett. 14(2): 309-326 (2020) - [j39]Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin, Carlos Aníbal Suárez:
Correction to: Distance between vertices of lattice polytopes. Optim. Lett. 14(2): 327-328 (2020)
2010 – 2019
- 2019
- [j38]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Hypergraphic Degree Sequences are Hard. Bull. EATCS 127 (2019) - [i7]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Hypergraphic Degree Sequences are Hard. CoRR abs/1901.02272 (2019) - 2018
- [j37]Miguel F. Anjos, Antoine Deza:
Paths, pivots, and practice: the power of optimization. Ann. Oper. Res. 265(1): 1-4 (2018) - [j36]Antoine Deza, Kai Huang, Hongfeng Liang, Xiao Jiao Wang:
On component commonality for periodic review assemble-to-order systems. Ann. Oper. Res. 265(1): 29-46 (2018) - [j35]Antoine Deza, Frédéric Meunier:
Preface: Linear optimization. Discret. Appl. Math. 240: 1-2 (2018) - [j34]Antoine Deza, George Manoussakis, Shmuel Onn:
Primitive Zonotopes. Discret. Comput. Geom. 60(1): 27-39 (2018) - [j33]Antoine Deza, Kai Huang, Michael R. Metel:
Managing losses in exotic horse race wagering. J. Oper. Res. Soc. 69(3): 319-325 (2018) - [j32]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Optimization over Degree Sequences. SIAM J. Discret. Math. 32(3): 2067-2079 (2018) - 2017
- [j31]Antoine Deza, Frantisek Franek:
Bannai et al. method proves the d-step conjecture for strings. Discret. Appl. Math. 217: 488-494 (2017) - [j30]Nathan Chadder, Antoine Deza:
Computational determination of the largest lattice polytope diameter. Electron. Notes Discret. Math. 62: 105-110 (2017) - [i6]Nathan Chadder, Antoine Deza:
Computational determination of the largest lattice polytope diameter. CoRR abs/1704.01687 (2017) - [i5]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Optimization over Degree Sequences. CoRR abs/1706.03951 (2017) - 2016
- [j29]Antoine Deza, Frantisek Franek, Mei Jiang:
A computational substantiation of the d-step approach to the number of distinct squares problem. Discret. Appl. Math. 212: 81-87 (2016) - [j28]Haoyue Bai, Antoine Deza, Frantisek Franek:
Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22]. J. Discrete Algorithms 38-41: 50-51 (2016) - 2015
- [j27]Antoine Deza, Frantisek Franek, Adrien Thierry:
How many double squares can a string contain? Discret. Appl. Math. 180: 52-69 (2015) - [j26]Haoyue Bai, Antoine Deza, Frantisek Franek:
On a lemma of Crochemore and Rytter. J. Discrete Algorithms 34: 18-22 (2015) - [j25]Shinji Mizuno, Noriyoshi Sukegawa, Antoine Deza:
A primal-simplex based Tardos' algorithm. Oper. Res. Lett. 43(6): 625-628 (2015) - 2014
- [j24]Antoine Deza, Frantisek Franek:
A d-step approach to the maximum number of distinct squares and runs in strings. Discret. Appl. Math. 163: 268-274 (2014) - [j23]Antoine Deza, Frédéric Meunier, Pauline Sarrabezolles:
A Combinatorial Approach to Colourful Simplicial Depth. SIAM J. Discret. Math. 28(1): 306-322 (2014) - [i4]Antoine Deza, Kai Huang, Michael R. Metel:
Chance Constrained Optimization for Targeted Internet Advertising. CoRR abs/1407.7924 (2014) - 2013
- [j22]David Bremner, Antoine Deza, Hiroshi Imai, Sonoko Moriyama:
Editorial. Comput. Geom. 46(5): 493 (2013) - [j21]Andrew Baker, Antoine Deza, Frantisek Franek:
A computational framework for determining run-maximal strings. J. Discrete Algorithms 20: 43-50 (2013) - [j20]David Bremner, Antoine Deza, William Hua, Lars Schewe:
More bounds on the diameters of convex polytopes. Optim. Methods Softw. 28(3): 442-450 (2013) - [j19]Antoine Deza, Tamon Stephen, Feng Xie:
A Note on Lower Bounds for Colourful Simplicial Depth. Symmetry 5(1): 47-53 (2013) - 2012
- [j18]Andrew Baker, Antoine Deza, Frantisek Franek:
On the structure of run-maximal strings. J. Discrete Algorithms 10: 10-14 (2012) - [j17]Antoine Deza, Frantisek Franek, Min Jing Liu:
On a conjecture of Erdős for multiplicities of cliques. J. Discrete Algorithms 17: 9-14 (2012) - [c8]Antoine Deza, Frantisek Franek, Mei Jiang:
A Computational Framework for Determining Square-maximal Strings. Stringology 2012: 111-119 - [i3]Antoine Deza, Tamon Stephen, Feng Xie:
Computational Lower Bounds for Colourful Simplicial Depth. CoRR abs/1210.7621 (2012) - [i2]Antoine Deza, Frédéric Meunier, Pauline Sarrabezolles:
A combinatorial approach to colourful simplicial depth. CoRR abs/1212.4720 (2012) - 2011
- [j16]Antoine Deza, Tamon Stephen, Feng Xie:
More Colourful Simplices. Discret. Comput. Geom. 45(2): 272-278 (2011) - [c7]David Bremner, Antoine Deza, William Hua, Lars Schewe:
Pushing the boundaries of polytopal realizability. CCCG 2011 - [c6]Grant Custard, Antoine Deza, Tamon Stephen, Feng Xie:
Small Octahedral Systems. CCCG 2011 - [c5]Antoine Deza, Frantisek Franek, Mei Jiang:
A d-Step Approach for Distinct Squares in Strings. CPM 2011: 77-89 - [c4]Andrew Baker, Antoine Deza, Frantisek Franek:
A Parameterized Formulation for the Maximum Number of Runs Problem. Stringology 2011: 74-82 - [i1]Frédéric Meunier, Antoine Deza:
A further generalization of the colourful Carathéodory theorem. CoRR abs/1107.3380 (2011) - 2010
- [j15]Antoine Deza, Feng Xie:
On the generalized Berge sorting conjecture. J. Discrete Algorithms 8(1): 1-7 (2010)
2000 – 2009
- 2009
- [j14]Antoine Deza, Tamás Terlaky, Yuriy Zinchenko:
A Continuous d -Step Conjecture for Polytopes. Discret. Comput. Geom. 41(2): 318-327 (2009) - 2008
- [j13]Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky:
The colourful feasibility problem. Discret. Appl. Math. 156(11): 2166-2177 (2008) - [j12]Antoine Deza, Tamás Terlaky, Feng Xie, Yuriy Zinchenko:
Diameter and Curvature: Intriguing Analogies. Electron. Notes Discret. Math. 31: 221-225 (2008) - [j11]David Bremner, Antoine Deza, Michael Soltys:
Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. J. Comb. Optim. 16(4): 323 (2008) - [j10]Antoine Deza, Eissa Nematollahi, Tamás Terlaky:
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds. Math. Program. 113(1): 1-14 (2008) - [j9]Antoine Deza, Tamás Terlaky, Yuriy Zinchenko:
Polytopes and arrangements: Diameter and curvature. Oper. Res. Lett. 36(2): 215-222 (2008) - 2007
- [j8]Antoine Deza, Gabriel Indik:
A counterexample to the dominating set conjecture. Optim. Lett. 1(2): 163-169 (2007) - 2006
- [j7]Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky:
Colourful Simplicial Depth. Discret. Comput. Geom. 35(4): 597-615 (2006) - [j6]David Avis, Antoine Deza:
Un des "problèmes plaisans et délectables" de Claude Berge. Discret. Math. 306(19-20): 2299-2302 (2006) - [j5]Antoine Deza, Eissa Nematollahi, M. Reza Peyghami, Tamás Terlaky:
The central path visits all the vertices of the Klee-Minty cube. Optim. Methods Softw. 21(5): 851-865 (2006) - 2002
- [j4]Antoine Deza, Shmuel Onn:
Solitaire Lattices. Graphs Comb. 18(2): 227-243 (2002) - [c3]Antoine Deza, Komei Fukuda, Tomohiko Mizutani, Cong Vo:
On the Face Lattice of the Metric Polytope. JCDCG 2002: 118-128 - 2001
- [j3]David Avis, Antoine Deza:
On the binary solitaire cone. Discret. Appl. Math. 115(1-3): 3-14 (2001) - [j2]David Avis, Antoine Deza:
On the solitaire cone and its relationship to multi-commodity flows. Math. Program. 90(1): 27-57 (2001) - 2000
- [c2]Antoine Deza, Komei Fukuda, Dmitrii V. Pasechnik, Masanori Sato:
On the Skeleton of the Metric Polytope. JCDCG 2000: 125-136
1990 – 1999
- 1998
- [j1]Antoine Deza, Michel Deza, Viatcheslav P. Grishukhin:
Fullerenes and coordination polyhedra versus half-cube embeddings. Discret. Math. 192(1-3): 41-80 (1998) - 1995
- [c1]Antoine Deza, Michel Deza, Komei Fukuda:
On Skeletons, Diameters and Volumes of Metric Polyhedra. Combinatorics and Computer Science 1995: 112-128
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
