Computational discrete mathematics. Advanced lectures (Q5952658)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Aigner, Martin}, Lattice paths and determinants, 1-12 [Zbl 0999.05007] \textit{Alt, Helmut}, The nearest neighbor, 13-24 [Zbl 1027.68715] \textit{Gärtner, Bernd; Welzl, Emo}, Explicit and implicit enforcing -- randomized optimization, 25-46 [Zbl 1002.68195] \textit{Helleseth, Tor}, Codes over \(Z_4\), 47-55 [Zbl 1002.68053] \textit{Jung, Heinz Adolf}, Degree bounds for long paths and cycles in \(k\)-connected graphs, 56-60 [Zbl 0996.05082] \textit{Meinel, Christoph; Stangier, Christian}, Data structures for Boolean functions. BDDs -- foundations and applications., 61-78 [Zbl 1052.68135] \textit{Möhring, Rolf H.}, Scheduling under uncertainty: Bounding the makespan distribution, 79-97 [Zbl 1015.90046] \textit{Prömel, Hans Jürgen; Taraz, Anusch}, Random graphs, random triangle-free graphs, and random partial orders, 98-118 [Zbl 1001.05105] \textit{Rote, Günter}, Division-free algorithms for the determinant and the Pfaffian: Algebraic and combinatorial approaches, 119-135 [Zbl 1010.65022] \textit{Schulz, Ralph-Hardo}, Check character systems and anti-symmetric mappings, 136-147 [Zbl 1003.94537] \textit{Stroth, Gernot}, Algorithms in pure mathematics, 148-158 [Zbl 1011.20001] \textit{Ziegler, Günter M.}, Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions, 159-171 [Zbl 1004.52010]