COSC3101:  REFERENCES

• [AHU74] A.V. Aho, J.E. Hopcroft, and J.D. Ullman, T he  Design and Analysis of Computer Algorithms, Addison-Wesley  (1974).  
• [AHU83] A.V. Aho, J.E. Hopcroft, and J.D. Ullman, Data  Structures and Algorithms, Addison-Wesley (1983). 
• [BeW78] LW. Beineke and R.J. Wilson (editors), Selected  Topics in Graph Theory, volume 1 (1978), volume 2 (1983),  volume3(1988),  AcademicPress. 
• [BoG00] S. Baase, A. Van Gelder, Computer Algorithms: Introduction to Design & Analysis, 3rd edition,  Addison Wesley  (2000). 
• [BrB88] G. Brassard and P. Bratley,  Algorithmics:  Theory & Practice, Prentice Hall (1988). 
• [BrB96] G. Brassard and P. Bratley,  Fundamentals  of Algorithmics, Prentice Hall (1996). 
• [BKOS00] M. de Berg, M. van Kreveld, M. Overmars, and O.Schwarzkopf,   Computational Geometry:  Algorithms and  Applications ,  Springer-Verlag, second edition(2000). 
  
• [CLRS01] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein,  Introduction to Algorithms, second edition McGraw-Hill & MIT  Press (2001).
• [Eve79] S. Even, Graph Algorithms, Computer Science  Press (1979). 
• [GaJ79] M.R. Garey, and D.S. Johnson, Computers and Intractability:  A Guide to the Theory of NP Completeness, W.H.  Freeman and Company  (1979). 
• [GKP94] R.L. Graham, D.E. Knuth, and O. Patashnik, Concrete  Mathematics, Addison-Wesley (second edition) (1994).    *
• [GrK81] D.H. Greene, and D.E. Knuth, Mathematics For The Analysis of Algorithms, Birkhauser (1981).    *
• [HoS78] E. Horowitz, and S. Sahni, Fundamentals of Computer  Algorithms, Computer Science Press (1978). 
• [HaR90] N. Hartsfield and G. Ringel, Pearls in Graph Theory   , Academic press (1990). 
• [Har72] F. Harary, Graph Theory, Addison-Wesley   (second edition)  (1972).
• [Hoc97]  D.S. Hochbaum (Editor), Approximation Algorithms  for NP-Hard Problems, PWS Publishing Company (1997). 
• [Hu82] T.C. Hu, Combinatorial Algorithms , Addison-Wesley  (1982). 
• [Knu69] D.E. Knuth, The Art of Computer Programming, VOL I:Fundamental Algorithms, Addison-Wesley (1969).    *
• [Knu73] D.E. Knuth, The Art of Computer Programming, VOL III: Sorting and Searching, Addison-Wesley (1973).    *
• [Knu93] D.E. Knuth, The Stanford GraphBase -- A Platform  for Combinatorial Computing, Addison-Wesley (1993). 
• [Koz92] D.C. Kozen, The Design and Analysis of Algorithms   , Springer-Verlag (1992). * 
• [Man89] U. Manber,  Introduction to Algorithms: A Creative Approach, Addison-Wesley (1989).    *
• [Meh84a] K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Springer-Verlag (1984). 
• [Meh84b] K. Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, Springer-Verlag (1984). 
• [MoR95] R. Motwani, and P. Raghavan, Randomized Algorithms , Cambridge Univ. Press (1995). 
• [NeN98] R. Neapolitan, and K. Naimipour, Foundations of Algorithms, second edition, Jones and Bartlett Pub. Comp. (1998). 
• [ORo94] J. O'Rourke, Computational Geometry in C , Cambridge University Press (1994), (second edition, 1998). 
• [PWZ96] M. Petkovsek, H.S. Wilf, D. Zeilberger,  A=B , A.K.Peters, Ltd., 1996. 
• [Ros00] K.H. Rosen (editor-in-chief), Handbook of Discrete  and Combinatorial Mathematics, CRC Press, 2000. 
• [SeF96] R. Sedgewick, and P. Flajolet, An Introduction  to the Analysis of Algorithms, Addison-Wesley (1996). 
• [Ski97] S. Skiena, The Algorithms Design Manual ,  Telos/Springer-Verlag, ISBN0-387-94860-0 (1997).  
• [Tar83] R.E. Tarjan, Data Structures and  Network  Algorithms,CBMS 44, SIAM monograph (1983). 
• [Tut84] W.T. Tutte, Graph Theory, Encyclopedia  of Mathematics and Applications volume 21, Cambridge University Press (1984). 
• [vanL90] J. van Leeuwen (editor), Handbook of Theoretical  Computer Science, Volume A: Algorithms and Complexity , The  MIT Press  (1990).