Optimizing over All Combinatorial Embeddings of a Planar Graph
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Complexity of Orthogonal Compaction
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Computing Orthogonal Drawings in a Variable Embedding Setting
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Computing Optimal Embeddings for Planar Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Linear Time Implementation of SPQR-Trees
GD '00 Proceedings of the 8th 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
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On embedding a graph in the grid with the maximum number of bends and other bad features
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Minimum depth graph embeddings and quality of the drawings: an experimental analysis
GD'05 Proceedings of the 13th international conference on Graph Drawing
Hi-index | 0.00 |