Area requirement and symmetry display in drawing graphs
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
The Via Minimization Problem is NP-Complete
IEEE Transactions on Computers
On upward drawing testing of triconnected digraphs (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Optimal link path queries in a simple polygon
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A framework for dynamic graph drawing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An experimental comparison of three graph drawing algorithms (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Graph drawing and information visualization
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
An experimental study of the basis for graph drawing algorithms
Journal of Experimental Algorithmics (JEA)
Drawing planar partitions I: LL-drawings and LH-drawings
Proceedings of the fourteenth annual symposium on Computational geometry
Orthogonal graph drawing with constraints
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
Inserting an edge into a planar graph
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Schematization of road networks
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Graph drawing aesthetics and the comprehension of UML class diagrams: an empirical study
APVis '01 Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9
Constraints in Graph Drawing Algorithms
Constraints
Empirical Evaluation of Aesthetics-based Graph Layout
Empirical Software Engineering
Software—Practice & Experience
Topological Invariants for Lines
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Software Engineering
Embedding problems for paths with direction constrained edges
Theoretical Computer Science
Optimizing over All Combinatorial Embeddings of a Planar Graph
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Optimal Compaction of Orthogonal Grid Drawings
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
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
An Approach for Mixed Upward Planarization
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Dynamic Grid Embedding with Few Bends and Changes
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
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
Embedding Problems for Paths with Direction Constrained Edges
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Bend Minimization in Orthogonal Drawings Using Integer Programming
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Three Approaches to 3D-Orthogonal Box-Drawings
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Adding Constraints to an Algorithm for Orthogonal Graph Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Planar Polyline Drawings with Good Angular Resolution
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Improved Force-Directed Layouts
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Algorithmic Patterns for Orthogonal Graph Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
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
Refinement of Orthogonal Graph Drawings
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Framework for Drawing Planar Graphs with Curves and Polylines
GD '98 Proceedings of the 6th 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
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
Visualization of the Autonomous Systems Interconnections with HERMES
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
User Preference of Graph Layout Aesthetics: A UML Study
GD '00 Proceedings of the 8th 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
Orthogonal 3D Shapes of Theta Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Sketch-Driven Orthogonal Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Compact Encodings of Planar Orthogonal Drawings
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
Bend-Minimum Orthogonal Drawings of Plane 3-Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Towards area requirements for drawing hierarchically planar graphs
Theoretical Computer Science - Algorithms,automata, complexity and games
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
Volume upper bounds for 3D graph drawing
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
Flexible layering in hierarchical drawings with nodes of arbitrary size
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
A note on 3D orthogonal drawings with direction constrained edges
Information Processing Letters
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
Computational Geometry: Theory and Applications
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Orthogonal drawings of graphs with vertex and edge labels
Computational Geometry: Theory and Applications
Automatic drawing of statistical diagrams
SSDBM'1988 Proceedings of the 4th international conference on Statistical and Scientific Database Management
The Complexity of Counting Colourings of Subgraphs of the Grid
Combinatorics, Probability and Computing
SoftVis '06 Proceedings of the 2006 ACM symposium on Software visualization
Graph Visualization Techniques for Web Clustering Engines
IEEE Transactions on Visualization and Computer Graphics
Complexity results for three-dimensional orthogonal graph drawing
Journal of Discrete Algorithms
Cutting cycles of rods in space: hardness and approximation
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Finding a minimum medial axis of a discrete shape is NP-hard
Theoretical Computer Science
PSPACE-completeness of an escape problem
Information Processing Letters
Octagonal drawings of plane graphs with prescribed face areas
Computational Geometry: Theory and Applications
Planar Straight-Line Embedding of Double-Tree Scan Architecture on a Rectangular Grid
Fundamenta Informaticae
Maximum Parsimony for Tree Mixtures
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
GPSel: A Gestural Perceptual-Based Path Selection Technique
SG '09 Proceedings of the 10th International Symposium on Smart Graphics
Computational Geometry: Theory and Applications
Orthogonal drawings of graphs with vertex and edge labels
Computational Geometry: Theory and Applications
On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths
Electronic Notes in Theoretical Computer Science (ENTCS)
A new approximation algorithm for bend minimization in the Kandinsky model
GD'06 Proceedings of the 14th international conference on Graph drawing
The SPQR-tree data structure in graph drawing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
Area minimization for grid visibility representation of hierarchically planar graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
Algorithms and theory of computation handbook
Orthogonal graph drawing with flexibility constraints
GD'10 Proceedings of the 18th international conference on Graph drawing
Drawing ordered (k - 1)-ary trees on k-grids
GD'10 Proceedings of the 18th international conference on Graph drawing
Topology-driven force-directed algorithms
GD'10 Proceedings of the 18th international conference on Graph drawing
Human-centered visualization environments
Human-centered visualization environments
Stochastic minimum spanning trees in euclidean spaces
Proceedings of the twenty-seventh annual symposium on Computational geometry
A mixed-integer program for drawing high-quality metro maps
GD'05 Proceedings of the 13th international conference on Graph Drawing
Complexity results for three-dimensional orthogonal graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Minimum depth graph embeddings and quality of the drawings: an experimental analysis
GD'05 Proceedings of the 13th international conference on Graph Drawing
No-bend orthogonal drawings of series-parallel graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Orthogonal drawings of series-parallel graphs with minimum bends
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Non-planar orthogonal drawings with fixed topology
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
A topology-driven approach to the design of web meta-search clustering engines
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Hexagonal grid drawings: algorithms and lower bounds
GD'04 Proceedings of the 12th international conference on Graph Drawing
A note on the self-similarity of some orthogonal drawings
GD'04 Proceedings of the 12th international conference on Graph Drawing
Inner rectangular drawings of plane graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Octagonal drawings of plane graphs with prescribed face areas
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Manhattan-Geodesic embedding of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Layout techniques coupled with web2.0-based business process modeling
GD'09 Proceedings of the 17th international conference on Graph Drawing
Planar open rectangle-of-influence drawings with non-aligned frames
GD'11 Proceedings of the 19th international conference on Graph Drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
Overloaded orthogonal drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Hardness of approximate compaction for nonplanar orthogonal graph drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
On the hardness of point-set embeddability
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Simultaneous embedding of embedded planar graphs
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The DFS-heuristic for orthogonal graph drawing
Computational Geometry: Theory and Applications
A hierarchical tree layout algorithm with an application to corporate management in a change process
Expert Systems with Applications: An International Journal
Planar Straight-Line Embedding of Double-Tree Scan Architecture on a Rectangular Grid
Fundamenta Informaticae
Open rectangle-of-influence drawings of non-triangulated planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Circle-Representations of simple 4-regular planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
GD'12 Proceedings of the 20th international conference on Graph Drawing
GD'12 Proceedings of the 20th international conference on Graph Drawing
Layout Algorithm for Clustered Graphs to Analyze Community Interactions in Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Morphing orthogonal planar graph drawings
ACM Transactions on Algorithms (TALG)
Optimal orthogonal graph drawing with convex bend costs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
Theoretical Computer Science
Bend-optimal orthogonal graph drawing in the general position model
Computational Geometry: Theory and Applications
| Hi-index | 0.01 |