Trends in Discrete Mathematics

Realizability and uniqueness in graphs, M. Aigner and E. Triesch; an order theoretic framework for overlapping clustering, H.-J. Bandelt and A.W.M. Dress; search problems - one, two or many rounds, C.A. Christen; problems and results in discrete mathematics, P. Erd s; on additive properties of general sequences, P. Erd s et al; on the fractional dimension of partially ordered sets, S. Felsner and W.T. Trotter; recent trends in euclidean Ramsey theory, R.L. Graham; on the complexity of some basic problems in computational convexity - 1. containment problems, P. Gritzmann and V. Klee; probabilistically checkable proofs and their consequences for approximation algorithms, S. Hougardy et al; phase transition phenomena in random discrete structures, T. Luczak; the use of elementary substructures in combinatorics, E.C. Milner; some combinatorial-algebraic problems from complexity theory, P. Pudlak and V. Rodl; isometric embeddings and geometric designs, J.J. Seidel; from erdos to algorithms, J. Spencer; binomial identities - combinatorial and algorithmic aspects, V. Strehl; efficient data structures for Boolean functions, I. Wegener; the random cluster process, D.J.A. Welsh.