Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). - Helmut Alt; Norbert Blum; Kurt Mehlhorn; Markus Paul (Inf. Process. Lett., 1991)