activity
20012026
most citedComplexity and algorithms for computing Voronoi cells of lattices

44 citations · 182 across the 28 of their papers we have counts for

collaborators
Showing math.COShow all

13 papers · 1 filter

math.CO2022

The Birkhoff polytope of the groups and

Mathieu Dutour Sikiric

We compute the set of facets of the polytope which is the convex hull of the Coxeter groups or : For the group we found orbits of fa…

math.CO2015★ 1 cited

Enumeration of the facets of cut polytopes over some highly symmetric graphs

Michel Deza, Mathieu Dutour Sikiric

We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with edges, including , , $K_{1,4,4…

math.CO2012★ 38 cited

Computing symmetry groups of polyhedra

David Bremner, Mathieu Dutour Sikiric, Dmitrii V. Pasechnik +2

Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups…

math.CO2011★ 1 cited

Fullerene-like spheres with faces of negative curvature

Mathieu Dutour Sikiric, Michel Deza, Mikhail Shtogrin

Given R\subset N, an (R,k)-s…

math.CO2010

Plane square tilings

Mathieu Dutour Sikirić

We consider here square tilings of the plane. By extending the formalism introduced in [3] we build a correspondence between plane maps endowed with an harmonic vector and square t…

math.CO2010

({2,3}, 6)-spheres and their generalizations

Michel Deza, Mathieu Dutour Sikiric

We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. S…