Journal of the ACM (JACM)
Finding a maximum-genus graph imbedding
Journal of the ACM (JACM)
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Hi-index | 0.01 |