Smaller planar triangle-free graphs that are not 3-list-colorable. - Alexei N. Glebov; Alexandr V. Kostochka; Vladimir A. Tashkinov (Discret. Math., 2005)

Planar graphs without cycles of length from 4 to 7 are 3-colorable. - Oleg V. Borodin; Alexei N. Glebov; André Raspaud; Mohammad R. Salavatipour (J. Comb. Theory B, 2005)

NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors. - Edward Gimadi; Alexey Baburin; Alexei N. Glebov; Artem V. Pyatkin (Electron. Notes Discret. Math., 2006)

A new upper bound on the cyclic chromatic number. - Oleg V. Borodin; Hajo Broersma; Alexei N. Glebov; Jan van den Heuvel (J. Graph Theory, 2007)

Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. - Oleg V. Borodin; Alexei N. Glebov; Mickaël Montassier; André Raspaud (J. Comb. Theory B, 2009)

Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. - Oleg V. Borodin; Alexei N. Glebov; André Raspaud (Discret. Math., 2010)

Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable. - Oleg V. Borodin; Alexei N. Glebov (J. Graph Theory, 2011)

A step towards the strong version of Havel's three color conjecture. - Oleg V. Borodin; Alexei N. Glebov; Tommy R. Jensen (J. Comb. Theory B, 2012)

Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph. - Eduard Kh. Gimadi; Alexei N. Glebov; A. A. Skretneva; O. Yu. Tsidulko; D. Zh. Zambalaeva (Discret. Appl. Math., 2015)