Glebov Aleksei Nikolaevich

Publications in Math-Net.Ru

1. Approximation algorithms for 2-PSP-2W-max and 2-CC-2W-max
   
   Sib. Èlektron. Mat. Izv., 20:2 (2023),  923–941
2. Path partitioning planar graphs with restrictions on short cycles
   
   Sib. Èlektron. Mat. Izv., 18:2 (2021),  975–984
3. A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP
   
   Diskretn. Anal. Issled. Oper., 27:3 (2020),  28–52
4. Vertex colourings of multigraphs with forbiddances on edges
   
   Sib. Èlektron. Mat. Izv., 17 (2020),  637–646
5. Colouring planar graphs with bounded monochromatic components
   
   Sib. Èlektron. Mat. Izv., 17 (2020),  513–520
6. A polynomial $3/5$-approximate algorithm for the asymmetric maximization version of $3$-PSP
   
   Diskretn. Anal. Issled. Oper., 26:2 (2019),  30–59
7. Path partitioning planar graphs of girth 4 without adjacent short cycles
   
   Sib. Èlektron. Mat. Izv., 15 (2018),  1040–1047
8. An enhancement of Nash–Williams' Theorem on edge arboricity of graphs
   
   Sib. Èlektron. Mat. Izv., 14 (2017),  1324–1329
9. $2/3$-approximation algorithm for the maximization version of the asymmetric two peripatetic salesman problem
   
   Diskretn. Anal. Issled. Oper., 21:6 (2014),  11–20
10. 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
11. 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
12. Polynomial algorithm with approximation ratio $7/9$ for maximum 2-PSP
    
    Diskretn. Anal. Issled. Oper., 18:4 (2011),  17–48
13. 7/5-approximation algorithm for 2-PSP on minimum with different weight functions
    
    Sib. Èlektron. Mat. Izv., 8 (2011),  296–309
14. Алгоритмы приближённого решения задачи о двух коммивояжёрах в полном графе с весами рёбер 1 и 2
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 14:2 (2007),  41–61
15. Path partitions of planar graphs
    
    Sib. Èlektron. Mat. Izv., 4 (2007),  450–459
16. Planar graphs without triangles adjacent to cycles of length from $3$ to $9$ are $3$-colorable
    
    Sib. Èlektron. Mat. Izv., 3 (2006),  428–440
17. On a language generated by smooth functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:1 (2004),  30–51
18. A sufficient condition for the 3-colorability of plane graphs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:1 (2004),  13–29
19. Sufficient conditions for planar graphs to be $2$-distance $(\Delta+1)$-colorable
    
    Sib. Èlektron. Mat. Izv., 1 (2004),  129–141
20. Continuation of a $3$-coloring from a $7$-face onto a plane graph without $3$-cycles
    
    Sib. Èlektron. Mat. Izv., 1 (2004),  117–128
21. Continuation of a 3-coloring from a 6-face to a plane graph without 3-cycles
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 10:3 (2003),  3–11
22. Estimates for the degeneracy number of intersection graphs of boxes on the plane depending on the girth
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:2 (2002),  3–20
23. On the continuation of a 3-coloring from two vertices in a plane graph without 3-cycles
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002),  3–26
24. On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001),  34–53
25. Minimal degrees and chromatic numbers of squares of planar graphs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001),  9–33
26. The structure of plane triangulations in terms of clusters and stars
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:2 (2001),  15–39
27. On a structural property of plane graphs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  5–19