The computational complexity of weighted vertex coloring for P5, K2, 3, K+2, 3-free graphs. - Dmitriy S. Malyshev; Olga O. Razvenskaya; Panos M. Pardalos (Optim. Lett., 2021)

On linear algebraic algorithms for the subgraph matching problem and its variants. - Maxim D. Emelin; Ilya A. Khlystov; Dmitry S. Malyshev; Olga O. Razvenskaya (Optim. Lett., 2023)