Follow
Olga Razvenskaya
Olga Razvenskaya
HSE University
Verified email at hse.ru - Homepage
Title
Cited by
Cited by
Year
Two complexity results for the vertex coloring problem
DS Malyshev, OO Lobanova
Discrete Applied Mathematics 219, 158-166, 2017
262017
The computational complexity of weighted vertex coloring for -free graphs
DS Malyshev, OO Razvenskaya, PM Pardalos
Optimization Letters 15, 137-152, 2021
12021
Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes
OO Razvenskaya, DS Malyshev
Journal of Applied and Industrial Mathematics 15, 97-117, 2021
12021
The coloring problem for -free graphs and -free graphs is polynomial
DS Malyshev, OO Lobanova
arXiv preprint arXiv:1503.02550, 2015
12015
On linear algebraic algorithms for the subgraph matching problem and its variants
MD Emelin, IA Khlystov, DS Malyshev, OO Razvenskaya
Optimization Letters, 1-17, 2023
2023
Эффективная разрешимость задачи о взвешенной вершинной раскраске для некоторых двух наследственных классов графов
ОО Развенская, ДС Малышев
Дискретный анализ и исследование операций 28 (1), 15-47, 2021
2021
О новых алгоритмических приемах для задачи о взвешенной вершинной раскраске
ОО Развенская
Журнал Средневолжского математического общества 22 (4), 442-448, 2020
2020
On new algorithmic techniques for the weighted vertex coloring problem
OO Razvenskaya
Zhurnal Srednevolzhskogo Matematicheskogo Obshchestva 22 (4), 442-448, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–8