1. Laws of Organization in Perceptual Forms;Wertheomer,1950
2. An n2.5 algorithm for maximum matching in bipartite graphs;Hopcroft;SIAM J. Comput.,1973
3. Faster scaling algorithms for network problems;Gabow;SIAM J. Comput.,1989
4. The hungarian method for the assignment problem;Kuhn;Nav. Res. Logistics Q.,1955
5. P.K. Agarwal, K. Varadarajan, Approximation algorithms for bipartite and non-bipartite matching in the plane, in: ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 805–814.