A unified approach to labeling graphical features
Proceedings of the fourteenth annual symposium on Computational geometry
Interactive Orthogonal Graph Drawing
IEEE Transactions on Computers
A new approximation algorithm for the planar augmentation problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
PILOT: an interactive tool for learning and grading
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
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
Software—Practice & Experience
Algorithms for the fixed linear crossing number problem
Discrete Applied Mathematics
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
Computing Optimal Embeddings for Planar Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Circular Drawings of Biconnected Graphs
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
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
Planar Polyline Drawings with Good Angular Resolution
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
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
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
Visualization of the Autonomous Systems Interconnections with HERMES
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A User Study in Similarity Measures for Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Layered drawings of directed graphs in three dimensions
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
Graph layering by promotion of nodes
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Journal of Experimental Algorithmics (JEA)
Algorithms for the multiple label placement problem
Computational Geometry: Theory and Applications
Graph Visualization Techniques for Web Clustering Engines
IEEE Transactions on Visualization and Computer Graphics
Maximum upward planar subgraphs of embedded planar digraphs
Computational Geometry: Theory and Applications
A New Approach to Exact Crossing Minimization
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Computing Maximum C-Planar Subgraphs
Graph Drawing
Experiments on exact crossing minimization using column generation
Journal of Experimental Algorithmics (JEA)
Orthogonal drawings of graphs with vertex and edge labels
Computational Geometry: Theory and Applications
Algorithms for the multiple label placement problem
Computational Geometry: Theory and Applications
Layer-free upward crossing minimization
Journal of Experimental Algorithmics (JEA)
Graph layering by promotion of nodes
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
GD'06 Proceedings of the 14th international conference on Graph drawing
Algorithms for the hypergraph and the minor crossing number problems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Efficient extraction of multiple kuratowski subdivisions
GD'07 Proceedings of the 15th international conference on Graph drawing
Maximum upward planar subgraphs of embedded planar digraphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Layer-free upward crossing minimization
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Topology-driven force-directed algorithms
GD'10 Proceedings of the 18th international conference on Graph drawing
Human-centered visualization environments
Human-centered visualization environments
Experiments on exact crossing minimization using column generation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
GD'05 Proceedings of the 13th international conference on Graph Drawing
Non-planar core reduction of graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Hierarchical layouts of directed graphs in three dimensions
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
Crossing reduction in circular layouts
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
GD'09 Proceedings of the 17th international conference on Graph Drawing
Advances in the planarization method: effective multiple edge insertions
GD'11 Proceedings of the 19th international conference on Graph Drawing
The open graph archive: a community-driven effort
GD'11 Proceedings of the 19th international conference on Graph Drawing
Journal of Experimental Algorithmics (JEA)
A branch-and-cut approach to the crossing number problem
Discrete Optimization
An SDP approach to multi-level crossing minimization
Journal of Experimental Algorithmics (JEA)
Grid sifting: Leveling and crossing reduction
Journal of Experimental Algorithmics (JEA)
Upward planarity testing via SAT
GD'12 Proceedings of the 20th international conference on Graph Drawing
Improving multiple aesthetics produces better graph drawings
Journal of Visual Languages and Computing
| Hi-index | 0.01 |