Michel Deza

According to our database1, Michel Deza authored at least 84 papers between 1973 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Protometrics.
Eur. J. Comb., 2019

Covering aspects of the Niemeier lattices.
Eur. J. Comb., 2019

The joint weight enumerator of an LCD code and its dual.
Discrete Applied Mathematics, 2019

2018
The hypermetric cone and polytope on eight vertices and some generalizations.
J. Symb. Comput., 2018

Zigzag Structure of Thin Chamber Complexes.
Discrete & Computational Geometry, 2018

2016
Enumeration of the facets of cut polytopes over some highly symmetric graphs.
ITOR, 2016

2015
Voronoi polytopes for polyhedral norms on lattices.
Discrete Applied Mathematics, 2015

2013
Maximum independent sets of the 120-cell and other regular polytopes.
Ars Math. Contemp., 2013

A Topological Interpretation of the Walk Distances.
Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

2011
Cones of partial metrics.
Contributions to Discrete Mathematics, 2011

2010
Some problems, I care most.
Eur. J. Comb., 2010

2009
Polyhexes that are l1 graphs.
Eur. J. Comb., 2009

2008
Filling of a given boundary by p-gons and related problems.
Discrete Applied Mathematics, 2008

Hypercube embedding of Wythoffians.
Ars Math. Contemp., 2008

2007
Voronoi L-types and hypermetrics.
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
Filling of a given boundary by p-gons and related problems.
Electronic Notes in Discrete Mathematics, 2005

Small cones of m-hemimetrics.
Discrete Mathematics, 2005

Zigzag Structures of Simple Two-Faced Polyhedra.
Combinatorics, Probability & Computing, 2005

2004
Zigzags, Railroads, and Knots in Fullerenes.
Journal of Chemical Information and Modeling, 2004

Addition Patterns in Carbon Allotropes: Independence Numbers and d-Codes in the Klein and Related Graphs.
Journal of Chemical Information and Modeling, 2004

Properties of parallelotopes equivalent to Voronoi's conjecture.
Eur. J. Comb., 2004

Goldberg-Coxeter Construction for 3- and 4-valent Plane Graphs.
Electr. J. Comb., 2004

Scale-isometric polytopal graphs in hypercubes and cubic lattices - polytopes in hypercubes and Zn.
Imperial College Press, ISBN: 978-1-86094-421-5, 2004

2003
Version of Zones and Zigzag Structure in Icosahedral Fullerenes and Icosadeltahedra.
Journal of Chemical Information and Computer Sciences, 2003

The Hypermetric Cone on Seven Vertices.
Experimental Mathematics, 2003

Lower bounds for embedding edit distance into normed spaces.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Isometric embedding of mosaics into cubic lattices.
Discrete Mathematics, 2002

2001
Preface.
Theor. Comput. Sci., 2001

Codes in Platonic, Archimedean, Catalan, and Related Polyhedra: A Model for Maximum Addition Patterns in Chemical Cages.
Journal of Chemical Information and Computer Sciences, 2001

Allowed Boundary Sequences for Fused Polycyclic Patches and Related Algorithmic Problems.
Journal of Chemical Information and Computer Sciences, 2001

2000
Pentaheptite Modifications of the Graphite Sheet.
Journal of Chemical Information and Computer Sciences, 2000

Fullerenes as Tilings of Surfaces.
Journal of Chemical Information and Computer Sciences, 2000

Lists of Face-Regular Polyhedra.
Journal of Chemical Information and Computer Sciences, 2000

Uniform Partitions of 3-space, their Relatives and Embedding.
Eur. J. Comb., 2000

n-Semimetrics.
Eur. J. Comb., 2000

Quasi-semi-metrics, Oriented Multi-cuts and Related Polyhedra.
Eur. J. Comb., 2000

Preface.
Eur. J. Comb., 2000

1998
Fullerenes and coordination polyhedra versus half-cube embeddings.
Discrete Mathematics, 1998

Preface.
Discrete Mathematics, 1998

1997
The skeleton of the 120-cell is not 5-gonal.
Discrete Mathematics, 1997

Clin D'oeil on L1-embeddable Planar Graphs.
Discrete Applied Mathematics, 1997

Geometry of cuts and metrics.
Algorithms and combinatorics 15, Springer, ISBN: 978-3-540-61611-5, 1997

1996
A Note on l1-rigid Planar Graphs.
Eur. J. Comb., 1996

Recognition of thel1-Graphs with ComplexityO(nm), orFootball in a Hypercube.
Eur. J. Comb., 1996

Cut Lattices and Equiangular Lines.
Eur. J. Comb., 1996

1995
Lattice-Free Polytopes and Their Diameter.
Discrete & Computational Geometry, 1995

Hypercube Embedding of Generalized Bipartite Metrics.
Discrete Applied Mathematics, 1995

L-polytopes and Equiangular Lines.
Discrete Applied Mathematics, 1995

Complementary l1-Graphs and Related Combinatorial Structures.
Proceedings of the Combinatorics and Computer Science, 1995

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

1994
A few applications of negative- type inequalities.
Graphs and Combinatorics, 1994

Projecting a Simplex onto Another One.
Eur. J. Comb., 1994

Collapsing and lifting for the cut cone.
Discrete Mathematics, 1994

Lattice Points of Cut Cones.
Combinatorics, Probability & Computing, 1994

1993
The cut cone III: On the role of triangle facets.
Graphs and Combinatorics, 1993

Dedication.
Eur. J. Comb., 1993

The even and odd cut polytopes.
Discrete Mathematics, 1993

The inequicut cone.
Discrete Mathematics, 1993

The hypermetric cone is polydedral.
Combinatorica, 1993

Hypermetrics in geometry of numbers.
Proceedings of the Combinatorial Optimization, 1993

1992
Facets for the cut cone II: Clique-web inequalities.
Math. Program., 1992

Facets for the cut cone I.
Math. Program., 1992

Clique-Web Facets for Multicut Polytopes.
Math. Oper. Res., 1992

The cut cone III: On the role of triangle facets.
Graphs and Combinatorics, 1992

Extension operations for cuts.
Discrete Mathematics, 1992

1991
The cut cone, L1 embeddability, complexity, and multicommodity flows.
Networks, 1991

A characterization of {2valpha+1 + 2vbeta+1, 2valpha + 2vbeta; t, q}- minihypers in PG(t, q) (t >= 2, q >= 5 and 0 >= alpha < beta < t) and its applications to error-correcting codes.
Discrete Mathematics, 1991

1990
New Results on Facets of the Cut Cone.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

Complete Descriptions of Small Multicut Polytopes.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

The Symmetries of the Cut Polytope and of Some Relatives.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989
Bouquets of geometric lattices: some algebraic and topological aspects.
Discrete Mathematics, 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.
Discrete Mathematics, 1989

1988
Rigid pentagons in hypercubes.
Graphs and Combinatorics, 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.
Discrete Mathematics, 1988

Intersection theorems in permutation groups.
Combinatorica, 1988

1987
The classification of finite connected hypermetric spaces.
Graphs and Combinatorics, 1987

1986
On Squashed Designs.
Discrete & Computational Geometry, 1986

1983
On Functions of Strenth t.
Combinatorica, 1983

1982
On the vector space of 0-configurations.
Combinatorica, 1982

1981
Every large set of equidistant (0, +1, -1)-vectors forms a sunflower.
Combinatorica, 1981

1976
Matrices Dont Deux Lignes Quelconque Coïncident dans un Nombre Donne de Positions Communes.
J. Comb. Theory, Ser. 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.
Discrete Mathematics, 1975

1973
Une propriete extremale des plans projectifs finis dans une classe de codes equidistants.
Discrete Mathematics, 1973


  Loading...