Бабенко Максим Александрович
Список публикаций:
Artamonov S., Babenko M. A. A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching
Problem, in: Combinatorial Algorithms. 26th International Workshop, IWOCA 2015, Verona, Italy,
October 5-7, 2015, Revised Selected Papers Vol. 9538. Switzerland : Springer International
Publishing, 2016. P. 25-37.
Babenko M. A., Goldberg A., Gupta A., Nagarajan V. Algorithms for Hub Label Optimization // ACM
Transactions on Algorithms. 2016. Vol. 13. No. 1
Maxim Babenko, Gawrychowski P., Kociumaka T., Kolesnichenko I., Starikovskaya T. Computing
minimal and maximal suffixes of a substring // Theoretical Computer Science. 2016. Vol. 638. P. 112121.
Babenko M. A., Karzanov A. A Combinatorial Algorithm for the Planar Multiflow Problem with Demands
Located on Three Holes, in: Computer Science -- Theory and Applications 10th International
Computer Science Symposium in Russia, CSR 2015 Vol. 9139. Springer, 2015. P. 53-66.
Babenko M. A., Goldberg A., Weller M., Savchenko R., Kaplan H. On the Complexity of Hub Labeling
(Extended Abstract), in: Mathematical Foundations of Computer Science 2015 Vol. 9235. Springer,
2015. P. 62-74.
Babenko M. A., Gawrychowski P., Kociumaka T., Starikovskaya T. Wavelet Trees Meet Suffix Trees,
in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. San Diego : SIAM, 2015.
P. 572-591.
Babenko M. A., Kociumaka T., Gawrychowski P., Starikovskaya T. Computing Minimal and Maximal
Suffixes of a Substring Revisited, in: Lecture Notes in Computer Science Vol. 8486: Proceedings of
the 25th Annual Symposium on Combinatorial Pattern Matching. Springer Verlag, 2014. P. 30-39.
Babenko Maxim, Goldberg A. V., Gupta A., Nagarajan V. Algorithms for Hub Label Optimization //
Lecture Notes in Computer Science. 2013. Vol. 7965. No. PART 1. P. 69-80.
Babenko Maxim. Flow Decompositions in External Memory // Lecture Notes in Computer Science.
2013. Vol. 7741. P. 146-156.
Babenko Maxim, Ignat Kolesnichenko, Starikovskaya T. On Minimal and Maximal Suffixes of a
Substring // Lecture Notes in Computer Science. 2013. Vol. 7922. P. 28-37.
Babenko M. A., Artamonov S. I., Salikhov K. An Improved Algorithm for Packing T-Paths in Inner
Eulerian Networks // Lecture Notes in Computer Science. 2012. No. 7434. P. 109-120.
Babenko M. A. Improved Algorithms for Even Factors and Square-Free Simple b-Matchings //
Algorithmica. 2012. Vol. 64. No. 3. P. 362-383.
Babenko M. A., Karzanov A. V. Min-Cost Multiflows in Node-Capacitated Undirected Networks //
Journal of Combinatorial Optimization. 2012. Vol. 24. No. 3. P. 202-228.
Babenko M. A., Pouzyrevsky I. V. Resilient Quicksort and Selection // Lecture Notes in Computer
Science. 2012. No. 7353. P. 6-17.
Бабенко М. А., Стариковская Т. А. Вычисление длиннейшей общей подстроки с одной
ошибкой // Проблемы передачи информации. 2011. Т. 47. № 1. С. 28-33.
Babenko M. A. A Fast Algorithm for the Path 2-Packing Problem // Theory of Computing Systems.
2010. No. 46(1). P. 59-79.
Babenko Maxim A., Ignat I. Kolesnichenko, Ilya P. Razenshteyn A Linear Time Algorithm for
Finding Three Edge-Disjoint Paths in Eulerian Networks // Lecture Notes in Computer Science.
2010. № 5901. С. 165-175.
Babenko M. A., Razenshteyn I. P., Gusakov A. Triangle-Free 2-Matching Revisited // Lecture Notes
in Computer Science, 2010. No. 6196. P. 120-129.
Babenko M. A., An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem //
Lecture Notes in Computer Science 2008. Vol. 5369. P. 232–245.
Babenko M. A., Karzanov A. V. A Scaling Algorithm for the Maximum Node-Capacitated
Multiflow Problem// LectureNotesinComputerScience. 2008. Vol. 5193. P. 124–135.
Babenko M. A., Starikovskaya T. Computing Longest Common Substrings Via Suffix Arrays //
Lecture Notes in Computer Science, 2008. Vol. 5010: Proceedings of the Third International
Computer Science Symposium in Russia. Berlin : Springer Verlag, 2008. P. 64-75.
Babenko M. A., J. Derryberry, A. Goldberg, R. Tarjan, Y. Zhou. Experimental Evalulation of
Parametric Max-Flow Algorithms// Lecture Notes in Computer Science. 2007. V. 4525. P. 256–
269.
Babenko M. A., Karzanov A. V. Free Multiflows in Bidirected and Skew-Symmetric Graphs //
Discrete Applied Mathematics. 2007. V. 155. P. 1715–1730.
Babenko M. A. A Fast Algorithm for Path 2-Packing Problem // Lecture Notes in Computer
Science. 2007. V. 4649. P. 70–81.
Babenko M. A. Acyclic Bidirected and Skew-symmetric Graphs: Algorithms and Structure //
Lecture Notes in Computer Science. 2006. V. 3967. P. 23–34.
Бабенко М.А. Об одном приложении теории ациклических кососимметрических графов //
Вестн. Моск. ун-та. Сер. 1, Математика. Механика. 2007. №2. С. 65–66.
Бабенко М.А. О потоках в простых двунаправленных и кососимметрических сетях //
Проблемы передачи информации. 2006. T. 42. №4. С. 104–120
Бабенко М.А. Быстрый алгоритм построения декомпозиции многополюсных потоков //
Вестн. Моск. ун-та. Сер. 1, Математика. Механика. 2006. №2. С. 53–55.