|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
1. |
V. E. Alekseev, D. V. Zakharova, “On linear spaces of bipartite graphs”, Zhurnal SVMO, 26:1 (2024), 11–19 |
1
|
|
2018 |
2. |
V. E. Alekseev, S. V. Sorochan, “New cases of the polynomial solvability of the independent set problem for graphs with forbidden paths”, Diskretn. Anal. Issled. Oper., 25:2 (2018), 5–18 ; J. Appl. Industr. Math., 12:2 (2018), 213–219 |
2
|
|
2016 |
3. |
V. E. Alekseev, D. V. Zakharova, “Independent sets in graphs without subtrees with many leaves”, Diskretn. Anal. Issled. Oper., 23:1 (2016), 5–16 ; J. Appl. Industr. Math., 10:1 (2016), 1–6 |
|
2012 |
4. |
V. E. Alekseev, D. B. Mokeev, “König graphs with respect to $3$-paths”, Diskretn. Anal. Issled. Oper., 19:4 (2012), 3–14 |
6
|
|
2011 |
5. |
D. S. Malyshev, V. E. Alekseev, “Boundary classes for the list-ranking problems in subclasses of forests”, Diskretn. Anal. Issled. Oper., 18:6 (2011), 61–70 |
5
|
|
2010 |
6. |
V. E. Alekseev, D. V. Zakharova, “Independence sets of graphs with bounded minors of the augmented incidence matrix”, Diskretn. Anal. Issled. Oper., 17:1 (2010), 3–10 ; J. Appl. Industr. Math., 5:1 (2011), 14–18 |
12
|
|
2009 |
7. |
V. E. Alekseev, S. V. Sorochan, “On the entropy minimal hereditary classes of coloured graphs”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 19–25 ; J. Appl. Industr. Math., 4:2 (2010), 143–146 |
|
2008 |
8. |
V. E. Alekseev, D. S. Malyshev, “A criterion for a class of graphs to be a boundary class and applications”, Diskretn. Anal. Issled. Oper., 15:6 (2008), 3–10 |
9
|
9. |
V. E. Alekseev, D. S. Malyshev, “Классы планарных графов с полиномиально разрешимой задачей о независимом множестве”, Diskretn. Anal. Issled. Oper., 15:1 (2008), 3–10 ; J. Appl. Industr. Math., 3:1 (2009), 1–4 |
10
|
|
2007 |
10. |
V. E. Alekseev, D. V. Zakharova, “On symmetric spaces of graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:1 (2007), 21–26 ; J. Appl. Industr. Math., 2:2 (2008), 151–154 |
2
|
11. |
V. E. Alekseev, “An upper bound for the number of maximal independent sets in a graph”, Diskr. Mat., 19:3 (2007), 84–88 ; Discrete Math. Appl., 17:4 (2007), 355–359 |
12
|
|
2000 |
12. |
V. E. Alekseev, S. V. Sorochan, “On the entropy of hereditary classes of oriented graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000), 20–28 |
3
|
13. |
V. E. Alekseev, S. V. Sorochan, “On the entropy of hereditary classes of colored graphs”, Diskr. Mat., 12:2 (2000), 99–102 ; Discrete Math. Appl., 10:3 (2000), 273–277 |
4
|
|
1999 |
14. |
V. E. Alekseev, “A polynomial algorithm for finding the largest independent sets in claw-free graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999), 3–19 |
27
|
|
1998 |
15. |
V. E. Alekseev, V. V. Lozin, “On local transformations of graphs that preserve the independence number”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:1 (1998), 3–19 |
7
|
|
1997 |
16. |
V. E. Alekseev, “On lower layers of a lattice of hereditary classes of graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997), 3–12 |
16
|
|
1992 |
17. |
V. E. Alekseev, D. V. Korobitsyn, “Complexity of some problems on hereditary classes of graphs”, Diskr. Mat., 4:4 (1992), 34–40 |
5
|
18. |
V. E. Alekseev, “Range of values of entropy of hereditary classes of graphs”, Diskr. Mat., 4:2 (1992), 148–157 ; Discrete Math. Appl., 3:2 (1993), 191–199 |
13
|
|
1980 |
19. |
V. E. Alekseev, V. N. Grigor'ev, N. S. Klimov, A. S. Myasnikov, A. V. Olenin, V. P. Tokarev, “Influence of the active-medium characteristics on the output power of an electron-beam-controlled $CO_2$ laser”, Kvantovaya Elektronika, 7:6 (1980), 1199–1202 [Sov J Quantum Electron, 10:6 (1980), 688–690 ] |
|
1974 |
20. |
V. E. Alekseev, “On the number of steiner triple systems”, Mat. Zametki, 15:5 (1974), 769–774 ; Math. Notes, 15:5 (1974), 461–464 |
5
|
|
1967 |
21. |
V. E. Alekseev, “The Skolem method for the construction of cyclic systems of Steiner triples”, Mat. Zametki, 2:2 (1967), 145–156 ; Math. Notes, 2:2 (1967), 571–576 |
4
|
|
Organisations |
|
|
|
|