STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
On testing consecutive-ones property in parallel
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
| Hi-index | 0.01 |