Maxim A. Babenko

From MaRDI portal
Person:652531

Available identifiers

zbMath Open babenko.maxim-aMaRDI QIDQ652531

List of research outcomes

PublicationDate of PublicationType
Faster algorithm for finding maximum 1-restricted simple 2-matchings2024-03-25Paper
Packing Odd Walks and Trails in Multiterminal Networks2023-03-01Paper
Faster algorithm for finding maximum 1-restricted simple 2-matchings2022-08-30Paper
Faster algorithms for half-integral T -Path packing2020-11-25Paper
External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs2020-10-21Paper
Cascade heap: towards time-optimal extractions2019-07-04Paper
Algorithms for Hub Label Optimization2018-11-05Paper
Wavelet Trees Meet Suffix Trees2017-10-05Paper
Cascade heap: towards time-optimal extractions2017-08-22Paper
Computing minimal and maximal suffixes of a substring2016-06-16Paper
A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem2016-04-04Paper
A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes2015-10-20Paper
On the Complexity of Hub Labeling (Extended Abstract)2015-09-16Paper
Flow Decompositions in External Memory2014-11-04Paper
Computing Minimal and Maximal Suffixes of a Substring Revisited2014-06-30Paper
Algorithms for Hub Label Optimization2013-08-06Paper
On Minimal and Maximal Suffixes of a Substring2013-06-14Paper
Improved algorithms for even factors and square-free simple \(b\)-matchings2013-01-28Paper
Min-cost multiflows in node-capacitated undirected networks2013-01-03Paper
On Weighted Multicommodity Flows in Directed Networks2012-12-02Paper
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks2012-09-25Paper
Resilient Quicksort and Selection2012-09-10Paper
On flows in simple bidirected and skew-symmetric networks2012-05-09Paper
Computing the longest common substring with one mismatch2012-03-13Paper
Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph2012-03-13Paper
https://portal.mardi4nfdi.de/entity/Q31137162012-01-23Paper
An efficient scaling algorithm for the minimum weight bibranching problem2011-12-14Paper
TRIANGLE-FREE 2-MATCHINGS REVISITED2011-03-25Paper
A Faster Algorithm for the Maximum Even Factor Problem2010-12-09Paper
Triangle-Free 2-Matchings Revisited2010-07-20Paper
A fast algorithm for the path 2-packing problem2010-03-05Paper
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks2010-01-28Paper
Minimum mean cycle problem in bidirected and skew-symmetric graphs2009-04-17Paper
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem2009-01-29Paper
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem2008-11-25Paper
https://portal.mardi4nfdi.de/entity/Q35415052008-11-25Paper
Computing Longest Common Substrings Via Suffix Arrays2008-06-05Paper
A Fast Algorithm for Path 2-Packing Problem2008-06-03Paper
Free multiflows in bidirected and skew-symmetric graphs2007-09-18Paper
https://portal.mardi4nfdi.de/entity/Q52945592007-07-24Paper
Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure2007-05-02Paper
Optimum Branching Problem Revisited2006-11-15Paper
On Ear Decompositions of Strongly Connected Bidirected Graphs2006-09-08Paper
On a Problem Posed by Maurice Nivat2006-09-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Maxim A. Babenko