A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. - Maxim A. Babenko; Ignat I. Kolesnichenko; Ilya P. Razenshteyn (SOFSEM, 2010)

On Minimal and Maximal Suffixes of a Substring. - Maxim A. Babenko; Ignat I. Kolesnichenko; Tatiana Starikovskaya (CPM, 2013)

Computing minimal and maximal suffixes of a substring. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Ignat I. Kolesnichenko; Tatiana Starikovskaya (Theor. Comput. Sci., 2016)

External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs. - Maxim A. Babenko; Ignat I. Kolesnichenko (SOFSEM, 2018)

Cascade Heap: Towards Time-Optimal Extractions. - Maxim A. Babenko; Ignat I. Kolesnichenko; Ivan Smirnov (Theory Comput. Syst., 2019)