Graph Applications in Programming
Programming and Computing Software
Planarity-preserving clustering and embedding for large planar graphs
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
On the Validity of Hierarchical Decompositions
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
GD '99 Proceedings of the 7th 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
Advances in C-Planarity Testing of Clustered Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A new approach for visualizing UML class diagrams
Proceedings of the 2003 ACM symposium on Software visualization
A topology-shape-metrics approach for the automatic layout of UML class diagrams
Proceedings of the 2003 ACM symposium on Software visualization
How to draw the minimum cuts of a planar graph
Computational Geometry: Theory and Applications
Automatic layout of UML class diagrams in orthogonal style
Information Visualization - Special issue: Software visualization
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Drawing c-planar biconnected clustered graphs
Discrete Applied Mathematics
Clustered Planarity: Clusters with Few Outgoing Edges
Graph Drawing
Computing Maximum C-Planar Subgraphs
Graph Drawing
Straight-Line Rectangular Drawings of Clustered Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Journal of Discrete Algorithms
Drawing graphs with nonuniform nodes using potential fields
Journal of Visual Languages and Computing
The SPQR-tree data structure in graph drawing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Efficient C-planarity testing for embedded flat clustered graphs with small faces
GD'07 Proceedings of the 15th international conference on Graph drawing
Clustered planarity: small clusters in Eulerian graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Confluent drawing algorithms using rectangular dualization
GD'10 Proceedings of the 18th international conference on Graph drawing
On embedding a cycle in a plane graph
GD'05 Proceedings of the 13th international conference on Graph Drawing
C-planarity of extrovert clustered graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Drawing graphs using modular decomposition
GD'05 Proceedings of the 13th international conference on Graph Drawing
Clustering cycles into cycles of clusters
GD'04 Proceedings of the 12th international conference on Graph Drawing
Splitting clusters to get c-planarity
GD'09 Proceedings of the 17th international conference on Graph Drawing
Implementing a partitioned 2-page book embedding testing algorithm
GD'12 Proceedings of the 20th international conference on Graph Drawing
Shrinking the search space for clustered planarity
GD'12 Proceedings of the 20th international conference on Graph Drawing
Toward a theory of planarity: hanani-tutte and planarity variants
GD'12 Proceedings of the 20th international conference on Graph Drawing
Theory and practice of graph drawing
GD'12 Proceedings of the 20th international conference on Graph Drawing
Completely connected clustered graphs
Journal of Discrete Algorithms
| Hi-index | 0.00 |