Maxim A. Babenko

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 11

Top Topics

Text Compression

External Memory

Top Venues

Publications

Stepan Artamonov, Maxim A. Babenko
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. Algorithmica 86 (3) (2024)
Maxim Akhmedov, Maxim A. Babenko
Packing Odd Walks and Trails in Multiterminal Networks. STACS (2023)
Stepan Artamonov, Maxim A. Babenko
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. IWOCA (2022)
Nikolay A. Vershkov, Maxim A. Babenko, Viktor Andreevich Kuchukov, Nataliya Nikolaevna Kuchukova
Search for the Global Extremum Using the Correlation Indicator for Neural Networks Supervised Learning. Program. Comput. Softw. 46 (8) (2020)
Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov
Cascade Heap: Towards Time-Optimal Extractions. Theory Comput. Syst. 63 (4) (2019)
Maxim A. Babenko, Ignat I. Kolesnichenko
External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs. SOFSEM (2018)
Stepan Artamonov, Maxim A. Babenko
A fast scaling algorithm for the weighted triangle-free 2-matching problem. Eur. J. Comb. 68 (2018)
Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov
Cascade Heap: Towards Time-Optimal Extractions. CSR (2017)
Maxim A. Babenko, Stepan Artamonov
Faster Algorithms for Half-Integral T-Path Packing. ISAAC (2017)
Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan
Algorithms for Hub Label Optimization. ACM Trans. Algorithms 13 (1) (2016)
Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Ignat I. Kolesnichenko, Tatiana Starikovskaya
Computing minimal and maximal suffixes of a substring. Theor. Comput. Sci. 638 (2016)
Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller
On the Complexity of Hub Labeling. CoRR (2015)
Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller
On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) (2015)
Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
Wavelet Trees Meet Suffix Trees. SODA (2015)
Maxim A. Babenko, Alexander V. Karzanov
A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes. CSR (2015)
Stepan Artamonov, Maxim A. Babenko
A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem. IWOCA (2015)
Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
Computing Minimal and Maximal Suffixes of a Substring Revisited. CPM (2014)
Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
Wavelet Trees Meet Suffix Trees. CoRR (2014)
Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan
Algorithms for Hub Label Optimization. ICALP (1) (2013)
Maxim A. Babenko
Flow Decompositions in External Memory. SOFSEM (2013)
Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
Substring Suffix Selection. CoRR (2013)
Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana Starikovskaya
On Minimal and Maximal Suffixes of a Substring. CPM (2013)
Maxim A. Babenko, Kamil Salikhov, Stepan Artamonov
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks. COCOON (2012)
Maxim A. Babenko
Improved Algorithms for Even Factors and Square-Free Simple b-Matchings. Algorithmica 64 (3) (2012)
Maxim A. Babenko, Ivan Pouzyrevsky
Resilient Quicksort and Selection. CSR (2012)
Maxim A. Babenko, Alexander V. Karzanov
On Weighted Multicommodity Flows in Directed Networks CoRR (2012)
Maxim A. Babenko, Alexander V. Karzanov
Min-cost multiflows in node-capacitated undirected networks. J. Comb. Optim. 24 (3) (2012)
Maxim A. Babenko, Alexey Gusakov
New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs. STACS (2011)
Maxim A. Babenko, Timofey A. Urbanovich
Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph. Probl. Inf. Transm. 47 (3) (2011)
Maxim A. Babenko, Tatiana Starikovskaya
Computing the longest common substring with one mismatch. Probl. Inf. Transm. 47 (1) (2011)
Maxim A. Babenko
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. Algorithmica 61 (4) (2011)
Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. SOFSEM (2010)
Maxim A. Babenko
A Faster Algorithm for the Maximum Even Factor Problem CoRR (2010)
Maxim A. Babenko
A Faster Algorithm for the Maximum Even Factor Problem. ISAAC (1) (2010)
Maxim A. Babenko
A Fast Algorithm for the Path 2-Packing Problem. Theory Comput. Syst. 46 (1) (2010)
Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn
Triangle-Free 2-Matchings Revisited. Discret. Math. Algorithms Appl. 2 (4) (2010)
Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks CoRR (2010)
Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn
Triangle-Free 2-Matchings Revisited. COCOON (2010)
Maxim A. Babenko, Alexander V. Karzanov
Minimum mean cycle problem in bidirected and skew-symmetric graphs. Discret. Optim. 6 (1) (2009)
Maxim A. Babenko, Tatiana Starikovskaya
Computing Longest Common Substrings Via Suffix Arrays. CSR (2008)
Maxim A. Babenko
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. ISAAC (2008)
Maxim A. Babenko, Alexander V. Karzanov
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem. ESA (2008)
Maxim A. Babenko, Alexander V. Karzanov
Free multiflows in bidirected and skew-symmetric graphs. Discret. Appl. Math. 155 (13) (2007)
Maxim A. Babenko
A Fast Algorithm for Path 2-Packing Problem. CSR (2007)
Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou
Experimental Evaluation of Parametric Max-Flow Algorithms. WEA (2007)
Maxim A. Babenko
On flows in simple bidirected and skew-symmetric networks. Probl. Inf. Transm. 42 (4) (2006)
Maxim A. Babenko
Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure. CSR (2006)