default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDViatcheslav P. Grishukhin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j21]Mathieu Dutour Sikiric
, Viatcheslav P. Grishukhin, Alexander Magazinov:
On the sum of a parallelotope and a zonotope. Eur. J. Comb. 42: 49-73 (2014)
2000 – 2009
- 2009
- [j20]Mathieu Dutour Sikiric, Viatcheslav P. Grishukhin:
The decomposition of the hypermetric cone into L-domains. Eur. J. Comb. 30(4): 853-865 (2009) - 2007
- [j19]Mathieu Dutour Sikiric, Viatcheslav P. Grishukhin:
How to compute the rank of a Delaunay polytope. Eur. J. Comb. 28(3): 762-773 (2007) - 2006
- [j18]Viatcheslav P. Grishukhin:
Infinite series of extreme Delaunay polytopes. Eur. J. Comb. 27(4): 481-495 (2006) - 2004
- [b1]Michel Marie Deza, Viatcheslav P. Grishukhin, Mikhail Shtogrin:
Scale-isometric polytopal graphs in hypercubes and cubic lattices - polytopes in hypercubes and Zn. Imperial College Press 2004, ISBN 978-1-86094-421-5, pp. I-IX, 1-175 - [j17]Michel Deza, Viatcheslav P. Grishukhin:
Properties of parallelotopes equivalent to Voronoi's conjecture. Eur. J. Comb. 25(4): 517-533 (2004) - 2002
- [j16]Peter Engel, Viatcheslav P. Grishukhin:
There are Exactly 222 L-types of Primitive Five-dimensional Lattices. Eur. J. Comb. 23(3): 275-279 (2002) - 2001
- [j15]Peter Engel, Viatcheslav P. Grishukhin:
An Example of a Non-simplicialL-type Domain. Eur. J. Comb. 22(4): 491-496 (2001) - [j14]Evgenii P. Baranovskii, Viatcheslav P. Grishukhin:
Non-rigidity Degree of a Lattice and Rigid Lattices. Eur. J. Comb. 22(7): 921-935 (2001) - [j13]Michel Deza, Patrick W. Fowler, Viatcheslav P. Grishukhin:
Allowed Boundary Sequences for Fused Polycyclic Patches and Related Algorithmic Problems. J. Chem. Inf. Comput. Sci. 41(2): 300-308 (2001)
1990 – 1999
- 1999
- [j12]Vladimir I. Danilov, Viatcheslav P. Grishukhin:
Maximal Unimodular Systems of Vectors. Eur. J. Comb. 20(6): 507-526 (1999) - 1998
- [j11]Antoine Deza, Michel Deza, Viatcheslav P. Grishukhin:
Fullerenes and coordination polyhedra versus half-cube embeddings. Discret. Math. 192(1-3): 41-80 (1998) - 1997
- [j10]Victor Chepoi, Michel Deza, Viatcheslav P. Grishukhin:
Clin D'oeil on L1-embeddable Planar Graphs. Discret. Appl. Math. 80(1): 3-19 (1997) - [j9]Michel Deza, Viatcheslav P. Grishukhin:
The skeleton of the 120-cell is not 5-gonal. Discret. Math. 165-166: 205-210 (1997) - [j8]Viatcheslav P. Grishukhin:
Regular Two-graphs from the Even Unimodular Lattice E8 + E8. Eur. J. Comb. 18(4): 391-407 (1997) - 1996
- [j7]Michel Deza, Viatcheslav P. Grishukhin:
Cut Lattices and Equiangular Lines. Eur. J. Comb. 17(2-3): 143-156 (1996) - 1995
- [j6]Michel Deza, Viatcheslav P. Grishukhin:
L-polytopes and Equiangular Lines. Discret. Appl. Math. 56(2-3): 181-214 (1995) - 1994
- [j5]Michel Deza, Viatcheslav P. Grishukhin:
Lattice Points of Cut Cones. Comb. Probab. Comput. 3: 191-214 (1994) - 1993
- [j4]Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent:
The hypermetric cone is polydedral. Comb. 13(4): 397-411 (1993) - [c2]Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent:
Hypermetrics in geometry of numbers. Combinatorial Optimization 1993: 1-109 - 1992
- [j3]David Avis, Viatcheslav P. Grishukhin:
A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems. Comput. Geom. 2: 241-254 (1992) - [j2]Viatcheslav P. Grishukhin:
Computing extreme rays of the metric cone for seven points. Eur. J. Comb. 13(3): 153-165 (1992) - 1990
- [j1]Viatcheslav P. Grishukhin:
All Facets of the Cut Cone Cn for n = 7 are Known. Eur. J. Comb. 11(2): 115-117 (1990) - [c1]Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent:
The Symmetries of the Cut Polytope and of Some Relatives. Applied Geometry And Discrete Mathematics 1990: 205-220
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
