|
|
Publications in Math-Net.Ru |
Citations |
|
2019 |
1. |
N. V. Prytkov, A. L. Perezhogin, “Hamiltonian connectivity of diagonal grid graphs”, Sib. Èlektron. Mat. Izv., 16 (2019), 2080–2089 |
|
2018 |
2. |
A. S. Parfinenko, A. L. Perezhogin, “The functional graph of a linear discrete dynamical system with two dominating vertices”, Diskretn. Anal. Issled. Oper., 25:4 (2018), 81–96 ; J. Appl. Industr. Math., 12:4 (2018), 706–715 |
1
|
|
2017 |
3. |
I. S. Bykov, A. L. Perezhogin, “On distance Gray codes”, Diskretn. Anal. Issled. Oper., 24:2 (2017), 5–17 ; J. Appl. Industr. Math., 11:2 (2017), 185–192 |
2
|
4. |
A. E. Malykh, A. L. Perezhogin, “Constructive Approach to Enumerating the Spectra of Gray Codes in Boolean Cubes of Small Dimension”, Novosibirsk State University Journal of Information Technologies, 15:4 (2017), 32–42 |
1
|
|
2016 |
5. |
N. V. Prytkov, A. L. Perezhogin, “Recovery algorithms for discrete dynamic system with threshold functions”, Tr. SPIIRAN, 49 (2016), 66–79 |
1
|
|
2014 |
6. |
A. M. Nazhmidenova, A. L. Perezhogin, “A discrete dynamical system on a double circulant”, Diskretn. Anal. Issled. Oper., 21:4 (2014), 80–88 ; J. Appl. Industr. Math., 8:4 (2014), 568–573 |
3
|
|
2013 |
7. |
A. L. Perezhogin, “Simple cycles in the $n$-cube with a large group of automorphisms”, Diskretn. Anal. Issled. Oper., 20:4 (2013), 88–97 ; J. Appl. Industr. Math., 7:4 (2013), 567–573 |
|
2011 |
8. |
A. A. Evdokimov, A. L. Perezhogin, “Discrete dynamical systems of a circulant type with linear functions at vertices of network”, Diskretn. Anal. Issled. Oper., 18:3 (2011), 39–48 ; J. Appl. Industr. Math., 6:2 (2012), 160–166 |
9
|
|
2010 |
9. |
A. L. Perezhogin, “About straight automorphisms of Hamilton cycles in the Boolean $n$-cube”, Diskretn. Anal. Issled. Oper., 17:4 (2010), 32–42 ; J. Appl. Industr. Math., 5:3 (2011), 410–416 |
1
|
|
2007 |
10. |
A. L. Perezhogin, “Об автоморфизмах циклов в $n$-мерном булевом кубе”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:3 (2007), 67–79 |
6
|
|
2005 |
11. |
A. L. Perezhogin, “On special perfect matchings in a Boolean cube”, Diskretn. Anal. Issled. Oper., Ser. 1, 12:4 (2005), 51–59 |
2
|
|
2001 |
12. |
A. L. Perezhogin, V. N. Potapov, “On the number of Hamiltonian cycles in a Boolean cube”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:2 (2001), 52–62 |
6
|
|
1999 |
13. |
A. L. Perezhogin, “On cyclic enumerations of binary sets in terms of given distances”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:2 (1999), 62–69 |
1
|
|
1998 |
14. |
A. L. Perezhogin, “On cyclic $\langle m,n\rangle$-numerations”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998), 61–70 |
1
|
|
1997 |
15. |
A. A. Evdokimov, A. L. Perezhogin, “Minimal numerations of subsets of a finite set, and the problem of the Hamiltonicity of the graph of the middle layers of a hypercube”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:4 (1997), 6–12 |
2
|
|
1996 |
16. |
A. L. Perezhogin, “On a locally isometric coding of natural numbers”, Diskretn. Anal. Issled. Oper., 3:4 (1996), 69–76 |
6
|
|
Presentations in Math-Net.Ru |
|
|
Organisations |
|
|
|
|