| Publication | Date of Publication | Type |
|---|
The perfect colorings of circulant graphs with a large number of colors
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-11-26 | Paper |
Small length circuits in Eulerian orientations of graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-11-26 | Paper |
Completely regular codes in the \(n\)-dimensional rectangular grid
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-11-25 | Paper |
Test fragments of perfect colorings of circulant graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-08-14 | Paper |
Singleton mesh patterns in multidimensional permutations
Journal of Combinatorial Theory. Series A | 2023-11-29 | Paper |
On five types of crucial permutations with respect to monotone patterns
The Electronic Journal of Combinatorics | 2023-03-21 | Paper |
On perfect colorings of paths divisible by a matching
Diskretnyi analiz i issledovanie operatsii | 2023-02-21 | Paper |
Maximum intersection of linear codes and codes equivalent to linear
Diskretnyi analiz i issledovanie operatsii | 2022-07-15 | Paper |
On five types of crucial permutations with respect to monotone patterns
(available as arXiv preprint) | 2022-06-24 | Paper |
On perfect colorings of infinite multipath graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2021-02-09 | Paper |
Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs
Siberian Mathematical Journal | 2020-09-30 | Paper |
On abelian saturated infinite words
Theoretical Computer Science | 2019-10-07 | Paper |
On automorphisms of linear codes over a prime field
Sibirskie Elektronnye Matematicheskie Izvestiya | 2017-09-11 | Paper |
Multiplicities of eigenvalues of the star graph
Sibirskie Elektronnye Matematicheskie Izvestiya | 2017-09-06 | Paper |
Perfect colorings of the prism graph
Sibirskie Elektronnye Matematicheskie Izvestiya | 2017-09-06 | Paper |
Completely regular codes in the infinite hexagonal grid
Sibirskie Elektronnye Matematicheskie Izvestiya | 2017-09-06 | Paper |
Minimal complexity of equidistributed infinite permutations
European Journal of Combinatorics | 2017-08-31 | Paper |
Weak abelian periodicity of infinite words
Theory of Computing Systems | 2017-01-18 | Paper |
On square-free permutations
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
On antipodal properties for eigenfunctions of graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2016-07-28 | Paper |
On vectors of minimal support in transitive linear spaces
Sibirskie Elektronnye Matematicheskie Izvestiya | 2016-07-28 | Paper |
On the partition of a set of edges of a graph into isomorphic trees.
Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 | 2016-06-22 | Paper |
Gray coding cubic planar maps
Theoretical Computer Science | 2016-01-21 | Paper |
In memory of Dmitriĭ Germanovich Fon-Der-Flaass
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
Induced perfect colorings
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
Crucial and bicrucial permutations with respect to arithmetic monotone patterns
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
Crucial and bicrucial permutations with respect to arithmetic monotone patterns
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
Ergodic infinite permutations of minimal complexity
Lecture Notes in Computer Science | 2015-11-10 | Paper |
Canonical representatives of morphic permutations
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Computation complexity of a ternary linear function
Journal of Applied and Industrial Mathematics | 2015-07-17 | Paper |
| Distance Regular Colorings of $n$-Dimensional Rectangular Grid | 2014-12-24 | Paper |
Weak abelian periodicity of infinite words
Lecture Notes in Computer Science | 2013-06-14 | Paper |
Avoidance of boxed mesh patterns on permutations
Discrete Applied Mathematics | 2012-11-22 | Paper |
On abelian versions of critical factorization theorem
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
On abelian versions of critical factorization theorem
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
| scientific article; zbMATH DE number 6007898 (Why is no real title available?) | 2012-02-20 | Paper |
| Perfect 2-colorings of the Johnson graphs \(J(8,3)\) and \(J(8,4)\) | 2012-02-20 | Paper |
| scientific article; zbMATH DE number 6007891 (Why is no real title available?) | 2012-02-20 | Paper |
| On mobile sets in the binary hypercube | 2012-02-10 | Paper |
| Multidimensional permanents in enumeration problems | 2012-02-10 | Paper |
Embedding in a perfect code
Journal of Combinatorial Designs | 2010-07-13 | Paper |
On shortest crucial words avoiding abelian powers
Discrete Applied Mathematics | 2010-05-05 | Paper |
On the Number of $1$-Perfect Binary Codes: A Lower Bound
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Testing Sets for 1-Perfect Code
Lecture Notes in Computer Science | 2009-01-22 | Paper |
| Reconstruction theorems for centered functions and perfect codes | 2008-12-11 | Paper |
| Reconstruction theorems for centered functions and perfect codes | 2008-12-11 | Paper |
Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
Coding Theory and Applications | 2008-11-25 | Paper |
On partitions of an \(n\)-cube into nonequivalent perfect codes
Problems of Information Transmission | 2008-09-02 | Paper |
On uniquely \(k\)-determined permutations
Discrete Mathematics | 2008-03-13 | Paper |
On periodicity of two-dimensional words
Theoretical Computer Science | 2008-03-05 | Paper |
Testing sets for 1-perfect codes
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Canonical Decomposition of a Regular Factorial Language
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Sequences of low arithmetical complexity
RAIRO - Theoretical Informatics and Applications | 2007-02-20 | Paper |
Sequences of low arithmetical complexity
RAIRO - Theoretical Informatics and Applications | 2007-02-20 | Paper |
Sequences of low arithmetical complexity
RAIRO - Theoretical Informatics and Applications | 2007-02-20 | Paper |
| scientific article; zbMATH DE number 5054189 (Why is no real title available?) | 2006-09-14 | Paper |
On intersection problem for perfect binary codes
Designs, Codes and Cryptography | 2006-05-29 | Paper |
On the ranks and kernels problem for perfect codes
Problems of Information Transmission | 2005-09-14 | Paper |
On the structure of symmetry groups of Vasil'ev codes
Problems of Information Transmission | 2005-09-08 | Paper |
To the metrical rigidity of binary codes
Problems of Information Transmission | 2005-08-17 | Paper |
A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
International Journal of Algebra and Computation | 2005-06-07 | Paper |
| scientific article; zbMATH DE number 2165229 (Why is no real title available?) | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2154100 (Why is no real title available?) | 2005-04-08 | Paper |
The classification of some perfect codes
Designs, Codes and Cryptography | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 1811346 (Why is no real title available?) | 2002-10-06 | Paper |
| scientific article; zbMATH DE number 1811359 (Why is no real title available?) | 2002-10-06 | Paper |
| scientific article; zbMATH DE number 1809720 (Why is no real title available?) | 2002-09-30 | Paper |
Intersection matrices for partitions by binary perfect codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1740040 (Why is no real title available?) | 2002-05-14 | Paper |
Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances
Discrete Applied Mathematics | 2002-01-30 | Paper |
Cartesian products of graphs and metric spaces
European Journal of Combinatorics | 2001-12-30 | Paper |
| On the metrical rigidity of binary codes | 2001-10-15 | Paper |
On distance regularity of perfect binary codes
Problems of Information Transmission | 2000-11-26 | Paper |
| scientific article; zbMATH DE number 1498828 (Why is no real title available?) | 2000-09-03 | Paper |
| scientific article; zbMATH DE number 1498782 (Why is no real title available?) | 2000-09-03 | Paper |
| scientific article; zbMATH DE number 1188976 (Why is no real title available?) | 1999-11-01 | Paper |
| scientific article; zbMATH DE number 1285452 (Why is no real title available?) | 1999-05-10 | Paper |
Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components
Problems of Information Transmission | 1998-11-20 | Paper |
| scientific article; zbMATH DE number 1188975 (Why is no real title available?) | 1998-11-05 | Paper |
On nonsystematic perfect binary codes.
Problems of Information Transmission | 1998-08-19 | Paper |
On the extendability of code isometries
Journal of Geometry | 1998-06-22 | Paper |
| scientific article; zbMATH DE number 919263 (Why is no real title available?) | 1997-02-17 | Paper |
| scientific article; zbMATH DE number 850320 (Why is no real title available?) | 1996-09-23 | Paper |
On isometry of close-packed binary codes
Siberian Advances in Mathematics | 1996-08-20 | Paper |
| scientific article; zbMATH DE number 808803 (Why is no real title available?) | 1996-03-17 | Paper |
| On a property of perfect binary codes | 1995-01-01 | Paper |
| scientific article; zbMATH DE number 4218321 (Why is no real title available?) | 1995-01-01 | Paper |
Vector summation within minimal angle
Computational Geometry | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 3841779 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3742619 (Why is no real title available?) | 1980-01-01 | Paper |
Combinatorial designs, difference sets and bent functions as perfect colorings of graphs and multigraphs
(available as arXiv preprint) | N/A | Paper |
