Algorithms and Combinatorics
Algorithms and Combinatorics is a book series in mathematics, and particularly in combinatorics and the design and analysis of algorithms. It is published by Springer Science+Business Media, and was founded in 1987.Books
, the books published in this series include:
- The Simplex Method: A Probabilistic Analysis
- Geometric Algorithms and Combinatorial Optimization
- Systems Analysis by Graphs and Matroids
- Greedoids
- Mathematics of Ramsey Theory
- Matroid Theory and its Applications in Electric Network Theory and in Statics
- Irregularities of Partitions: Papers from the meeting held in Fertőd, July 7–11, 1986
- Paths, Flows, and VLSI-Layout: Papers from the meeting held at the University of Bonn, Bonn, June 20–July 1, 1988
- New Trends in Discrete and Computational Geometry
- Discrete Images, Objects, and Functions in
- Linear Optimization and Extensions
- The Mathematics of Paul Erdös I
- The Mathematics of Paul Erdös II
- Geometry of Cuts and Metrics
- Probabilistic Methods for Algorithmic Discrete Mathematics
- Modern Cryptography, Probabilistic Proofs and Pseudorandomness
- Geometric Discrepancy: An Illustrated Guide
- Applied Finite Group Actions
- Matrices and Matroids for Systems Analysis
- Combinatorial Optimization
- The Strange Logic of Random Graphs
- Graph Colouring and the Probabilistic Method
- Combinatorial Optimization: Polyhedra and Efficiency
- Discrete and Computational Geometry: The Goodman-Pollack Festschrift
- Topics in Discrete Mathematics: Dedicated to Jarik Nešetril on the Occasion of his 60th birthday
- Boolean Function Complexity: Advances and Frontiers
- Sparsity: Graphs, Structures, and Algorithms
- Optimal Interconnection Trees in the Plane
- Combinatorics and Complexity of Partition Functions
