Towards the Automatic Generation of Software Diagrams
IEEE Transactions on Software Engineering
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
A new approximation algorithm for the planar augmentation problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Software—Practice & Experience
IEEE Transactions on Software Engineering
Graph Drawing Algorithm Engineering with AGD
Revised Lectures on Software Visualization, International Seminar
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
Challenges in graph-based relational data visualization
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Journal of Visual Languages and Computing
Planarity testing and optimal edge insertion with embedding constraints
GD'06 Proceedings of the 14th international conference on Graph drawing
Layer-free upward crossing minimization
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Approximating the crossing number of graphs embeddable in any orientable surface
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Crossing minimization and layouts of directed hypergraphs with port constraints
GD'10 Proceedings of the 18th international conference on Graph drawing
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
GD'09 Proceedings of the 17th international conference on Graph Drawing
On rectilinear drawing of graphs
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
A branch-and-cut approach to the crossing number problem
Discrete Optimization
| Hi-index | 0.00 |