Livros Adquiridos pelo IME-USP

• R. K. Ahuja, T. L. Magnanti, and J. B. Orlin.
  Network flows: theory, algorithms, and applications.
  Prentice Hall, Inc., Englewood Cliffs, NJ, 1993.
  xvi+846 pp., ISBN: 0-13-617549-X, R$ 86.50, MR94e:90035.

• M. Aigner.
  Combinatorial search.
  Wiley-Teubner Series in Computer Science. John Wiley & Sons, Ltd, 1988.
  368 pp, ISBN: 0-471-92142-4, $119.00, MR89k:68021.

• A. Bachen and W. Kern.
  Linear Programming Duality: an introduction to Oriented Matroids.
  Springer-Verlag, New York, 1992.
  216 pp, ISBN: 0-387-55417-3, $49,00.

• M. O. Ball, T .L. Magnanti, and C. L. Monma.
  Network models.
  North-Holland.
  ISBN: 0-444-89292-3, $176.00.

• T. Bell.
  Text compression.
  Prentice-Hall.
  ISBN: 0-139-11991-4, $70.00.

• W. Cook, L. Lovász, and P. Seymour.
  Combinatorial optimization.
  DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 20. American Mathematical Society, Providence, RI, 1995.
  xii+441 pp., ISBN: 0-8218-0239-9, $98.00, MR95m:90008.

• Y. Fisher.
  Fractal image compression: theory and application.
  Springer-Verlag, New York, 1995.
  xviii+341 pp., ISBN: 0-387-94211-4, $49.50, MR95k:68237.

• J. E. Goodman, R. Pollack, and W. Steiger.
  Discrete and computational geometry.
  DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 6. American Mathematical Society and Association for Computing Machinery (ACM), Providence, RI, New York, NY, 1991.
  x+378 pp. ISBN: 0-8218-6595-1, $66.00.

• R. L. Graham, M. Grötschel and L. Lovász (eds).
  Handbook of Combinatorics.
  The MIT Press, 1995
  ISBN: 0-262-07169-X. $300.00. Foram adquiridos 2 exemplares, sendo um deles para a UFRJ.

• P. Gritzmann and B. Sturmfels.
  Applied geometry and discrete mathematics. The Victor Klee Festschrift.
  DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 4. American Mathematical Society and Association for Computing Machinery (ACM), Providence, RI, New York, NY, 1991.
  xl+608 pp., ISBN: 0-8218-6593-5, $118.00, MR92b:00050.

• H. Halberstam and K. F. Roth.
  Sequences.
  Springer-Verlag, New York.
  ISBN: 0-387-90801-3, $ 64,00.

• J. Ja Ja.
  An Introduction to Parallel Algorithms.
  Addison-Wesley.
  ISBN: 0-201-54856-9, $ 49.85.

• T. R. Jensen and B. Toft.
  Graph coloring problems.
  Wiley-Interscience Series in Discrete Mathematics and Optimization. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New York, 1995.
  xxii+295 pp, ISBN: 0-471-02865-7, $44.95, MR95h:05067.

• D. S. Johnson and C. C. McGeoch.
  Network Flows and Matchings.
  DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 12. American Mathematical Society, Providence, RI.
  ISBN: 0-8218-6598-6, $96.00.

• D. E. Knuth.
  The Stanford GraphBase: a Platform for Combinatorial Computing.
  Addison-Wesley.
  ISBN: 0-201-54275-7, $45.25.

• D. E. Knuth.
  Mathematical Writing.
  Mathematical Association of America.
  ISBN: 0-88385-063-X $22.40.

• D. E. Knuth and S. Levy.
  The CWeb System of Structured Documentation.
  Addison-Wesley.
  ISBN: 0-201-57569-8 $20.80.

• D. C. Kozen.
  The design and analysis of algorithms.
  Texts and Monographs in Computer Science. Springer-Verlag, New York, 1992.
  x+320 pp. ISBN: 0-387-97687-6, $29.50, MR92m:68044.

• L. Lamport.
  L^ATEX Documentation Preparation.
  Addison Wesley, 2nd edition.
  ISBN: 0-201-52983-1, $35.50.

• R. Motwani and P. Raghavan.
  Randomized algorithms.
  Cambridge University Press, Cambridge, 1995.
  xiv+476 pp, ISBN: 0-521-47465-5, $39.95, MR1 344 451.

• K. Mulmuley.
  Computational Geometry: an Introduction Through Randomized Algorithms.
  Addison-Wesley.
  ISBN: 0-201-53082-1, $46.25.

• G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd.
  Optimization.
  Handbooks in Operations Research and Management Science, 1. North-Holland Publishing Co., Amsterdam, 1989.
  xiv+709 pp, ISBN: 0-444-87284-1, $176.00, MR92a:90001.

• J. Pach and P. Agarwal.
  Combinatorial Geometry.
  Wiley-Interscience
  ISBN: 0-471-58890-3, $59.95.

• M. Padberg.
  Linear optimization and extensions.
  Algorithms and Combinatorics, 12. Springer-Verlag, Berlin, 1995.
  xx+449 pp, ISBN: 3-540-58734-9, $99.00, MR1 343 978.

• C. H. Papadimitriou.
  Computational complexity.
  Addison-Wesley Publishing Company, Reading, MA, 1994.
  xvi+523 pp., ISBN: 0-201-53082-1, $46.25, MR95f:68082.

• J. Spencer.
  Ten Lectures on the Probabilistic Methods, 2nd edition.
  SIAM, 1994.
  88 pp, ISBN: 0-89871-325-0, $39.75.

• W. T. Trotter.
  Combinatorics and partially ordered sets. Dimension theory.
  Johns Hopkins Series in the Mathematical Sciences. Johns Hopkins University Press, 1992.
  xvi+307 pp, ISBN: 0-8018-4425-8, $48.00, MR94a:06001.

• W. T. Trotter.
  Planar Graphs.
  DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 9. American Mathematical Society, Providence, RI, 1993.
  xii+152 pp., ISBN: 0-8218-6600-1, $45.00, MR93m:05005.

• D. J. A. Welsh.
  Complexity: knots, colourings and counting.
  London Mathematical Society Lecture Note Series, 186. Cambridge University Press, Cambridge, 1993.
  viii+163 pp., ISBN: 0-521-45740-8, $37.95, MR94m:57027.