Trends in discrete mathematics
Author(s)
Bibliographic Information
Trends in discrete mathematics
(Topics in discrete mathematics, 9)
Elsevier, 1995
Available at 14 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"Reprinted from the journal Discrete mathematics, volume 136, numbers 1-3, [1994]."
Includes bibliographical references and index
Description and Table of Contents
Description
This volume has grown out of a symposium on "Trends in Discrete Mathematics" held in Bielefeld, 1992. The purpose of the symposium was to provide an overview on current and future trends in discrete mathematics. All contributions are by prominent researchers in their respective fields. The book constitutes a body of information on the many different aspects of discrete mathematics. This is a book that will appeal to non-experts as well as experts.
Table of Contents
- 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.
by "Nielsen BookData"