| Polynomial algorithm for finding the largest independent sets in graphs without forks VE Alekseev Discrete Applied Mathematics 135 (1-3), 3-16, 2004 | 150* | 2004 |
| On easy and hard hereditary classes of graphs with respect to the independent set problem VE Alekseev Discrete Applied Mathematics 132 (1-3), 17-26, 2003 | 132 | 2003 |
| NP-hard graph problems and boundary classes of graphs VE Alekseev, R Boliac, DV Korobitsyn, VV Lozin Theoretical Computer Science 389 (1-2), 219-236, 2007 | 116 | 2007 |
| On the entropy values of hereditary classes of graphs VE Alekseev Walter de Gruyter, Berlin/New York 3 (2), 191-200, 1993 | 79 | 1993 |
| On the local restrictions effect on the complexity of finding the graph independence number VE Alekseev Combinatorial-algebraic methods in applied mathematics 132, 3-13, 1983 | 76 | 1983 |
| The effect of local constraints on the complexity of determination of the graph independence number VE Alekseev Combinatorial-algebraic methods in applied mathematics, 3-13, 1982 | 70 | 1982 |
| On the number of maximal independent sets in graphs from hereditary classes VE Alekseev Combinatorial-algebraic methods in discrete optimization, University of …, 1991 | 67 | 1991 |
| Range of values of entropy of hereditary classes of graphs VE Alekseev Diskretnaya Matematika 4 (2), 148-157, 1992 | 59 | 1992 |
| Boundary classes of graphs for the dominating set problem VE Alekseev, DV Korobitsyn, VV Lozin Discrete Mathematics 285 (1-3), 1-6, 2004 | 53 | 2004 |
| Sorting algorithms with minimum memory VE Alekseev Cybernetics 5 (5), 642-648, 1969 | 53 | 1969 |
| On lower layers of a lattice of hereditary classes of graphs VE Alekseev Diskretnyi Analiz i Issledovanie Operatsii 4 (1), 3-12, 1997 | 37 | 1997 |
| Hereditary classes and coding of graphs VE Alekseev Problemy Kibernet 39, 151-164, 1982 | 36 | 1982 |
| Augmenting graphs for independent sets VE Alekseev, VV Lozin Discrete Applied Mathematics 145 (1), 3-10, 2004 | 35 | 2004 |
| The maximum independent set problem in planar graphs VE Alekseev, V Lozin, D Malyshev, M Milanič Mathematical Foundations of Computer Science 2008: 33rd International …, 2008 | 27 | 2008 |
| Independent sets of maximum weight in (p, q)-colorable graphs VE Alekseev, VV Lozin Discrete Mathematics 265 (1-3), 351-356, 2003 | 22 | 2003 |
| New results on generalized graph coloring VE Alekseev, A Farrugia, VV Lozin Discrete Mathematics & Theoretical Computer Science 6, 2004 | 19 | 2004 |
| An upper bound for the number of maximal independent sets in a graph VE Alekseev Walter de Gruyter 17 (4), 355-359, 2007 | 18 | 2007 |
| Complexity of some problems on hereditary classes of graphs VE Alekseev, DV Korobitsyn Diskretnaya Matematika 4 (4), 34-40, 1992 | 18 | 1992 |
| Planar graph classes with the independent set problem solvable in polynomial time VE Alekseev, DS Malyshev Journal of Applied and Industrial Mathematics 3 (1), 1, 2009 | 17 | 2009 |
| König graphs for 3-paths and 3-cycles VE Alekseev, DB Mokeev Discrete Applied Mathematics 204, 1-5, 2016 | 15 | 2016 |
Vadim LozinUniversity of Warwick在 warwick.ac.uk 的电子邮件经过验证
Vadim LozinUniversity of Warwick在 warwick.ac.uk 的电子邮件经过验证
Martin MilaničUniversity of Primorska, Koper, Slovenia在 upr.si 的电子邮件经过验证