On orthogonal representations of graphs. - Vladimir E. Alekseev; Vadim V. Lozin (Discret. Math., 2001)

On easy and hard hereditary classes of graphs with respect to the independent set problem. - Vladimir E. Alekseev (Discret. Appl. Math., 2003)

Independent sets of maximum weight in (p, q)-colorable graphs. - Vladimir E. Alekseev; Vadim V. Lozin (Discret. Math., 2003)

Polynomial algorithm for finding the largest independent sets in graphs without forks. - Vladimir E. Alekseev (Discret. Appl. Math., 2004)

Local transformations of graphs preserving independence number. - Vladimir E. Alekseev; Vadim V. Lozin (Discret. Appl. Math., 2004)

Augmenting graphs for independent sets. - Vladimir E. Alekseev; Vadim V. Lozin (Discret. Appl. Math., 2004)

Boundary classes of graphs for the dominating set problem. - Vladimir E. Alekseev; Dmitry V. Korobitsyn; Vadim V. Lozin (Discret. Math., 2004)

New Results on Generalized Graph Coloring. - Vladimir E. Alekseev; Alastair Farrugia; Vadim V. Lozin (Discret. Math. Theor. Comput. Sci., 2004)

NP-hard graph problems and boundary classes of graphs. - Vladimir E. Alekseev; Rodica Boliac; Dmitry V. Korobitsyn; Vadim V. Lozin (Theor. Comput. Sci., 2007)

The Maximum Independent Set Problem in Planar Graphs. - Vladimir E. Alekseev; Vadim V. Lozin; Dmitriy S. Malyshev; Martin Milanic (MFCS, 2008)

König graphs for 3-paths and 3-cycles. - Vladimir E. Alekseev; Dmitry B. Mokeev (Discret. Appl. Math., 2016)

Graph parameters, implicit representations and factorial properties. - Bogdan Alecu; Vladimir E. Alekseev; Aistis Atminas; Vadim V. Lozin; Victor Zamaraev (Discret. Math., 2023)