The following pages link to Maxim A. Babenko (Q652531):
Displaying 41 items.
- (Q294949) (redirect page) (← links)
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- (Q415696) (redirect page) (← links)
- On flows in simple bidirected and skew-symmetric networks (Q415697) (← links)
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- Computing the longest common substring with one mismatch (Q764249) (← links)
- Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph (Q764406) (← links)
- Minimum mean cycle problem in bidirected and skew-symmetric graphs (Q1013299) (← links)
- Min-cost multiflows in node-capacitated undirected networks (Q1928531) (← links)
- Improved algorithms for even factors and square-free simple \(b\)-matchings (Q1934309) (← links)
- Faster algorithm for finding maximum 1-restricted simple 2-matchings (Q2169943) (← links)
- A fast algorithm for the path 2-packing problem (Q2268342) (← links)
- Free multiflows in bidirected and skew-symmetric graphs (Q2381535) (← links)
- A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem (Q2798214) (← links)
- Resilient Quicksort and Selection (Q2907482) (← links)
- An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks (Q2914316) (← links)
- Flow Decompositions in External Memory (Q2927641) (← links)
- On the Complexity of Hub Labeling (Extended Abstract) (Q2946377) (← links)
- A Faster Algorithm for the Maximum Even Factor Problem (Q3060755) (← links)
- TRIANGLE-FREE 2-MATCHINGS REVISITED (Q3084696) (← links)
- (Q3113716) (← links)
- A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes (Q3194707) (← links)
- A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks (Q3401090) (← links)
- Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure (Q3434679) (← links)
- A Fast Algorithm for Path 2-Packing Problem (Q3499768) (← links)
- Computing Longest Common Substrings Via Suffix Arrays (Q3503625) (← links)
- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem (Q3541080) (← links)
- (Q3541505) (← links)
- Triangle-Free 2-Matchings Revisited (Q3578309) (← links)
- An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem (Q3596721) (← links)
- On Minimal and Maximal Suffixes of a Substring (Q4928556) (← links)
- Algorithms for Hub Label Optimization (Q4962649) (← links)
- External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs (Q5127184) (← links)
- Faster algorithms for half-integral T -Path packing (Q5136223) (← links)
- Computing Minimal and Maximal Suffixes of a Substring Revisited (Q5165588) (← links)
- (Q5294559) (← links)
- Algorithms for Hub Label Optimization (Q5326551) (← links)
- Wavelet Trees Meet Suffix Trees (Q5362987) (← links)
- Cascade heap: towards time-optimal extractions (Q5919538) (← links)
- Cascade heap: towards time-optimal extractions (Q5920058) (← links)
- Faster algorithm for finding maximum 1-restricted simple 2-matchings (Q6119828) (← links)
