A spectral algorithm for envelope reduction of sparse matrices
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Two New Heuristics for Two-Sided Bipartite Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
ICGT '02 Proceedings of the First International Conference on Graph Transformation
A Multi-scale Algorithm for the Linear Arrangement Problem
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Experiments on the minimum linear arrangement problem
Journal of Experimental Algorithmics (JEA)
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Graph minimum linear arrangement by multilevel weighted edge contractions
Journal of Algorithms
A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem
Fundamenta Informaticae
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
Computers and Operations Research
Massive model visualization techniques: course notes
ACM SIGGRAPH 2008 classes
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Drawing graphs by eigenvectors: theory and practice
Computers & Mathematics with Applications
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Decorous Lower Bounds for Minimum Linear Arrangement
INFORMS Journal on Computing
Multiscale approach for the network compression-friendly ordering
Journal of Discrete Algorithms
Memetic algorithms for the MinLA problem
EA'05 Proceedings of the 7th international conference on Artificial Evolution
Branch and bound for the cutwidth minimization problem
Computers and Operations Research
A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem
Fundamenta Informaticae
Hi-index | 0.04 |