Michel Deza
Affiliations:- École Normale Supérieure, Paris, LIGA
According to our database1,
Michel Deza
authored at least 85 papers
between 1973 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on viaf.org
-
on id.loc.gov
-
on d-nb.info
-
on liga.ens.fr
-
on isni.org
On csauthors.net:
Bibliography
2020
Optim. Lett., 2020
2019
2018
J. Symb. Comput., 2018
2016
Int. Trans. Oper. Res., 2016
2015
2013
Ars Math. Contemp., 2013
Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013
2011
2010
2009
2008
Discret. Appl. Math., 2008
2007
Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007
2006
Dictionary of distances.
North-Holland, ISBN: 978-0-444-52087-6, 2006
2005
2004
Addition Patterns in Carbon Allotropes: Independence Numbers and <i>d-</i>Codes in the Klein and Related Graphs.
J. Chem. Inf. Model., 2004
Electron. J. Comb., 2004
Scale-isometric polytopal graphs in hypercubes and cubic lattices - polytopes in hypercubes and Z<sub>n</sub>.
Imperial College Press, ISBN: 978-1-86094-421-5, 2004
2003
J. Chem. Inf. Comput. Sci., 2003
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
2002
2001
Codes in Platonic, Archimedean, Catalan, and Related Polyhedra: A Model for Maximum Addition Patterns in Chemical Cages.
J. Chem. Inf. Comput. Sci., 2001
Allowed Boundary Sequences for Fused Polycyclic Patches and Related Algorithmic Problems.
J. Chem. Inf. Comput. Sci., 2001
2000
1998
Discret. Math., 1998
1997
Geometry of cuts and metrics.
Algorithms and combinatorics 15, Springer, ISBN: 978-3-540-61611-5, 1997
1996
Recognition of the<i>l</i><sub>1</sub>-Graphs with Complexity<i>O(nm), or</i>Football in a Hypercube.
Eur. J. Comb., 1996
1995
Proceedings of the Combinatorics and Computer Science, 1995
Proceedings of the Combinatorics and Computer Science, 1995
1994
1993
Proceedings of the Combinatorial Optimization, 1993
1992
1991
The cut cone, <i>L</i><sup>1</sup> embeddability, complexity, and multicommodity flows.
Networks, 1991
A characterization of {2v<sub>alpha+1</sub> + 2v<sub>beta+1</sub>, 2v<sub>alpha</sub> + 2v<sub>beta</sub>; t, q}- minihypers in PG(t, q) (t >= 2, q >= 5 and 0 >= alpha < beta < t) and its applications to error-correcting codes.
Discret. Math., 1991
1990
New Results on Facets of the Cut Cone.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990
Proceedings of the Applied Geometry And Discrete Mathematics, 1990
Proceedings of the Applied Geometry And Discrete Mathematics, 1990
1989
Discret. Math., 1989
A survey of recent works with respect to a characterization of an (n, k, d; q)-code meeting the Griesmer bound using a min·hyper in a finite projective geometry.
Discret. Math., 1989
1988
Characterization of {2(q+1)+2, 2;t, q}- min·hypers in PG(t, q) (t>=3, q>=5) and its applications to error-correcting codes.
Discret. Math., 1988
1987
1986
1983
1982
1981
1976
Matrices Dont Deux Lignes Quelconque Coïncident dans un Nombre Donne de Positions Communes.
J. Comb. Theory A, 1976
1975
Extension de quelques theoremes sur les densites de series d'elements de n a des series de sous-ensembles finis de n.
Discret. Math., 1975
1973
Une propriete extremale des plans projectifs finis dans une classe de codes equidistants.
Discret. Math., 1973