C. Berge, TWO THEOREMS IN GRAPH THEORY, Proceedings of the National Academy of Sciences, vol.43, issue.9, pp.842-844, 1957.
DOI : 10.1073/pnas.43.9.842
URL : https://www.ncbi.nlm.nih.gov/pmc/articles/PMC534337/pdf

J. Edmonds, Paths, trees, and flowers, Journal canadien de math??matiques, vol.17, issue.0, pp.449-467, 1965.
DOI : 10.4153/CJM-1965-045-4

J. E. Hopcroft and R. M. Karp, An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs, SIAM Journal on Computing, vol.2, issue.4, pp.225-231, 1973.
DOI : 10.1137/0202019

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.3906

S. Micali, V. V. Vazirani, and O. An, |V ||E|) Algorithm for Finding Maximum Matching in General Graphs, 21st Symp. on Foundations of Comp. Sc. (FOCS), pp.17-27, 1980.
DOI : 10.1109/sfcs.1980.12

G. Sieg, Grandfather rights in the market for airport slots, Transportation Research Part B: Methodological, vol.44, issue.1, pp.29-37, 2010.
DOI : 10.1016/j.trb.2009.04.005

N. Nisse, A. Salch, and V. Weber, Recovery of disrupted airline operations using k-Maximum Matching in Graphs, Research Report, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01116487

M. Wambsganss, Collaborative Decision Making through Dynamic Information Transfer, Air Traffic Control Quarterly, vol.4, issue.2, pp.109-125, 1996.
DOI : 10.2514/atcq.4.2.109

X. Wu and R. Srikant, Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node exclusive spectrum sharing, IEEE Conf. on Decision and Control, 2005.