Matroid Theory and its Applications in Electric Network Theory and in Statics (Andras Recszki, 1989, vol. 6)
Irregularities of Partitions: Papers from the meeting held in Fertőd, July 7–11, 1986 (
Gábor Halász and
Vera T. Sós, eds., 1989, vol. 8)
Paths, Flows, and VLSI-Layout: Papers from the meeting held at the University of Bonn, Bonn, June 20–July 1, 1988 (
Bernhard Korte,
László Lovász, Hans Jürgen Prömel, and
Alexander Schrijver, eds., 1990, vol. 9)
New Trends in Discrete and Computational Geometry (
János Pach, ed., 1993, vol. 10)
Discrete Images, Objects, and Functions in (Klaus Voss, 1993, vol. 11)
Linear Optimization and Extensions (Manfred Padberg, 1999, vol. 12)
Graph Colouring and the Probabilistic Method (Michael Molloy and
Bruce Reed, 2002, Vol. 23)
Combinatorial Optimization: Polyhedra and Efficiency (
Alexander Schrijver, 2003, vol. 24. In three volumes: A. Paths, flows, matchings; B. Matroids, trees, stable sets; C. Disjoint paths, hypergraphs)
Discrete and Computational Geometry: The Goodman-Pollack Festschrift (
B. Aronov, S. Basu,
J. Pach, and
M. Sharir, eds., 2003, vol. 25)
Topics in Discrete Mathematics: Dedicated to Jarik Nešetril on the Occasion of his 60th birthday (M. Klazar,
J. Kratochvíl, M. Loebl,
J. Matoušek,
R. Thomas, and P. Valtr, eds., 2006, vol. 26)
Boolean Function Complexity: Advances and Frontiers (Stasys Jukna, 2012, Vol. 27)
Matroid Theory and its Applications in Electric Network Theory and in Statics (Andras Recszki, 1989, vol. 6)
Irregularities of Partitions: Papers from the meeting held in Fertőd, July 7–11, 1986 (
Gábor Halász and
Vera T. Sós, eds., 1989, vol. 8)
Paths, Flows, and VLSI-Layout: Papers from the meeting held at the University of Bonn, Bonn, June 20–July 1, 1988 (
Bernhard Korte,
László Lovász, Hans Jürgen Prömel, and
Alexander Schrijver, eds., 1990, vol. 9)
New Trends in Discrete and Computational Geometry (
János Pach, ed., 1993, vol. 10)
Discrete Images, Objects, and Functions in (Klaus Voss, 1993, vol. 11)
Linear Optimization and Extensions (Manfred Padberg, 1999, vol. 12)
Graph Colouring and the Probabilistic Method (Michael Molloy and
Bruce Reed, 2002, Vol. 23)
Combinatorial Optimization: Polyhedra and Efficiency (
Alexander Schrijver, 2003, vol. 24. In three volumes: A. Paths, flows, matchings; B. Matroids, trees, stable sets; C. Disjoint paths, hypergraphs)
Discrete and Computational Geometry: The Goodman-Pollack Festschrift (
B. Aronov, S. Basu,
J. Pach, and
M. Sharir, eds., 2003, vol. 25)
Topics in Discrete Mathematics: Dedicated to Jarik Nešetril on the Occasion of his 60th birthday (M. Klazar,
J. Kratochvíl, M. Loebl,
J. Matoušek,
R. Thomas, and P. Valtr, eds., 2006, vol. 26)
Boolean Function Complexity: Advances and Frontiers (Stasys Jukna, 2012, Vol. 27)