Orderly spanning trees with applications to graph encoding and graph drawing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Cooperation between Interactive Actions and Automatic Drawing in a Schematic Editor
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
On Improving Orthogonal Drawings: The 4M-Algorithm
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Drawing Outer-Planar Graphs in O(n log n) Area
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Some Applications of Orderly Spanning Trees in Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Box-Rectangular Drawings of Plane Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Compact floor-planning via orderly spanning trees
Journal of Algorithms
Identifying and locating–dominating codes in (random) geometric networks
Combinatorics, Probability and Computing
An application of well-orderly trees in graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
GD'09 Proceedings of the 17th international conference on Graph Drawing
The DFS-heuristic for orthogonal graph drawing
Computational Geometry: Theory and Applications
Bend-optimal orthogonal graph drawing in the general position model
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |