We give an algorithm that computes exact maximum flows and minimum-cost flows on
directed graphs with m edges and polynomially bounded integral demands, costs, and …

We present a universally-optimal distributed algorithm for the exact weighted min-cut. The
algorithm is guaranteed to complete in Õ (D+√ n) rounds on every graph, recovering the …

We initiate the study of matroid problems in a new oracle model called dynamic oracle. Our
algorithms in this model lead to new bounds for some classic problems, and a “unified” …

We present an algorithm that computes exact maximum flows and minimum-cost flows on
directed graphs with m edges and polynomially bounded integral demands, costs, and …

The maximal k-edge-connected subgraphs problem is a classical graph clustering problem
studied since the 70's. Surprisingly, no non-trivial technique for this problem in weighted …

The max-flow min-cut theorem in graph theory states that the maximum flow of a network is
equal to the minimum cut of edges of the flow network. Max-flow and min-cut are related as …

We present a combinatorial algorithm for computing exact maximum flows in directed graphs
with $ n $ vertices and edge capacities from $\{1,\dots, U\} $ in $ n^{2+ o (1)}\log U $ time …

This report documents the program and the outcomes of Dagstuhl Seminar 23422" Graph
Algorithms: Cuts, Flows, and Network Design". This seminar brought 25 leading researchers …

We present an algorithm that computes exact maximum flows and minimum-cost flows on
directed graphs with m edges and polynomially bounded integral demands, costs, and …