Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure. - Maxim A. Babenko (CSR, 2006)

On flows in simple bidirected and skew-symmetric networks. - Maxim A. Babenko (Probl. Inf. Transm., 2006)

Experimental Evaluation of Parametric Max-Flow Algorithms. - Maxim A. Babenko; Jonathan Derryberry; Andrew V. Goldberg; Robert Endre Tarjan; Yunhong Zhou (WEA, 2007)

Free multiflows in bidirected and skew-symmetric graphs. - Maxim A. Babenko; Alexander V. Karzanov (Discret. Appl. Math., 2007)

Computing Longest Common Substrings Via Suffix Arrays. - Maxim A. Babenko; Tatiana Starikovskaya (CSR, 2008)

A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem. - Maxim A. Babenko; Alexander V. Karzanov (ESA, 2008)

Minimum mean cycle problem in bidirected and skew-symmetric graphs. - Maxim A. Babenko; Alexander V. Karzanov (Discret. Optim., 2009)

A Faster Algorithm for the Maximum Even Factor Problem. - Maxim A. Babenko (ISAAC (1), 2010)

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

Triangle-Free 2-Matchings Revisited. - Maxim A. Babenko; Alexey Gusakov; Ilya P. Razenshteyn (Discret. Math. Algorithms Appl., 2010)

A Fast Algorithm for the Path 2-Packing Problem. - Maxim A. Babenko (Theory Comput. Syst., 2010)

New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs. - Maxim A. Babenko; Alexey Gusakov (STACS, 2011)

An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. - Maxim A. Babenko (Algorithmica, 2011)

Computing the longest common substring with one mismatch. - Maxim A. Babenko; Tatiana Starikovskaya (Probl. Inf. Transm., 2011)

Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph. - Maxim A. Babenko; Timofey A. Urbanovich (Probl. Inf. Transm., 2011)

An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks. - Maxim A. Babenko; Kamil Salikhov; Stepan Artamonov (COCOON, 2012)

Resilient Quicksort and Selection. - Maxim A. Babenko; Ivan Pouzyrevsky (CSR, 2012)

Improved Algorithms for Even Factors and Square-Free Simple b-Matchings. - Maxim A. Babenko (Algorithmica, 2012)

On Weighted Multicommodity Flows in Directed Networks - Maxim A. Babenko; Alexander V. Karzanov (CoRR, 2012)

Min-cost multiflows in node-capacitated undirected networks. - Maxim A. Babenko; Alexander V. Karzanov (J. Comb. Optim., 2012)

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

Flow Decompositions in External Memory. - Maxim A. Babenko (SOFSEM, 2013)

Substring Suffix Selection. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (CoRR, 2013)

Computing Minimal and Maximal Suffixes of a Substring Revisited. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (CPM, 2014)

A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes. - Maxim A. Babenko; Alexander V. Karzanov (CSR, 2015)

On the Complexity of Hub Labeling (Extended Abstract). - Maxim A. Babenko; Andrew V. Goldberg; Haim Kaplan; Ruslan Savchenko; Mathias Weller (MFCS (2), 2015)

Wavelet Trees Meet Suffix Trees. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (SODA, 2015)

On the Complexity of Hub Labeling. - Maxim A. Babenko; Andrew V. Goldberg; Haim Kaplan; Ruslan Savchenko; Mathias Weller (CoRR, 2015)

Algorithms for Hub Label Optimization. - Maxim A. Babenko; Andrew V. Goldberg; Anupam Gupta 001; Viswanath Nagarajan (ACM Trans. Algorithms, 2016)

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

Faster Algorithms for Half-Integral T-Path Packing. - Maxim A. Babenko; Stepan Artamonov (ISAAC, 2017)

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

A fast scaling algorithm for the weighted triangle-free 2-matching problem. - Stepan Artamonov; Maxim A. Babenko (Eur. J. Comb., 2018)

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

Search for the Global Extremum Using the Correlation Indicator for Neural Networks Supervised Learning. - Nikolay A. Vershkov; Maxim A. Babenko; Viktor Andreevich Kuchukov; Nataliya Nikolaevna Kuchukova (Program. Comput. Softw., 2020)

Packing Odd Walks and Trails in Multiterminal Networks. - Maxim Akhmedov; Maxim A. Babenko (STACS, 2023)

Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. - Stepan Artamonov; Maxim A. Babenko (Algorithmica, 2024)