Source code online books for professionals by professionals

Monthly, 69(1):9-15.
Graham, R. L. and Hell, P. (1985). On the history of the minimum spanning tree problem. IEEE Annals on the History 
of Computing, 7(1).
Gusfield, D. and Irving, R. W. (1989). The Stable Marriage Problem: Structure and Algorithms. The MIT Press.
Helman, P., Moret, B. M. E., and Shapiro, H. D. (1993). An exact characterization of greedy structures. SIAM Journal on 
Discrete Mathematics, 6(2):274-283.
Knuth, D. E. (1996). Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the 
Mathematical Analysis of Algorithms. American Mathematical Society.
Korte, B. H., Lovász, L., and Schrader, R. (1991). Greedoids. Springer-Verlag.
Nešet
řil, J., Milková, E., and Nešetřilová, H. (2001). Otakar Borůvka on minimum spanning tree problem: Translation 
of both the 1926 papers, comments, history. Discrete Mathematics, 233(1-3):3-36.
Pearson, D. (2005). A polynomial-time algorithm for the change-making problem. Operations Research  
Letters, 33(3):231-234.

---

163