A new polynomial-time algorithm for linear programming
Combinatorica
Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
Flow in Planar Graphs with Multiple Sources and Sinks
SIAM Journal on Computing
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Maximum (s,t)-flows in planar networks in O(|V| log |V|) time
Journal of Computer and System Sciences
A better heuristic for orthogonal graph drawings
Computational Geometry: Theory and Applications
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
On the Computational Complexity of Upward and Rectilinear Planarity Testing
SIAM Journal on Computing
Dynamic Grid Embedding with Few Bends and Changes
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow
SIGAL '90 Proceedings of the International Symposium on Algorithms
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
Sketch-Driven Orthogonal Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
How to draw the minimum cuts of a planar graph
Computational Geometry: Theory and Applications
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
Discrete Applied Mathematics
Shortest paths in planar graphs with real lengths in O(n log2n/ log log n) time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Open rectangle-of-influence drawings of non-triangulated planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
We present an $\mathcal O( 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 Graph Drawing 2003, whether the bound of $\mathcal O(n^{7/4}\sqrt{\log n})$ shown by Garg and Tamassia in 1996 could be improved. To answer this question, we show how to solve the uncapacitated min-cost flow problem on a planar bidirected graph with bounded costs and face sizes in $\mathcal O(n^{3/2})$ time.