A Layout algorithm for data flow diagrams
IEEE Transactions on Software Engineering
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
Proceedings of the International Conference on Electronic Publishing on Document manipulation and typography
DAG—a program that draws directed graphs
Software—Practice & Experience
Small sets supporting fary embeddings of planar graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An algorithm for drawing general undirected graphs
Information Processing Letters
A node-positioning algorithm for general trees
Software—Practice & Experience
Conceptual database design: an Entity-relationship approach
Conceptual database design: an Entity-relationship approach
Graph drawing by force-directed placement
Software—Practice & Experience
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Characterizing bar line-of-sight graphs
SCG '85 Proceedings of the first annual symposium on Computational geometry
Visualizing Abstract Objects and Relations
Visualizing Abstract Objects and Relations
Structured Systems Analysis: Tools and Techniques
Structured Systems Analysis: Tools and Techniques
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
What is a Good Diagram? A Pragmatic Approach
Proceedings of the Fourth International Conference on Entity-Relationship Approach
GraphEd: a Graphical Platform for the Implementation of Graph Algorithms
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Three-Dimensional Graph Drawing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Improved Algorithms and Bounds for Orthogonal Drawings
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A Better Heuristic for Orthogonal Graph Drawings
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
A More Compact Visibility Representation
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Drawing planar graphs
Graph drawing and information visualization
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
On Improving Orthogonal Drawings: The 4M-Algorithm
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A new approximation algorithm for bend minimization in the Kandinsky model
GD'06 Proceedings of the 14th international conference on Graph drawing
Biclique edge cover graphs and confluent drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Fast and simple approximation of the diameter and radius of a graph
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Non-planar orthogonal drawings with fixed topology
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
| Hi-index | 0.00 |