Computational Discrete Mathematics 2001

@proceedings{DBLP:conf/ac/2001cdm,
  editor    = {Helmut Alt},
  title     = {Computational Discrete Mathematics, Advanced Lectures},
  booktitle = {Computational Discrete Mathematics},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2122},
  year      = {2001},
  isbn      = {3-540-42775-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Martin Aigner:
  Lattice Paths and Determinants. 1-12
  Electronic Edition (Springer LINK) BibTeX
• Helmut Alt:
  The Nearest Neighbor. 13-24
  Electronic Edition (Springer LINK) BibTeX
• Bernd Gärtner, Emo Welzl:
  Explicit and Implicit Enforcing - Randomized Optimization. 25-46
  Electronic Edition (Springer LINK) BibTeX
• Tor Helleseth:
  Codes over Z₄. 47-55
  Electronic Edition (Springer LINK) BibTeX
• Heinz Adolf Jung:
  Degree Bounds for Long Paths and Cycles in k-Connected Graphs. 56-60
  Electronic Edition (Springer LINK) BibTeX
• Christoph Meinel, Christian Stangier:
  Data Structures for Boolean Functions. 61-78
  Electronic Edition (Springer LINK) BibTeX
• Rolf H. Möhring:
  Scheduling under Uncertainty: Bounding the Makespan Distribution. 79-97
  Electronic Edition (Springer LINK) BibTeX
• Hans Jürgen Prömel, Anusch Taraz:
  Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. 98-118
  Electronic Edition (Springer LINK) BibTeX
• Günter Rote:
  Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches. 119-135
  Electronic Edition (Springer LINK) BibTeX
• Ralph-Hardo Schulz:
  Check Character Systems and Anti-symmetric Mappings. 136-147
  Electronic Edition (Springer LINK) BibTeX
• Gernot Stroth:
  Algorithms in Pure Mathematics. 148-158
  Electronic Edition (Springer LINK) BibTeX
• Günter M. Ziegler:
  Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions. 159-172
  Electronic Edition (Springer LINK) BibTeX