3 citations · 4 across the 8 of their papers we have counts for
9 papers
A combinatorial algorithm for the planar multiflow problem with demands located on three holes
Maxim A. Babenko, Alexander V. Karzanov
We consider an undirected multi(commodity)flow demand problem in which a supply graph is planar, each source-sink pair is located on one of three specified faces of the graph, and…
On Weighted Multicommodity Flows in Directed Networks
Maxim A. Babenko, Alexander V. Karzanov
Let be a directed graph with a set of terminals and nonnegative integer arc capacities . A feasible multiflow is a nonnegative real function $F(P…
Triangle-Free 2-Matchings Revisited
Maxim Babenko, Alexey Gusakov, Ilya Razenshteyn
A \emph{2-matching} in an undirected graph is a function such that for each node the sum of values on all edges i…
A Faster Algorithm for the Maximum Even Factor Problem
Maxim A. Babenko
Given a digraph , an \emph{even factor} is a subset of arcs that decomposes into a collection of node-disjoint paths and even cycles. Even factors in…
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
Maxim Babenko, Ignat Kolesnichenko, Ilya Razenshteyn
Consider an undirected graph and a set of six \emph{terminals} . The goal is to find a collection $\calP$ of thr…
On Min-Cost Multiflow Problem in Node-Capacitated Undirected Networks
Maxim A. Babenko, Alexander V. Karzanov
We consider an undirected graph with a set of terminals, and with nonnegative integer capacities and costs of nodes . A path…