| 2023 | STACS | Packing Odd Walks and Trails in Multiterminal Networks. | Maxim Akhmedov, Maxim A. Babenko |
| 2022 | IWOCA | Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. | Stepan Artamonov, Maxim A. Babenko |
| 2018 | SOFSEM | External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs. | Maxim A. Babenko, Ignat I. Kolesnichenko |
| 2017 | CSR | Cascade Heap: Towards Time-Optimal Extractions. | Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov |
| 2017 | ISAAC | Faster Algorithms for Half-Integral T-Path Packing. | Maxim A. Babenko, Stepan Artamonov |
| 2015 | CSR | A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes. | Maxim A. Babenko, Alexander V. Karzanov |
| 2015 | IWOCA | A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem. | Stepan Artamonov, Maxim A. Babenko |
| 2015 | MFCS | On the Complexity of Hub Labeling (Extended Abstract). | Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller |
| 2015 | SODA | Wavelet Trees Meet Suffix Trees. | Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya |
| 2014 | CPM | Computing Minimal and Maximal Suffixes of a Substring Revisited. | Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya |
| 2013 | CPM | On Minimal and Maximal Suffixes of a Substring. | Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana Starikovskaya |
| 2013 | ICALP | Algorithms for Hub Label Optimization. | Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan |
| 2013 | SOFSEM | Flow Decompositions in External Memory. | Maxim A. Babenko |
| 2012 | COCOON | An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks. | Maxim A. Babenko, Kamil Salikhov, Stepan Artamonov |
| 2012 | CSR | Resilient Quicksort and Selection. | Maxim A. Babenko, Ivan Pouzyrevsky |
| 2011 | STACS | New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs. | Maxim A. Babenko, Alexey Gusakov |
| 2010 | COCOON | Triangle-Free 2-Matchings Revisited. | Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn |
| 2010 | ISAAC | A Faster Algorithm for the Maximum Even Factor Problem. | Maxim A. Babenko |
| 2010 | SOFSEM | A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. | Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn |
| 2008 | CSR | Computing Longest Common Substrings Via Suffix Arrays. | Maxim A. Babenko, Tatiana Starikovskaya |
| 2008 | ESA | A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem. | Maxim A. Babenko, Alexander V. Karzanov |
| 2008 | ISAAC | An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. | Maxim A. Babenko |
| 2007 | CSR | A Fast Algorithm for Path 2-Packing Problem. | Maxim A. Babenko |
| 2006 | CSR | Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure. | Maxim A. Babenko |