Maxim A. Babenko

According to our database, Maxim A. Babenko authored at least 37 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Packing Odd Walks and Trails in Multiterminal Networks.

Maxim Akhmedov, Maxim A. Babenko

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings.

Stepan Artamonov, Maxim A. Babenko

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2020

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

2018

External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs.

Maxim A. Babenko, Ignat I. Kolesnichenko

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017

Faster Algorithms for Half-Integral T-Path Packing.

Maxim A. Babenko, Stepan Artamonov

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Cascade Heap: Towards Time-Optimal Extractions.

Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov

Proceedings of the Computer Science - Theory and Applications, 2017

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

2015

On the Complexity of Hub Labeling.

Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller

CoRR, 2015

Wavelet Trees Meet Suffix Trees.

Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

On the Complexity of Hub Labeling (Extended Abstract).

Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem.

Stepan Artamonov, Maxim A. Babenko

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes.

Maxim A. Babenko, Alexander V. Karzanov

Proceedings of the Computer Science - Theory and Applications, 2015

2014

Computing Minimal and Maximal Suffixes of a Substring Revisited.

Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

Substring Suffix Selection.

Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya

CoRR, 2013

Flow Decompositions in External Memory.

Maxim A. Babenko

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Algorithms for Hub Label Optimization.

Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

On Minimal and Maximal Suffixes of a Substring.

Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana Starikovskaya

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012

Min-cost multiflows in node-capacitated undirected networks.

Maxim A. Babenko, Alexander V. Karzanov

J. Comb. Optim., 2012

On Weighted Multicommodity Flows in Directed Networks

Maxim A. Babenko, Alexander V. Karzanov

CoRR, 2012

Improved Algorithms for Even Factors and Square-Free Simple b-Matchings.

Maxim A. Babenko

Algorithmica, 2012

Resilient Quicksort and Selection.

Maxim A. Babenko, Ivan Pouzyrevsky

Proceedings of the Computer Science - Theory and Applications, 2012

An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks.

Maxim A. Babenko, Kamil Salikhov, Stepan Artamonov

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

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

Computing the longest common substring with one mismatch.

Maxim A. Babenko, Tatiana Starikovskaya

Probl. Inf. Transm., 2011

New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs.

Maxim A. Babenko, Alexey Gusakov

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010

A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks.

Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

A Faster Algorithm for the Maximum Even Factor Problem.

Maxim A. Babenko

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Triangle-Free 2-Matchings Revisited.

Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

Minimum mean cycle problem in bidirected and skew-symmetric graphs.

Maxim A. Babenko, Alexander V. Karzanov

Discret. Optim., 2009

2008

An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem.

Maxim A. Babenko

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem.

Maxim A. Babenko, Alexander V. Karzanov

Proceedings of the Algorithms, 2008

Computing Longest Common Substrings Via Suffix Arrays.

Maxim A. Babenko, Tatiana Starikovskaya

Proceedings of the Computer Science, 2008

2007

Free multiflows in bidirected and skew-symmetric graphs.

Maxim A. Babenko, Alexander V. Karzanov

Discret. Appl. Math., 2007

Experimental Evaluation of Parametric Max-Flow Algorithms.

Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

A Fast Algorithm for Path 2-Packing Problem.

Maxim A. Babenko

Proceedings of the Computer Science, 2007

2006

On flows in simple bidirected and skew-symmetric networks.

Maxim A. Babenko

Probl. Inf. Transm., 2006

Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure.

Maxim A. Babenko

Proceedings of the Computer Science, 2006