1. A characterization of Seymour graphs;Ageev,1994
2. The Design and Analysis of Computer Algorithms;Aho,1974
3. Network flows;Ahuja,1989
4. Computing a maximum cardinality matching in a bipatite graph in time O(n1.5√m/logn);Alt;Inf. Process. Lett.,1991
5. An algorithmic proof of Tutte's f-factor theorem;Anstee;J. Algorithms,1985