Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Data structures and network algorithms
Data structures and network algorithms
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Decremental dynamic connectivity
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for Petersen's matching theorem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Dynamic Graph Algorithms with Applications
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Acyclic bidirected and skew-symmetric graphs: algorithms and structure
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On the bipartite unique perfect matching problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 0.00 |