Parallel and output sensitive algorithms for combinatorial and linear algebra problems
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An O(VE) algorithm for ear decompositions of matching-covered graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Processor efficient parallel matching
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
An O(VE) algorithm for ear decompositions of matching-covered graphs
ACM Transactions on Algorithms (TALG)
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
International Journal of Computational Intelligence Studies
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science
Algorithms and theory of computation handbook
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the bipartite unique perfect matching problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Finding all maximally-matchable edges in a bipartite graph
Theoretical Computer Science
| Hi-index | 0.00 |