Maxim A. Babenko

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