Algorithms and Combinatorics

<h2 id="books">Books</h2>
The books published in this series include:<a class="footnote-ref" id="fnref:2" href="#fn:2">2</a>

<ul><li>The Simplex Method: A Probabilistic Analysis (Karl Heinz Borgwardt, 1987, vol. 1)</li>
<li>Geometric Algorithms and Combinatorial Optimization (<a href="/facts/Martin_Gr%C3%B6tschel/9I4LlIhv">Martin Grötschel</a>, <a href="/facts/L%C3%A1szl%C3%B3_Lov%C3%A1sz/X0VB38Ee">László Lovász</a>, and <a href="/facts/Alexander_Schrijver/eJHJNRGz">Alexander Schrijver</a>, 1988, vol. 2; 2nd ed., 1993)</li>
<li>Systems Analysis by Graphs and Matroids (Kazuo Murota, 1987, vol. 3)</li>
<li>Greedoids (<a href="/facts/Bernhard_Korte/xp59tdBv">Bernhard Korte</a>, <a href="/facts/L%C3%A1szl%C3%B3_Lov%C3%A1sz/X0VB38Ee">László Lovász</a>, and Rainer Schrader, 1991, vol. 4)</li>
<li>Mathematics of Ramsey Theory (<a href="/facts/Jaroslav_Ne%C5%A1et%C5%99il/99pR0wFP">Jaroslav Nešetřil</a> and <a href="/facts/Vojt%C4%9Bch_R%C3%B6dl/8h2dy5dU">Vojtěch Rödl</a>, eds., 1990, vol. 5)</li>
<li>Matroid Theory and its Applications in Electric Network Theory and in Statics (Andras Recszki, 1989, vol. 6)</li>
<li>Irregularities of Partitions: Papers from the meeting held in Fertőd, July 7–11, 1986 (<a href="/facts/G%C3%A1bor_Hal%C3%A1sz/8PYQ6VlS">Gábor Halász</a> and <a href="/facts/Vera_T._S%C3%B3s/1w4tA6LD">Vera T. Sós</a>, eds., 1989, vol. 8)</li>
<li>Paths, Flows, and VLSI-Layout: Papers from the meeting held at the University of Bonn, Bonn, June 20–July 1, 1988 (<a href="/facts/Bernhard_Korte/xp59tdBv">Bernhard Korte</a>, <a href="/facts/L%C3%A1szl%C3%B3_Lov%C3%A1sz/X0VB38Ee">László Lovász</a>, Hans Jürgen Prömel, and <a href="/facts/Alexander_Schrijver/eJHJNRGz">Alexander Schrijver</a>, eds., 1990, vol. 9)</li>
<li>New Trends in Discrete and Computational Geometry (<a href="/facts/J%C3%A1nos_Pach/x1t8LFL7">János Pach</a>, ed., 1993, vol. 10)</li>
<li>Discrete Images, Objects, and Functions in 
 
 
 
 
 
 Z
 
 
 n
 
 
 
 
 {\displaystyle \mathbb {Z} ^{n}}
 
 (Klaus Voss, 1993, vol. 11)</li>
<li>Linear Optimization and Extensions (Manfred Padberg, 1999, vol. 12)</li>
<li>The Mathematics of Paul Erdős I (<a href="/facts/Ronald_Graham/ukKzczTL">Ronald Graham</a> and <a href="/facts/Jaroslav_Ne%C5%A1et%C5%99il/99pR0wFP">Jaroslav Nešetřil</a>, eds., 1997, vol. 13)</li>
<li>The Mathematics of Paul Erdős II (<a href="/facts/Ronald_Graham/ukKzczTL">Ronald Graham</a> and <a href="/facts/Jaroslav_Ne%C5%A1et%C5%99il/99pR0wFP">Jaroslav Nešetřil</a>, eds., 1997, vol. 14)</li>
<li>Geometry of Cuts and Metrics (<a href="/facts/Michel_Deza/4FxmYyqh">Michel Deza</a> and <a href="/facts/Monique_Laurent/VDJehJ82">Monique Laurent</a>, 1997, vol. 15)</li>
<li>Probabilistic Methods for Algorithmic Discrete Mathematics (M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and <a href="/facts/Bruce_Reed_(mathematician)/rwrfNHpG">B. Reed</a>, 1998, vol. 16)</li>
<li>Modern Cryptography, Probabilistic Proofs and Pseudorandomness (<a href="/facts/Oded_Goldreich/Ufn1bqW7">Oded Goldreich</a>, 1999, vol. 17)</li>
<li>Geometric Discrepancy: An Illustrated Guide (<a href="/facts/Ji%C5%99%C3%AD_Matou%C5%A1ek_(mathematician)/rgoef0Hc">Jiří Matoušek</a>, 1999, vol. 18)</li>
<li>Applied Finite Group Actions (Adalbert Kerber, 1999, vol. 19)</li>
<li>Matrices and Matroids for Systems Analysis (Kazuo Murota, 2000, vol. 20; corrected ed., 2010)</li>
<li>Combinatorial Optimization (<a href="/facts/Bernhard_Korte/xp59tdBv">Bernhard Korte</a> and Jens Vygen, 2000, vol. 21; 5th ed., 2012)</li>
<li><a href="/facts/The_Strange_Logic_of_Random_Graphs/f44hfBSP">The Strange Logic of Random Graphs</a> (<a href="/facts/Joel_Spencer/dhg8jEo4">Joel Spencer</a>, 2001, vol. 22)</li>
<li>Graph Colouring and the Probabilistic Method (Michael Molloy and <a href="/facts/Bruce_Reed_(mathematician)/rwrfNHpG">Bruce Reed</a>, 2002, Vol. 23)</li>
<li>Combinatorial Optimization: Polyhedra and Efficiency (<a href="/facts/Alexander_Schrijver/eJHJNRGz">Alexander Schrijver</a>, 2003, vol. 24. In three volumes: A. Paths, flows, matchings; B. Matroids, trees, stable sets; C. Disjoint paths, hypergraphs)</li>
<li>Discrete and Computational Geometry: The Goodman-Pollack Festschrift (<a href="/facts/Boris_Aronov/wQwSNebX">B. Aronov</a>, S. Basu, <a href="/facts/J%C3%A1nos_Pach/x1t8LFL7">J. Pach</a>, and <a href="/facts/Micha_Sharir/ILQ9XStV">M. Sharir</a>, eds., 2003, vol. 25)</li>
<li>Topics in Discrete Mathematics: Dedicated to Jarik Nešetril on the Occasion of his 60th birthday (M. Klazar, <a href="/facts/Jan_Kratochv%C3%ADl/BQ5Has54">J. Kratochvíl</a>, M. Loebl, <a href="/facts/Ji%C5%99%C3%AD_Matou%C5%A1ek_(mathematician)/rgoef0Hc">J. Matoušek</a>, <a href="/facts/Robin_Thomas_(mathematician)/A3fS9arb">R. Thomas</a>, and P. Valtr, eds., 2006, vol. 26)</li>
<li>Boolean Function Complexity: Advances and Frontiers (Stasys Jukna, 2012, Vol. 27)</li>
<li>Sparsity: Graphs, Structures, and Algorithms (<a href="/facts/Jaroslav_Ne%C5%A1et%C5%99il/99pR0wFP">Jaroslav Nešetřil</a> and <a href="/facts/Patrice_Ossona_de_Mendez/UdmKUVR7">Patrice Ossona de Mendez</a>, 2012, vol. 28)</li>
<li>Optimal Interconnection Trees in the Plane (Marcus Brazil and Martin Zachariasen, 2015, vol. 29)</li>
<li>Combinatorics and Complexity of Partition Functions (<a href="/facts/Alexander_Barvinok/vpHa0UwR">Alexander Barvinok</a>, 2016, vol. 30)</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Götze, Heinz (2008), Springer-Verlag: History of a Scientific Publishing House: Part 2: 1945 - 1992. Rebuilding - Opening Frontiers - Securing the Future, translated by Schäfer, M., Springer, p. 320, ISBN 9783540928881 <a href="9783540928881" target="_blank">9783540928881</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Official website <a href="https://www.springer.com/series/13" target="_blank">https://www.springer.com/series/13</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
</ol>

Algorithms and Combinatorics open-in-new

Algorithms and Combinatorics