Sublinear-time parallel algorithms for matching and related problems

Randomness-optimal unique element isolation, with applications to perfect matching and related problems

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms

Journal of Experimental Algorithmics (JEA)

A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Approximation algorithms for spreading points

Journal of Algorithms

Coarse grained parallel algorithms for graph matching

Parallel Computing

Approximate labelled subtree homeomorphism

Journal of Discrete Algorithms

Fast algorithms for weighted bipartite matching

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

An efficient implicit OBDD-Based algorithm for maximal matchings

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications

Implicit computation of maximum bipartite matchings by sublinear functional operations

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation