Sciact
  • EN
  • RU
Profile

Avgustinovich Sergei Vladimirovich

Employee

Science activity

Articles - 16


Articles (16) More info

1 Avgustinovich S. , Kitaev S. , Liese J. , Potapov V. , Taranenko A.
Singleton mesh patterns in multidimensional permutations
Journal of Combinatorial Theory. Series A. 2024. V.201. 105801 :1-27. DOI: 10.1016/j.jcta.2023.105801 WOS Scopus РИНЦ OpenAlex
2 Avgustinovich S. , Kitaev S. , Taranenko A.
On five types of crucial permutations with respect to monotone patterns
Electronic Journal of Combinatorics. 2023. V.30. N1. P1.40 :1-25. DOI: 10.37236/11500 WOS Scopus РИНЦ OpenAlex
3 Lisitsyna M.A. , Avgustinovich S.V.
On Perfect Colorings of Paths Divisible by a Matching
Journal of Applied and Industrial Mathematics. 2022. V.16. N1. P.98-104. DOI: 10.1134/S1990478922010094 Scopus РИНЦ OpenAlex
4 Avgustinovich S.V. , Vasil'eva A.Y.
Completely regular codes in the n-dimensional rectangular grid
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2022. V.19. N2. P.861-869. DOI: 10.33048/semi.2022.19.072 WOS Scopus РИНЦ
5 Potapov V.N. , Avgustinovich S.V.
Combinatorial Designs, Difference Sets, and Bent Functions as Perfect Colorings of Graphs and Multigraphs
Siberian Mathematical Journal. 2020. V.61. N5. P.867-877. DOI: 10.1134/s0037446620050109 WOS Scopus РИНЦ OpenAlex
6 Lisitsyna M.A. , Avgustinovich S.V. , Parshina O.G.
On perfect colorings of infinite multipath graphs
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2020. V.17. P.2084-2095. DOI: 10.33048/semi.2020.17.139 WOS Scopus РИНЦ OpenAlex
7 Avgustinovich S. , Cassaigne J. , Karhumäki J. , Puzynina S. , Saarela A.
On abelian saturated infinite words
Theoretical Computer Science. 2019. V.792. P.154-160. DOI: 10.1016/j.tcs.2018.05.013 WOS Scopus РИНЦ OpenAlex
8 Avgustinovich S.V. , Gorkunov E.V.
Maximum intersection of linear codes and codes equivalent to linear
Journal of Applied and Industrial Mathematics. 2019. V.13. N4. P.600-605. DOI: 10.1134/s1990478919040021 Scopus РИНЦ OpenAlex
9 Avgustinovich S.V. , Frid A.E. , Puzynina S.
Minimal complexity of equidistributed infinite permutations
European Journal of Combinatorics. 2017. V.65. P.24-36. DOI: 10.1016/j.ejc.2017.05.003 WOS Scopus РИНЦ OpenAlex
10 Avgustinovich S.V. , Krotov D.S. , Vasil'eva A.Y.
Completely regular codes in the infinite hexagonal grid
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2016. V.13. P.987-1016. DOI: 10.17377/semi.2016.13.079 WOS Scopus РИНЦ OpenAlex
11 Avgustinovich S. , Kitaev S. , Potapov V.N. , Vajnovszki V.
Gray coding cubic planar maps
Theoretical Computer Science. 2015. V.616. P.59-69. DOI: 10.1016/j.tcs.2015.12.013 WOS Scopus OpenAlex
12 Avgustinovich S.V. , Mogilnykh I.Y.
Induced perfect colorings
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2011. V.8. 316 :1-1.
13 Avgustinovich S.V. , Krotov D.S.
Embedding in a perfect code
Journal of Combinatorial Designs. 2009. V.17. N5. P.419-423. DOI: 10.1002/jcd.20207 WOS Scopus РИНЦ OpenAlex
14 Vasil'ev Y.L. , Avgustinovich S.V. , Krotov D.S.
On shifting sets in the binary hypercube
Journal of Applied and Industrial Mathematics. 2009. V.3. N2. P.290-296. DOI: 10.1134/s199047890902015x Scopus РИНЦ OpenAlex
15 Krotov D.S. , Avgustinovich S.V.
On the number of 1-perfect binary codes: a lower bound
IEEE Transactions on Information Theory. 2008. V.54. N4. P.1760-1765. DOI: 10.1109/tit.2008.917692 WOS Scopus РИНЦ OpenAlex
16 Avgustinovich S. , Mogilnykh I.
Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
Lecture Notes in Computer Science. 2008. P.11-19. DOI: 10.1007/978-3-540-87448-5_2 WOS Scopus РИНЦ OpenAlex

Identifiers

Scopus ID: 6602853061
Elibrary ID: 11067
ResearcherID: S-1291-2016

Degrees

2001 - Ph.D.