Library

[home] - [up]

Library of the Graduate Program

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Software

P.K. Ahuja, T.L. Magnati, J.B. Orlin: Network Flows, Prentice Hall 1993.
Martin Aigner, Günter M. Ziegler: Proofs from THE BOOK, Springer Verlag, 1998.
Martin Aigner, Günter M. Ziegler: Proofs from THE BOOK, 2nd Edition, Springer Verlag, 2001.
N. Alon, H. Spencer: The Probabilistic Method, John Wiley & Sons. Inc. 1992.
N. Alon, H. Spencer: The Probabilistic Method, Second Edition, John Wiley & Sons. Inc. 2000.
H. Alt (Ed.): Computational Discrete Mathematics, Springer Verlag, 2001.
Andersen, Bang-Jensen, Jensen, Jørgensen, Sabidussi, Thomassen, Toft, Vestergaard: The Julius Petersen Graph Theory Centennial, Elsevier Science 1992.
K. Arnold, J. Gosling: The Java Programming Language, Addison Wesley 1996.
B. Aronov, S. Basu, J. Pach, M. Sharir (Eds.): Discrete and Computational Geometry - The Goodman-Pollack Festschrift, Springer 2003.
J. Arvo (ed.): Graphic Gems II, Academic Press 1991.
G.R. Ash: Dynamic Routing in Telecommunications Network, McGraw/Hill Telecommunications, 1997.
M.J.Atallah (Ed.): Algorithms and Theory of Computation Handbook CRC Press, 1999.

P. Baldi, P. Frasconi, P. Smyth: Modeling the Internet and the Web, WILEY, 2003.
J. Bang-Jensen, G. Gutin: Digraphs: Theory, Algorithms and Applications, Springer Verlag, 2000.
G. di Battista, P. Eades, R. Tamssia, I.G. Tollis: Graph Drawing - Algorithms for the visualization of graphs, Prentice Hall, 1999.
M.S. Bazaraa, H.D. Sherall, C.M. Shetty, , Nonlinear Programming - Theory and Algorithms, Wiley, 1993.
J.E. Beasley (ed.): Advances in Linear and Integer Programming, Oxford University Press, 1996.
L.W. Beineke, R.J. Wilson: Topics in Algebraic Graph Theory, Cambridge University Press, 2004.
Jon Bentley: Programming Pearls - 2nd Ed., Addison Wesley, 2000.
M. de Berg, M. van Krefeld, M. Overmars, O. Schwarzkopf: Computational Geometry - Algorithms and Applications, Springer Verlag, 1997.
M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf: Computational Geometry, Algorithms and Applications, Second Edition, Springer 2000.
Dimitri Bertsekas: Nonlinear Programming -2nd Ed., Athena Scientific, 1999.
Dimitri P. Bertsekas, John N. Tsitsiklis: Neuro-Dynamic Programming, Athena Scientific Press 1996.
T. Beth, D. Jungnickel, H. Lenz: Design Theory, Volume 1, Second Edition, Cambridge 1999.
T. Beth, D. Jungnickel, H. Lenz: Design Theory, Volume 2, Second Edition, Cambridge 1999.
N.L. Biggs, E.K. Lloyd, R.J. Wilson: Graph Theory 1736 - 1936, Oxford University Press 1998.
Björner et al: Oriented Matroids, Cambridge University Press 1993.
J. Blaseswicz, K.H. Ecker, G. Schmidt, J. Weglarz: Scheduling in Computer and Manufacturing Systems, 2nd edition, Springer Verlag 1993/94.
J. Blaseswicz, K.H. Ecker, E. Pesch, G. Schmidt, J. Weglarz: Scheduling Computer and Manufacturing Processes, Springer Verlag 1996.
J.-D. Boissonnat, M. Yvince: Algorithmic Geometry, Cambridge University Press, 1998.
B. Bollobás: Combinatorics, Cambridge University Press 1994.
Bela Bollobás: Modern Graph Theory, Springer Verlag, 1998.
Bela Bollobás: Random Graphs, Second Edition, Cambridge University Press.
V.G. Boltyanskii, V.A. Efremovich: Intuitive Combinatorial Topology , Springer, 2001
S. Bornholdt, H.G. Schuster (Eds.): Handbook of Graphs and Networks, WILEY-VCH, 2003.
M. Bóna: Combinatorics of Permutations, Chapman & Hall/CRC, 2004.
Allan Borodin, Ran El-Yaniv: Online Computation and Competitive Analysis, Cambridge University Press, 1998.
Peter Borwein: Computational Excursions in Analysis and Number Theory, Springer, 2002
D. Braess: Finite Elemente, Springer Verlag 1992.
G.E. Bredon: Topology and Geometry (Graduate Texts in Mathematics), Springer Verlag 1991.
I.N. Bronstein, K.A. Semendjajew: Teubner-Taschenbuch der Mathematik, B.G. Teubner, Stuttgart - Leipzig, 1996.
Michael Brooks (Ed.): Quantum Computing and Communications, Springer Verlag, 1999.
C. Brown: HEX Strategy, A K Peters 1996.
P. Brucker: Scheduling Algorithms, Springer Verlag 1995.

Peter J. Cameron: Permutation Groups, Cambridge University Press, 1999.
Peter J. Cameron: Oligomorphic Permutation Groups, Cambridge University Press, 1990.
M. Carter, C. Price: Operation Research, A Practical Introduction, CRC Press 2001.
Gary Chartrand, Ortrud R. Oellermann: Applied and Algorithmic Graph Theory, McGraw-Hill International Editions 1993.
G. Chartrand, L. Lesniak: Graphs and Digraphs (4th edition), Chapman & Hall/CRC, 2004.
B. Chazelle: The Discrepancy Method, Cambridge University Press 2000.
H.-K. Chen: Dynamic travel choice models, Springer Verlag Berlin, 1998.
Fan Chung, Ron Graham: Erdos on graphs: His legacy of unsolved problems, Wellesley, 1998.
Vasek Chvatal: Linear Programming, Freeman and Company, 1999.
Vasek Chvatal: Linear Programming, W.H. Freeman, 2000.
Peter Clote, Rolf Backofen: Computational Molecular Biology, Wiley, 2000
David A. Cox, Sheldon Katz: Mirror Symmetry and Algebraic Geometry, American Mathematical Society.
W. Cook, L. Lovász, P. Seymour (eds.): Combinatorial Optimization, DIMACS, Vol.20, American Mathematical Society 1995.
W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, A. Schrijver: Combinatorial Optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1998.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest: Introduction to Algorithms, The MIT Press, 1997.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms, 2nd edition, The MIT Press, 2001.
David Cox, John Little, Donald O'Shea: Ideals, Varieties, and Algorithms, 2nd. Ed., Springer Verlag Berlin, 1996.
D. Cvetkovic, P. Rowlinson, S. Simic: Eigenspaces of Graphs, Cambridge 1997.

Carlos F. Daganzo: Fundamentals of Transportation and Traffic Operations, Pergamon 2000.
B.A. Davey, H.A. Priestley: Introduction to lattices and order, Cambridge University Press, 1990.
H.M. Deitel, P.J. Deitel: C++ How to Program, Prentice Hall International 1994.
Amir Dembo, Ofer Zeitouni: Large Deviations-Techniques and Applications, Springer 1998, second edition
J. E. Dennis,Jr., Robert B. Schnabel: Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Siam
Deutsche Forschungsgemeinschaft: Sicherung guter wissenschaftlicher Praxis - Safeguarding Good Scientific Practice, Wiley-VCH, 1998.
Reinhard Diestel: Graphentheorie, Springer Verlag Berlin, 1996.
Reinhard Diestel: Graph Theory, Springer Verlag, 1997.
Reinhard Diestel: Graph Theory, Second Edition, Springer Verlag 2000.
Ralph Droms, Ted Lemon: The DHCP Handbook -Understanding, Deploying, and Managing Automated Configuration Service, Macmillan Technical Publishing, 1999.
R. Durbin, S. Eddy, A. Krogh, G. Mitchison: Biological sequence analysis, Cambridge University Press.

Herbert Edelsbrunner: Geometry and Topology for Mesh Generation Cambridge University Press.
Paul Embrechts, Claudia Kluppelberg, Thomas Mikosch: Modelling extremal events for insurance and finance, Springer Verlag Berlin, 1997.
A.B. Evans: Orthomorphism Graphs of Groups, Lecture Notes in Mathematics, Springer Verlag1992.
Günter Ewald: Combinatorial Convexity and Algebraic Geometry (Graduate Texts in Discrete Mathematics, Vol. 168), Springer Verlag, 1996.

G.D. Fasman (ed.): Prediction of Protein Structure and the Principles of Protein Conformation, Plenum Press 1989.
W.D. Fellner: Computergraphik, BI-Wissenschaftsverlag.
D. Flanagan: Java in a Nutshell - A Desktop Quick Reference for Java Programmers, O'Reilly and Associates Inc. 1996.
David Flanagan: Java in a Nutshell, 2nd Edition 1997., O'Reilly, 1997.
H. Fleischner: Eulerian Graphs and Related Topics, Part 1, Vol.1, Elsevier Science 1990.
H. Fleischner: Eulerian Graphs and Related Topics, Part 1, Vol.2, Elsevier Science 1991.
Foley, vanDam, Feiner, Hughes: Computer Graphics - Principles and Practice, 2nd edition, Addison Wesley 1993.
L.R. Foulds: Graph Theory Applications (Universitext), Springer Verlag, 1992.
R. Fourer, D.M. Gay, B.W. Kernighan: AMPL - A Modeling Language For Mathematical Programming, boyd & fraser publishing company, 1993.
Drew Fudenberg, Jean Tirole: Game Theory, MIT Press Cambridge 2000.

E. Gamma, R. Helm, R. Johnson, J. Vlissides: Design-Patterns - Elements of Reasonable Object-Oriented Software, Addison Wesley 1995.
M. Garey, D.S. Johnson: Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman and Company, 1999.
S. Garfinkel, G. Spafford: Practical Unix & Internet Security, 2nd. Edition, O'Reilly, 1996.
Joachim von zur Gathen, Jürgen Gerhard: Modern Computer Algebra, Cambridge University Press, 1999.
Paul-Louis George, Houman Borouchaki: Delaunay Triangulation and Meshing, Hermes 1998.
A.S. Glassner (ed.): Graphic Gems I, Academic Press 1990.
Chris Godsil, Gordon Royle: Algebraic Graph Theory, Springer 2001.
O. Goldreich: Modern Cryptography, Probabilistic Poofs and Pseudorandomness, Springer 1999.
Jacob E. Goodman, Joseph Rourke (Eds.): Handbook of Discrete and Computational Geometry , CRC Press, 1997.
Gene H. Golup, Charles F. van Loan: MATRIX Computations - Third Edition, John Hopkins University Press, 1996.
M. Goosens, F. Mittelbach, A. Samarin: The Latex Companion.
M. Goosens, F. Mittelbach, A. Samarin: Der Latex-Begleiter.
J. Gosling and the Java Team: The Java Application Programming Interface, vol.1 - Core Packages, Addison Wesley 1996.
J. Gosling and the Java Team: The Java Application Programming Interface, vol.2 - Window Toolkit and Applets, Addison Wesley 1996.
J. Gosling, B. Joy, G. Steele: The Java Language Specification, Addison Wesley 1996.
I.P. Goulden, D.M. Jackson: Combinatorial Enumeration, Dover Publications, 2004.
J. Grabmeier, E. Kaltofen, V. Weispfenning (Ed.): Computer Algebra Handbook, Springer 2003
R.L. Graham, M. Grötschel, L. Lovász: Handbook of Combinatorics I, Elsevier Science 1995.
R.L. Graham, M. Grötschel, L. Lovász: Handbook of Combinatorics II, Elsevier Science 1995.
Graham, Knuth, Patashnik: Concrete Mathematics, Addison Wesley 1989.
Jack E. Graver: Counting on Frameworks, MAA
F. Griffel: Componentware, dpunkt.verlag 1998
G.R. Grimmett, D.R. Stirzaker: Probability and Random Processes - Problems and Solutions, Oxford University Press 1995.
G.R. Grimmett, D.R. Stirzaker: Probability and Random Processes - 2nd Edition, Oxford University Press 1995.
G. Grimmett, D. Welsh: Probability - An Introduction, Oxford University Press, 1996
Jonathan Gross, Jay Yellen: Graph Theory and its Applications , CRC Press, 1999.
Ch. Großmann, H.-G. Roos: Numerik partieller Differentialgleichungen, Teubner Stuttgart 1992.
P.M. Gruber, J.M. Wills (eds.): Handbook of Convex Geometry - Volume A, Elsevier Science, 1993.
P.M. Gruber, J.M. Wills (eds.): Handbook of Convex Geometry - Volume B, Elsevier Science, 1993.
J. Gruska: Quantum Computing, McGraw Hill, 1999.
B. Grünbaum: Convex Polytopes, Springer, 2003 .
Grünbaum, Shephard: Tilings and Patterns, W.H. Freeman & Co. 1987.
Dan Gusfield: Algorithms on strings, trees and sequences, Cambridge University Press, 1997.

M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, B. Reed (Eds.): Probabilistic Methods for Algorithmic Discrete Mathematics, Springer Verlag, Berlin, 1998.
D. R. Hankerson, D. G. Hoffman, D. A. Leonard, C. C. Lindner, K. T. Phelps, J. R. Wall: Coding Theory and Cryptography, Second Edition, Marcel Dekker 2000.
Elliote Rusty Harold: Java Network Programming , O'Reilly, 1997.
J.M. Harris, J.L. Hirst, M.J. Mossinghoff: Combinatorics and Graph Theory, Springer Verlag.
M.R. Headington, David D. Riley: Data Abstraction and Structures Using C++.
P.S. Heckbert (ed.): Graphic Gems IV, Academic Press 1994.
L.A. Hemaspaandra, M. Ogihara: The Complexity Theory Companion, Springer, 2002.
P. Hell, J. Nesetril: Graphs and Homomorphisms, Oxford University Press 2004.
J.L. Hennesy, D.A. Patterson: Computer Architecture - A Quantitative Approach, Morgan Kaufmann.
G. Herman, A. Kuba: Discrete Tomography, Foundations, Algorithms and Applications, Birkhäuser 1999.
J. Herman, R. Kucera, J. Simsa: Counting and Configurations, Springer 2003.
D.S. Hochbaum (ed.): Approximation Algorithms for NP-Hard Problems, PWS Publishing 1996.
D. Hochbaum, K. Jansen, J. Rolim, A. Sinclair (Eds.): Randomization, Approximation, and Combinatorial Optimization - Algorithms and Techniques, Proceedings of Random-Approx'99, Springer LNCS Vol. 1671, 1999.
W. Hodges: A Shorter Model Theory, Cambridge Unversity Press, 1997.
R. Hofestädt, T. Lengauer, M. Löffler, D. Schomburg (Eds.): Bioinformatics, Springer LNCS Vol 1278, 1997.
D.A. Holton, J. Sheehan: The Petersen Graph, Cambridge University Press 1993.
T. Howes, M. Smith, G. Good: Understanding and Deploying LDAP Directory Services, New Riders 1999.
Juraj Hromkovic: Algorithmics for Hard Problems, Springer 2001.

S. Istrail, P. Pevzner, R. Shamir: Computational Molecular Biology, Elsevier 2003.

D. Jackson, T. Visentin: An Atlas of the Smaller Maps in Orientable Surfaces, Chapman & Hall/Inc 2000.
Jean Jacod, Albert N. Shiryaev: Limit Theorems for Stochastic Processes, Springer 2003, 2. Ed.
Svante Janson, Tomas Luczak, Andrzej Rucinski: Random Graphs, John Wiley, 2000.
B. Jansen: Interior Point Techniques in Optimization - Complementaritz, Sensitivity and Algorithms, Kluwer Academic Publishers, 1997.
A. Janser, W. Luther, W. Otten: Computergraphik und Bildbearbeitung, Vieweg 1996.
T. Jensen, B. Toft: Graph Coloring Problems, Wiley Interscience 1995.
S. Jukna: Extremal Combinatorics, Springer 2001.

J.A. Kaandorp: Fractal Modelling Growth and Form in Biology, Springer Verlag 1994.
D. Kirk (ed.): Graphic Gems III, Academic Press 1992.
Rolf Klein: Algorithmische Geometrie , Addison Wesley, 1997.
Jon Kleinberg & Éva Tardos: Algorithm Design, Pearson, 2006.
Donald E. Knuth: Stable Marriage and Its Relation to Other Combinatorial Problems, American Mathematical Society, 1997.
Donald E. Knuth: The Art of Computer Programming - Vol. 1, Fundamental Algorithms, 3rd Edition, Addison Wesley, 1998.
Donald E. Knuth: The Art of Computer Programming - Vol. 2, Seminumerical Algorithms, 3rd Edition, Addison Wesley, 1998.
Donald E. Knuth: The Art of Computer Programming - Vol, 3, Sorting and Searching, 2nd Edition, Addison Wesley, 1998.
Donald E. Knuth: Selected Papers on Computer Science, Cambridge University Press, 1996
V.F. Kolchin: Random Graphs, Cambridge University Press, 1999.
Ulrich Kortenkamp, Jürgen Richter-Gebert: Cinderella , Springer
H. Kopka: Latex - Einführung.
Helmut Kopka, Patrick W. Daly: A Guide to LaTeX, Addison-Wesley, 1999.
B. Korte, J. Vygen: Combinatorial Optimization, Theory and Algorithms, Springer 2000.
Guido Krüger: Go to Java 2, Addison-Wesley, 1999.
Yakov Shimeon Kupitz:Extremal Problems in Combinatorial Geometry, Aarhus Universitet, Lecture Notes Series No. 53, 1979.

J.D. Lamb, D.A. Preece: Surveys in Combinatorics, Cambridge University Press 1999.
L. Lamport: Latex - User's Guide and Reference Manual.
E. Lawler: Combinatorial Optimaization - Networks and Matroids, Dover Publications, 2001.
J. van Leeuwen (ed.): Algorithms and Complexity, Elsevier Science 1992.
F.T. Leighton: Introduction to Parallel Algorithms & Architectures, Morgan Kaufmann 1992.
W.-H. Li, D. Grauer: Fundamentals of Molecular Evolution, Sinauer Associates 1991.
S.B. Lippmann: Inside the C++ Object Model, Addison Wesley 1996.
L. Lovasz: Combinatorial Problems and Exercises, 2nd edition, Elsevier 2003
L. Lovasz, J. Pelikan, K. Vestergombi: Discrete Mathematics, Springer 2003
Luby:Pseudorandomness and Cryptographic Applications, Princeton Computer Science Notes, 1996.

R. Kipp Martin: Large Scale Linear and Integer Optimization, Kluwer Academic Publishers.
Jiri Matousek: Geometric discrepancy - an illustrated guide, Springer Verlag, 1999.
Terry A. McKee, F.R. McMorris: Topics in Intersection Graph Theory, SIAM.
M.L. Mehta: Random Matrices (3rd edition), Elsevier 2004.
Zbigniew Michalewicz: Genetic algorithms + data structures = evolution programs (3rd ed.), Springer Verlag Berlin, 1999.
John W. Milnor, James D. Stasheff:Characteristic Classes, Annals of Mathematic Studies, Princeton University Press, 1974.
B. Mohar, C. Thomassen: Graphs on Surfaces, The Johns Hopkins University Press, 2001.
R. Motwani, P. Raghavan: Randomized Algorithms, Cambridge University Press 1995.
K. Mulmuley: Computational Geometry - An Introduction Through Randomized Algorithms, Prentice Hall, 1994.
James R. Munkres: Elements of Algebraic Topology, Addison Wesley, sixth printing 1997.

Stefan Näher, Kurt Mehlhorn: LEDA, Cambridge University Press, 1999.
Henry F.W. Naylor: Construction project management; Planning and scheduling, Delmar 1995.
Harald Niederreiter (Ed.): Coding Theory and Cryptology, Singapore University Press, 2002
F. Nielsen: Visual Computing: Geometry, Graphics, and Vision, Charles River Media, 2005.
Michael A. Nielsen, Isaac L.Chuang: Quantum Computation and Quantum Information, Cambridge University Press 2002.
T. Nishizeki, Md. S. Rahman: Planar Graph Drawing, World Scientific, 2004.
Jorge Nocedal, Stephen J. Wright: Numerical Optimization, Springer Verlag, B. 1999.
Richard J. Nowakowski - Editor: Games of No Chance, Mathematical Sciences Research Institute Publications, Vol 29, 1996.

Okabe, Boots, Sugihara, Sung Nok Chiu: Spatial Tessellations, 2nd Ed., Wiley, 2000.
Norbert Oppenheim: Urban Travel Demand Modeling, Wiley-Interscience.
Martin J. Osborne, Ariel Rubinstein: A Course in Game Theory, MIT Press Cambridge 2001.
J. Osterberg: GIMP - Anspruchsvolle Grafikbearbeitung unter Linux und Windows, dpunkt, 2000.
Thomas Ottmann, Peter Widmayer: Algorithmen und Datenstrukturen, Spektrum Akademischer Verlag, 1996.

J. Pach, P.K. Agarwal: Combinatorial Geometry, Wiley Interscience 1995.
C. Papadimitriu: Computational Complexity, Addison Wesley, 1994
Papadimitriu, Steiglitz:Combinatorial Optimization: Algorithms and Complexity, Dover Publications, Inc., 1998.
M. Penrose: Random Geometric Graphs, Oxford University Press, 2003.
Pavel A. Pevzner: Computational Molecular Biology, The MIT Press
Michael Pinedo: Scheduling - Theory, Algorithms, and Systems, Prentice Hall, 2002.
H. Prautzsch, W. Boehm, M. Paluszny: Bézier and B-Spline Techniques, Springer, 2003
Proceedings: Approximation, Randomization, and Combinatorial Optimization APPROX 2001 / RANDOM 2001, Springer.
Proceedings: Integer Programming and Combinatorial Optimization IPCO 1990, University of Waterloo Press.
Proceedings: Integer Programming and Combinatorial Optimization, IPCO 1992.
Proceedings: Integer Programming and Combinatorial Optimization, IPCO '93, Centro Ettore Majorana 1993.
Proceedings: Integer Programming and Combinatorial Optimization , IPCO '99, Springer-Verlag Berlin, 1999.
Proceedings: Integer Programming and Combinatorial Optimization IPCO 2001, Springer.
Proceedings: Algorithms - ESA 2001 Springer, 2001.
Proceedings: 42st Annual, Symposium on Foundations of Computer Science FOCS 2001, IEEE Computer Society.
Proceedings: Graph Drawing, GD'98, Springer Verlag Berlin, 1998.
Proceedings: Graph Drawing, GD'99, 7th International Symposium, Springer Verlag, 1999.
Proceedings: Proceedings of the eleventh annual ACM-SIAM Symposium on Discrete Algorithms SODA 2000, PRO101
Proceedings: Proceedings of the seventeenth annual symposium on Computational Geometry (SCG'01), acm Press
Proceedings: 12th Annual ACM--SIAM Symposium on Discrete Algorithms, SODA 2001.
Proceedings: 13th Annual ACM--SIAM Symposium on Discrete Algorithms, SODA 2002.
Proceedings: 41st Annual, Symposium on Foundations of Computer Science, IEEE Computer Society 2000.
Proceedings: Christoph Meinel, Sophie Tison (Eds.): STACS 99 16th Annual Symposium on Theoretical Aspects of Computer Science, Springer Verlag Berlin, 1999.
A. Puder, K. Römer: Middle Ware für verteilte Systeme, dpunkt 2001.

Ralston, Reilly, Hemmendinger (Ed.):, Encyclopedia of Computer Science, 4th. Ed., Nature Publishing Group, 2000.
R.C. Read, R.J. Wilson:, An Atlas of Graphs, Oxford Science Publications, 1998.
Rechenberg, Pomberger (eds.): Informatik-Handbuch, Carl Hanser Verlag, 1997.
Kenneth H. Rosen: Discrete Mathematics and Its Applications, McGraw-Hill, 2003.
Kenneth H. Rosen (Ed.): Handbook of Discrete and Combinatorial Mathematics, CRC Press LLC, 2000.
Arnold L. Rosenberg, Lenwood S. Heath: Graph Separators, with Applications, Kluwer Academic Publishers 2001.
Joseph O'Rourke: Computational Geometry in C, Cambridge University Press, 1998.
B. Rustem: Algorithms for Nonlinear Programming and Multiple-Objective Decisions, Wiley.

S.L. Salzberg, D.B. Searls, S. Kasif (Eds.): Computational Methods in Molecular Biology, Elsevier, 1999
Edward R. Scheinerman, Daniel H. Ullmann: Fractional Graph Theory: A Rational Approach to the Theory of Graphs , Wiley Interscience, 1997.
Rolf Schneider, Wolfgang Weil: Stochastische Geometrie, B.G. Teubner Stuttgart Leipzig
Uwe Schöning: Algorithmik, Spektrum Akademischer Verlag 2001
Uwe Schöning: Ideen der Informatik, Oldenbourg Verlag, 2005.
Alexander Schrijver: Combinatorial Optimization, Volume A, B and C, Springer 2003.
B.S.W. Schröder: Ordered Sets - An Introduction, Birkhäuser, 2003.
Moshe Shaked, J. George Shantihumar: Stochastic Orders and Their Applications, Academic Press, 1994.
M. Sharir, P.K. Agarwal: Davenport-Schinzel Sequences and their Geometric Applications, Cambridge University Press 1995.
Hava T. Siegelmann: Neural Networks and Analog Computation: Beyond the Turing Limit, Birkhäuser, 1999.
Michael Sipser: Introduction to the Theory of Computation, PWS Publishing Company, 1997.
J.P.Spinrad: Efficient Graph Representations, American Mathematical Society, 2003.
D.W. Smith (ed.): Informatics and Genome Projects, Academic Press 1994.
William Stallings: SNMP, SNMPv2, SNMPv3, and RMON 1 and 2 (3rd Ed.), Addison Wesley, 1999.
J. Michael Steele: Probability Theory and Combinatorial Optimization, SIAM 1997.
Thomas Strasser: Programmieren mit Stil - Eine systematische Einführung, dpunkt.verlag, 1997.
B. Stoustrup: Die C++ Programmiersprache, Addison Wesley 1992.
B. Stoustrup: The C++ Programming Language - 3rd Edition, Addison Wesley, 1997.
W. Strunk Jr., E.B. White: The Elements of Style, Pearson Higher Education, 2000.
W. Szpankowski: Average Case Analysis of Algorithms on Sequences John Wiley & Sons, Inc., 2001.

M. Talagrand: Spin Glasses: A Challenge for Mathematicians, Springer 2003.
J.F. Thompson, B. Soni, N. Weatherill (Eds.): Handbook of Grid Generation, CRC Press, 1999.
W.T. Tutte: Graph Theory, Cambridge University Press, 2001.
W.T. Tutte: Graph Theory As I have known it, Oxford Science Publications, 1998.

Robert J. Vanderbei: Linear Programming, Kluwer Academic Publishers 2001.
David Vandevoorde, Nicolai M. Josuttis: C++ Templates - The Complete Guide, Addison Wesley, 2003.

L. Wall, T. Christiansen, Randal L. Schwartz: Programming Perl, 2nd Edition , O'Reilly, 1996.
David L. Weaver, Tom Germond: The SPARC Architecture Manual (Version 9), Prentice Hall, 1994.
M.S. Waterman (ed.): Mathematical Methods for DNA Sequences, CRC Press 1989.
Michael S. Waterman: Introduction to Computational Biology, Chapman & Hall/CRC.
Duncan J. Watts:Small Worlds,Princeton University Press, 1999.
I. Wegener: Complexity Theory - Exploring the Limits of Efficient Algorithms, Springer, 2005.
J. Weglarz: Project Scheduling - Recent Models, Algorithms and Applications, Kluwer's International Series, 1998.
Douglas B. West: Introduction to Graph Theory, Prentice Hall, 1996.
Douglas B. West: Introduction to Graph Theory, Second Edition, Prentice Hall 2001.
H. Wilf: generatingfunctionology, Academic Press Inc., 1993.
Colin P. Williams, Scott H. Clearwater: Explorations in Quantum Computing, Springer Verlag, 1998.
S. Wolfram: Mathematica, Addison Wesley 1992.
H. Wolkowicz, R. Saigal, L. Vandenberghe (Eds.): Handbook of Semidefinite Programming, Kluwer Academic Press, 2000.
Laurence A. Wolsey: Integer Programming, Wiley, 1998.
Stephen J. Wright: Primal-Dual Interior-Point Methods ,Siam.

G.M. Ziegler: Lectures on Polytopes, Springer Verlag 1994.
C. Zong: Sphere Packings, Springer 1999.

Software

Arithmeum, Old Problems in Discrete Mathematics and its Modern Applications, CD-ROM, Springer electronic media.

[home] - [up] - [top of the page]

Last modified: Tue Dec 6 18:07:58 CET 2005