|
|
Publications in Math-Net.Ru
-
Path partitioning planar graphs of girth 4 without adjacent short cycles
Sib. Èlektron. Mat. Izv., 15 (2018), 1040–1047
-
$2/3$-approximation algorithm for the maximization version of the asymmetric two peripatetic salesman problem
Diskretn. Anal. Issled. Oper., 21:6 (2014), 11–20
-
A partition of a planar graph with girth 6 into two forests containing no path of length greater than 4
Diskretn. Anal. Issled. Oper., 21:2 (2014), 33–51
-
An approximation algorithm for the minimum 2-PSP with different weight functions valued 1 and 2
Diskretn. Anal. Issled. Oper., 18:5 (2011), 11–37
-
Polynomial algorithm with approximation ratio $7/9$ for maximum 2-PSP
Diskretn. Anal. Issled. Oper., 18:4 (2011), 17–48
-
7/5-approximation algorithm for 2-PSP on minimum with different weight functions
Sib. Èlektron. Mat. Izv., 8 (2011), 296–309
-
Partition of a planar graph with girth 7 into two star forests
Diskretn. Anal. Issled. Oper., 16:3 (2009), 20–46
-
Path partitions of planar graphs
Sib. Èlektron. Mat. Izv., 4 (2007), 450–459
© , 2024