As many readers may know, graph theory is a fundamental branch of mathematics that
explores networks made up of nodes and edges, focusing on their paths, structures, and …

We give a deterministic m^1+o(1) time algorithm that computes exact maximum flows and
minimum-cost flows on directed graphs with m edges and polynomially bounded integral …

Efficient maximum flow algorithms Page 1 82 COMMUNICATIONS OF THE ACM | AUGUST
2014 | VOL. 57 | NO. 8 review articles THE MAXIMUM FLOW problem and its dual, the minimum …

The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph
G such that we may support insertions and deletions of edges in G as well as distance …

We obtain new parameterized algorithms for the classical problem of determining whether a
directed acyclic graph admits an upward planar drawing. Our results include a new fixed …

We present a nearly-linear time algorithm for finding a minimum-cost flow in planar graphs
with polynomially bounded integer costs and capacities. The previous fastest algorithm for …

A new algorithm is given to find a maximum flow in an undirected planar flow network in
O(n\log^2n) time, which is faster than the best method previously known by a factor of …

Rapid urbanization in China has prompted plenty of urban facilities to be constructed with
the expectation of harmonizing with the rapid growth of urban population. However …

The multi-commodity flow problem plays an important role in network optimization, routing,
and service scheduling. With the network partitioning and the intermittent connectivity, the …

We present an \mathcalO(n^3/2) algorithm for minimizing the number of bends in an
orthogonal drawing of a plane graph. It has been posed as a long standing open problem at …