default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaxim A. Babenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j16]Stepan Artamonov, Maxim A. Babenko:
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. Algorithmica 86(3): 717-734 (2024)- 2020
- [j15]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): 609-618 (2020) - 2019
- [j14]Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov:
Cascade Heap: Towards Time-Optimal Extractions. Theory Comput. Syst. 63(4): 637-646 (2019) - 2018
- [j13]Stepan Artamonov, Maxim A. Babenko:
A fast scaling algorithm for the weighted triangle-free 2-matching problem. Eur. J. Comb. 68: 3-23 (2018) - 2016
- [j12]Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan:
Algorithms for Hub Label Optimization. ACM Trans. Algorithms 13(1): 16:1-16:17 (2016) - [j11]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Ignat I. Kolesnichenko, Tatiana Starikovskaya:
Computing minimal and maximal suffixes of a substring. Theor. Comput. Sci. 638: 112-121 (2016) - 2012
- [j10]Maxim A. Babenko:
Improved Algorithms for Even Factors and Square-Free Simple b-Matchings. Algorithmica 64(3): 362-383 (2012) - [j9]Maxim A. Babenko, Alexander V. Karzanov:
Min-cost multiflows in node-capacitated undirected networks. J. Comb. Optim. 24(3): 202-228 (2012) - 2011
- [j8]Maxim A. Babenko:
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. Algorithmica 61(4): 898-922 (2011) - [j7]Maxim A. Babenko, Tatiana Starikovskaya:
Computing the longest common substring with one mismatch. Probl. Inf. Transm. 47(1): 28-33 (2011) - [j6]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): 269 (2011) - 2010
- [j5]Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn:
Triangle-Free 2-Matchings Revisited. Discret. Math. Algorithms Appl. 2(4): 643-654 (2010) - [j4]Maxim A. Babenko:
A Fast Algorithm for the Path 2-Packing Problem. Theory Comput. Syst. 46(1): 59-79 (2010) - 2009
- [j3]Maxim A. Babenko, Alexander V. Karzanov:
Minimum mean cycle problem in bidirected and skew-symmetric graphs. Discret. Optim. 6(1): 92-97 (2009) - 2007
- [j2]Maxim A. Babenko, Alexander V. Karzanov:
Free multiflows in bidirected and skew-symmetric graphs. Discret. Appl. Math. 155(13): 1715-1730 (2007) - 2006
- [j1]Maxim A. Babenko:
On flows in simple bidirected and skew-symmetric networks. Probl. Inf. Transm. 42(4): 356-370 (2006)
Conference and Workshop Papers
- 2023
- [c25]Maxim Akhmedov, Maxim A. Babenko:
Packing Odd Walks and Trails in Multiterminal Networks. STACS 2023: 5:1-5:19 - 2022
- [c24]Stepan Artamonov, Maxim A. Babenko:
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. IWOCA 2022: 86-100 - 2018
- [c23]Maxim A. Babenko, Ignat I. Kolesnichenko:
External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs. SOFSEM 2018: 295-304 - 2017
- [c22]Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov:
Cascade Heap: Towards Time-Optimal Extractions. CSR 2017: 62-70 - [c21]Maxim A. Babenko, Stepan Artamonov:
Faster Algorithms for Half-Integral T-Path Packing. ISAAC 2017: 8:1-8:12 - 2015
- [c20]Maxim A. Babenko, Alexander V. Karzanov:
A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes. CSR 2015: 53-66 - [c19]Stepan Artamonov, Maxim A. Babenko:
A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem. IWOCA 2015: 25-37 - [c18]Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) 2015: 62-74 - [c17]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Wavelet Trees Meet Suffix Trees. SODA 2015: 572-591 - 2014
- [c16]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Computing Minimal and Maximal Suffixes of a Substring Revisited. CPM 2014: 30-39 - 2013
- [c15]Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana Starikovskaya:
On Minimal and Maximal Suffixes of a Substring. CPM 2013: 28-37 - [c14]Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan:
Algorithms for Hub Label Optimization. ICALP (1) 2013: 69-80 - [c13]Maxim A. Babenko:
Flow Decompositions in External Memory. SOFSEM 2013: 146-156 - 2012
- [c12]Maxim A. Babenko, Kamil Salikhov, Stepan Artamonov:
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks. COCOON 2012: 109-120 - [c11]Maxim A. Babenko, Ivan Pouzyrevsky:
Resilient Quicksort and Selection. CSR 2012: 6-17 - 2011
- [c10]Maxim A. Babenko, Alexey Gusakov:
New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs. STACS 2011: 519-530 - 2010
- [c9]Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn:
Triangle-Free 2-Matchings Revisited. COCOON 2010: 120-129 - [c8]Maxim A. Babenko:
A Faster Algorithm for the Maximum Even Factor Problem. ISAAC (1) 2010: 451-462 - [c7]Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn:
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. SOFSEM 2010: 165-175 - 2008
- [c6]Maxim A. Babenko, Tatiana Starikovskaya:
Computing Longest Common Substrings Via Suffix Arrays. CSR 2008: 64-75 - [c5]Maxim A. Babenko, Alexander V. Karzanov:
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem. ESA 2008: 124-135 - [c4]Maxim A. Babenko:
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. ISAAC 2008: 232-245 - 2007
- [c3]Maxim A. Babenko:
A Fast Algorithm for Path 2-Packing Problem. CSR 2007: 70-81 - [c2]Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou:
Experimental Evaluation of Parametric Max-Flow Algorithms. WEA 2007: 256-269 - 2006
- [c1]Maxim A. Babenko:
Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure. CSR 2006: 23-34
Informal and Other Publications
- 2015
- [i6]Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling. CoRR abs/1501.02492 (2015) - 2014
- [i5]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Wavelet Trees Meet Suffix Trees. CoRR abs/1408.6182 (2014) - 2013
- [i4]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Substring Suffix Selection. CoRR abs/1309.5618 (2013) - 2012
- [i3]Maxim A. Babenko, Alexander V. Karzanov:
On Weighted Multicommodity Flows in Directed Networks. CoRR abs/1212.0224 (2012) - 2010
- [i2]Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn:
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. CoRR abs/1003.3085 (2010) - [i1]Maxim A. Babenko:
A Faster Algorithm for the Maximum Even Factor Problem. CoRR abs/1004.2115 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
