Finding hidden Hamiltonian cycles
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Multicolor reordering of sparse matrices resulting from irregular grids
ACM Transactions on Mathematical Software (TOMS)
Approximating the bandwidth via volume respecting embeddings (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Linear Orderings of Random Geometric Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
Laying Out Sparse Graphs with Provably Minimum Bandwidth
INFORMS Journal on Computing
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
Graph Theory, Computational Intelligence and Thought
Hi-index | 0.00 |