×

zbMATH — the first resource for mathematics

Babenko, Maxim A.

Compute Distance To:
Author ID: babenko.maxim-a Recent zbMATH articles by "Babenko, Maxim A."
Published as: Babenko, Maxim; Babenko, Maxim A.; Babenko, M. A.; Babenko, M.
External Links: MGP
Documents Indexed: 38 Publications since 2006

Publications by Year

Citations contained in zbMATH Open

22 Publications have been cited 49 times in 39 Documents Cited by Year
Wavelet trees meet suffix trees. Zbl 1372.68070
Babenko, Maxim; Gawrychowski, Paweł; Kociumaka, Tomasz; Starikovskaya, Tatiana
7
2015
Computing the longest common substring with one mismatch. Zbl 1232.68189
Babenko, M. A.; Starikovskaya, T. A.
4
2011
Free multiflows in bidirected and skew-symmetric graphs. Zbl 1152.90574
Babenko, Maxim A.; Karzanov, Alexander V.
4
2007
New exact and approximation algorithms for the star packing problem in undirected graphs. Zbl 1230.68083
Babenko, Maxim; Gusakov, Alexey
4
2011
Min-cost multiflows in node-capacitated undirected networks. Zbl 1261.90067
Babenko, Maxim A.; Karzanov, Alexander V.
3
2012
Improved algorithms for even factors and square-free simple \(b\)-matchings. Zbl 1257.05050
Babenko, Maxim A.
3
2012
A scaling algorithm for the maximum node-capacitated multiflow problem. Zbl 1158.90318
Babenko, Maxim A.; Karzanov, Alexander V.
3
2008
Triangle-free 2-matchings revisited. Zbl 1216.05109
Babenko, Maxim; Gusakov, Alexey; Razenshteyn, Ilya
3
2010
A fast algorithm for the path 2-packing problem. Zbl 1183.68716
Babenko, Maxim A.
2
2010
Computing longest common substrings via suffix arrays. Zbl 1142.68592
Babenko, Maxim A.; Starikovskaya, Tatiana A.
2
2008
Acyclic bidirected and skew-symmetric graphs: Algorithms and structure. Zbl 1185.05133
Babenko, Maxim A.
2
2006
Triangle-free 2-matchings revisited. Zbl 1286.05129
Babenko, Maxim; Gusakov, Alexey; Razenshteyn, Ilya
2
2010
Cascade heap: towards time-optimal extractions. Zbl 06763496
Babenko, Maxim; Kolesnichenko, Ignat; Smirnov, Ivan
1
2017
A fast scaling algorithm for the weighted triangle-free 2-matching problem. Zbl 1373.05146
Artamonov, S.; Babenko, M.
1
2018
A fast scaling algorithm for the weighted triangle-free 2-matching problem. Zbl 1417.05158
Artamonov, Stepan; Babenko, Maxim
1
2016
Algorithms for hub label optimization. Zbl 1336.68287
Babenko, Maxim; Goldberg, Andrew V.; Gupta, Anupam; Nagarajan, Viswanath
1
2013
An efficient scaling algorithm for the minimum weight bibranching problem. Zbl 1275.68157
Babenko, Maxim A.
1
2011
Resilient quicksort and selection. Zbl 1360.68390
Babenko, Maxim; Pouzyrevsky, Ivan
1
2012
A fast algorithm for path 2-packing problem. Zbl 1188.05145
Babenko, Maxim A.
1
2007
An efficient scaling algorithm for the minimum weight bibranching problem. Zbl 1183.68715
Babenko, Maxim A.
1
2008
A faster algorithm for the maximum even factor problem. Zbl 1311.05181
Babenko, Maxim A.
1
2010
On the complexity of hub labeling (extended abstract). Zbl 1465.68054
Babenko, Maxim; Goldberg, Andrew V.; Kaplan, Haim; Savchenko, Ruslan; Weller, Mathias
1
2015
A fast scaling algorithm for the weighted triangle-free 2-matching problem. Zbl 1373.05146
Artamonov, S.; Babenko, M.
1
2018
Cascade heap: towards time-optimal extractions. Zbl 06763496
Babenko, Maxim; Kolesnichenko, Ignat; Smirnov, Ivan
1
2017
A fast scaling algorithm for the weighted triangle-free 2-matching problem. Zbl 1417.05158
Artamonov, Stepan; Babenko, Maxim
1
2016
Wavelet trees meet suffix trees. Zbl 1372.68070
Babenko, Maxim; Gawrychowski, Paweł; Kociumaka, Tomasz; Starikovskaya, Tatiana
7
2015
On the complexity of hub labeling (extended abstract). Zbl 1465.68054
Babenko, Maxim; Goldberg, Andrew V.; Kaplan, Haim; Savchenko, Ruslan; Weller, Mathias
1
2015
Algorithms for hub label optimization. Zbl 1336.68287
Babenko, Maxim; Goldberg, Andrew V.; Gupta, Anupam; Nagarajan, Viswanath
1
2013
Min-cost multiflows in node-capacitated undirected networks. Zbl 1261.90067
Babenko, Maxim A.; Karzanov, Alexander V.
3
2012
Improved algorithms for even factors and square-free simple \(b\)-matchings. Zbl 1257.05050
Babenko, Maxim A.
3
2012
Resilient quicksort and selection. Zbl 1360.68390
Babenko, Maxim; Pouzyrevsky, Ivan
1
2012
Computing the longest common substring with one mismatch. Zbl 1232.68189
Babenko, M. A.; Starikovskaya, T. A.
4
2011
New exact and approximation algorithms for the star packing problem in undirected graphs. Zbl 1230.68083
Babenko, Maxim; Gusakov, Alexey
4
2011
An efficient scaling algorithm for the minimum weight bibranching problem. Zbl 1275.68157
Babenko, Maxim A.
1
2011
Triangle-free 2-matchings revisited. Zbl 1216.05109
Babenko, Maxim; Gusakov, Alexey; Razenshteyn, Ilya
3
2010
A fast algorithm for the path 2-packing problem. Zbl 1183.68716
Babenko, Maxim A.
2
2010
Triangle-free 2-matchings revisited. Zbl 1286.05129
Babenko, Maxim; Gusakov, Alexey; Razenshteyn, Ilya
2
2010
A faster algorithm for the maximum even factor problem. Zbl 1311.05181
Babenko, Maxim A.
1
2010
A scaling algorithm for the maximum node-capacitated multiflow problem. Zbl 1158.90318
Babenko, Maxim A.; Karzanov, Alexander V.
3
2008
Computing longest common substrings via suffix arrays. Zbl 1142.68592
Babenko, Maxim A.; Starikovskaya, Tatiana A.
2
2008
An efficient scaling algorithm for the minimum weight bibranching problem. Zbl 1183.68715
Babenko, Maxim A.
1
2008
Free multiflows in bidirected and skew-symmetric graphs. Zbl 1152.90574
Babenko, Maxim A.; Karzanov, Alexander V.
4
2007
A fast algorithm for path 2-packing problem. Zbl 1188.05145
Babenko, Maxim A.
1
2007
Acyclic bidirected and skew-symmetric graphs: Algorithms and structure. Zbl 1185.05133
Babenko, Maxim A.
2
2006

Citations by Year