| Publication | Date of Publication | Type |
|---|
A polynomial algorithm with asymptotic ratio \(2/3\) for the asymmetric maximization version of the \(m\)-PSP
Diskretnyi analiz i issledovanie operatsii | 2022-07-15 | Paper |
Path partitioning planar graphs with restrictions on short cycles
Sibirskie Elektronnye Matematicheskie Izvestiya | 2021-10-19 | Paper |
Vertex colourings of multigraphs with forbiddances on edges
Sibirskie Elektronnye Matematicheskie Izvestiya | 2020-05-21 | Paper |
Colouring planar graphs with bounded monochromatic components
Sibirskie Elektronnye Matematicheskie Izvestiya | 2020-05-21 | Paper |
A polynomial 3/5-approximate algorithm for the asymmetric maximization version of the 3-PSP
Journal of Applied and Industrial Mathematics | 2019-12-02 | Paper |
Path partitioning planar graphs of girth 4 without adjacent short cycles
Sibirskie Elektronnye Matematicheskie Izvestiya | 2018-10-31 | Paper |
Splitting a planar graph of girth 5 into two forests with trees of small diameter
Discrete Mathematics | 2018-05-24 | Paper |
An enhancement of Nash-Williams' theorem on edge arboricity of graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2018-05-23 | Paper |
An algorithm with approximation ratio 5/6 for the metric maximum \(m\)-PSP
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
\(7/5\)-approximation algorithm for 2-PSP on minimum with different weight functions
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
Discrete Applied Mathematics | 2015-09-30 | Paper |
Partition of a planar graph with girth 6 into two forests with chain length at most 4
Journal of Applied and Industrial Mathematics | 2015-07-27 | Paper |
A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem
Journal of Applied and Industrial Mathematics | 2015-07-27 | Paper |
A step towards the strong version of Havel's three color conjecture
Journal of Combinatorial Theory. Series B | 2013-01-14 | Paper |
| scientific article; zbMATH DE number 6007907 (Why is no real title available?) | 2012-02-20 | Paper |
| An approximation algorithm for the minimum 2-peripatetic salesman problem with different weight functions | 2012-02-20 | Paper |
| Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2 | 2012-02-10 | Paper |
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
Journal of Graph Theory | 2011-01-20 | Paper |
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
Discrete Mathematics | 2010-10-18 | Paper |
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
Journal of Combinatorial Theory. Series B | 2009-06-23 | Paper |
Path partitions of planar graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2008-04-14 | Paper |
Path partitions of planar graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2008-04-14 | Paper |
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
Sibirskie Elektronnye Matematicheskie Izvestiya | 2007-07-02 | Paper |
A new upper bound on the cyclic chromatic number
Journal of Graph Theory | 2007-01-24 | Paper |
Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)
Sibirskie Elektronnye Matematicheskie Izvestiya | 2005-12-19 | Paper |
Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
Sibirskie Elektronnye Matematicheskie Izvestiya | 2005-12-12 | Paper |
Smaller planar triangle-free graphs that are not 3-list-colorable
Discrete Mathematics | 2005-04-18 | Paper |
Planar graphs without cycles of length from 4 to 7 are 3-colorable
Journal of Combinatorial Theory. Series B | 2005-03-08 | Paper |
| scientific article; zbMATH DE number 2097483 (Why is no real title available?) | 2004-09-07 | Paper |
| scientific article; zbMATH DE number 2097480 (Why is no real title available?) | 2004-09-07 | Paper |
| scientific article; zbMATH DE number 2097035 (Why is no real title available?) | 2004-09-06 | Paper |
| scientific article; zbMATH DE number 1882350 (Why is no real title available?) | 2003-03-16 | Paper |
| scientific article; zbMATH DE number 1882351 (Why is no real title available?) | 2003-03-16 | Paper |
| scientific article; zbMATH DE number 1882353 (Why is no real title available?) | 2003-03-16 | Paper |
The structure of the planar triangulations in terms of bundles and stars
Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 | 2001-12-13 | Paper |
A structural property of planar graphs
Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 | 2001-06-10 | Paper |
