On floorplans of planar graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Euclidean representation of 3D electronic institutions: automatic generation
Proceedings of the working conference on Advanced visual interfaces
From graphs to Euclidean virtual worlds: visualization of 3D electronic institutions
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Confluent drawing algorithms using rectangular dualization
GD'10 Proceedings of the 18th international conference on Graph drawing
Adjacency-preserving spatial treemaps
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Bend-optimal orthogonal graph drawing in the general position model
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |