A New Minimum Cost Flow Algorithm with Applications to Graph Drawing

Interactive Orthogonal Graph Drawing

IEEE Transactions on Computers

Computing Orthogonal Drawings with the Minimum Number of Bends

IEEE Transactions on Computers

Constraints in Graph Drawing Algorithms

Constraints

Upward Embeddings and Orientations of Undirected Planar Graphs

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures

Dynamic Grid Embedding with Few Bends and Changes

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation

Computing Orthogonal Drawings in a Variable Embedding Setting

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation

Planar Polyline Drawings with Good Angular Resolution

GD '98 Proceedings of the 6th International Symposium on Graph Drawing

Quasi-Upward Planarity

GD '98 Proceedings of the 6th International Symposium on Graph Drawing

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

GD '00 Proceedings of the 8th International Symposium on Graph Drawing

A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract)

GD '00 Proceedings of the 8th International Symposium on Graph Drawing

Extended Rectangular Drawings of Plane Graphs with Designated Corners

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing

Bend-Minimum Orthogonal Drawings of Plane 3-Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science

How to draw the minimum cuts of a planar graph

Computational Geometry: Theory and Applications

A new approximation algorithm for bend minimization in the Kandinsky model

GD'06 Proceedings of the 14th international conference on Graph drawing

Graph drawing algorithms

Algorithms and theory of computation handbook

Topology-driven force-directed algorithms

GD'10 Proceedings of the 18th international conference on Graph drawing

Confluent drawing algorithms using rectangular dualization

GD'10 Proceedings of the 18th international conference on Graph drawing

A grid-based coverage approach for target tracking in hybrid sensor networks

Journal of Systems and Software

Orthogonal drawings of series-parallel graphs with minimum bends

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Inner rectangular drawings of plane graphs

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Accelerated bend minimization

GD'11 Proceedings of the 19th international conference on Graph Drawing