Computational techniques
Geometry of numbers
- Coloring Voronoi Cells
- Delaunay and Voronoi partitions of lattices (poster)
- Geometry of Number - Delaunay polytopes in lattice
- Sphere packings and lattice sphere packings
- Crystallographic groups
- Computing Delaunay polytopes of lattices
- Lattice coverings and Delaunay polytopes
- Lattices and perfect form theory
- C-type, a generalization of L-types
- Practical computation of Hecke operators
- Canonical form of positive definite matrix
- The Vinberg algorithm for Lorentzian lattices: Algorithmic aspects
- Practical computations with indefinite forms
- High dimensional computation of fundamental domains
- T-spaces for algebraic ring of integers
Planar graphs
- Goldberg-Coxeter construction for 3- or 4-valent plane graphs
- Zigzag in plane graphs and generalizations
- Polycycles and their boundaries
- Zigzags and Central circuits for 3- or 4-valent plane graphs and generalizations.
- Fullerenes: applications and generalizations
- Elementary polycycles
- Polycycles and face-regular two-maps
- The parameterization of fullerenes
- Lego-like spheres and tori, enumeration and drawings
- Goldberg-Coxeter construction for 3- or 4-valent plane graphs (poster)