Search the dblp DataBase
Viatcheslav P. Grishukhin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent
The hypermetric cone is polydedral. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1993, v:13, n:4, pp:397-411 [Journal] - David Avis, Viatcheslav P. Grishukhin
A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 1992, v:2, n:, pp:241-254 [Journal] - Michel Deza, Viatcheslav P. Grishukhin
Lattice Points of Cut Cones. [Citation Graph (0, 0)][DBLP]
Combinatorics, Probability & Computing, 1994, v:3, n:, pp:191-214 [Journal] - Victor Chepoi, Michel Deza, Viatcheslav P. Grishukhin
Clin D'oeil on L1-embeddable Planar Graphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:80, n:1, pp:3-19 [Journal] - Michel Deza, Viatcheslav P. Grishukhin
L-polytopes and Equiangular Lines. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1995, v:56, n:2-3, pp:181-214 [Journal] - Evgenii P. Baranovskii, Viatcheslav P. Grishukhin
Non-rigidity Degree of a Lattice and Rigid Lattices. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 2001, v:22, n:7, pp:921-935 [Journal] - Vladimir I. Danilov, Viatcheslav P. Grishukhin
Maximal Unimodular Systems of Vectors. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 1999, v:20, n:6, pp:507-526 [Journal] - Michel Deza, Viatcheslav P. Grishukhin
Properties of parallelotopes equivalent to Voronoi's conjecture. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 2004, v:25, n:4, pp:517-533 [Journal] - Michel Deza, Viatcheslav P. Grishukhin
Cut Lattices and Equiangular Lines. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 1996, v:17, n:2-3, pp:143-156 [Journal] - Peter Engel, Viatcheslav P. Grishukhin
An Example of a Non-simplicialL-type Domain. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 2001, v:22, n:4, pp:491-496 [Journal] - Peter Engel, Viatcheslav P. Grishukhin
There are Exactly 222 L-types of Primitive Five-dimensional Lattices. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 2002, v:23, n:3, pp:275-279 [Journal] - Viatcheslav P. Grishukhin
Infinite series of extreme Delaunay polytopes. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 2006, v:27, n:4, pp:481-495 [Journal] - Viatcheslav P. Grishukhin
Regular Two-graphs from the Even Unimodular Lattice E8 + E8. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 1997, v:18, n:4, pp:391-407 [Journal] - Mathieu Dutour Sikiric, Viatcheslav P. Grishukhin
How to compute the rank of a Delaunay polytope. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 2007, v:28, n:3, pp:762-773 [Journal] - Michel Deza, Patrick W. Fowler, Viatcheslav P. Grishukhin
Allowed Boundary Sequences for Fused Polycyclic Patches and Related Algorithmic Problems. [Citation Graph (0, 0)][DBLP]
Journal of Chemical Information and Computer Sciences, 2001, v:41, n:2, pp:300-308 [Journal] - Antoine Deza, Michel Deza, Viatcheslav P. Grishukhin
Fullerenes and coordination polyhedra versus half-cube embeddings. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1998, v:192, n:1-3, pp:41-80 [Journal] - Michel Deza, Viatcheslav P. Grishukhin
The skeleton of the 120-cell is not 5-gonal. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1997, v:165, n:, pp:205-210 [Journal]
The decomposition of the hypermetric cone into L-domains. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002