DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 1999; 389 pp; hardcover Volume: 49 ISBN10: 0821809636 ISBN13: 9780821809631 List Price: US$105 Member Price: US$84 Order Code: DIMACS/49
 Discrete mathematics stands among the leading disciplines of mathematics and theoretical computer science. This is due primarily to its increasing role in university curricula and its growing importance in applications ranging from optimization to molecular biology. An inaugural conference was held cooperatively by DIMATIA and DIMACS to focus on the versatility, width, and depth of current progress in the subject area. This volume offers a wellbalanced blend of research and survey papers reflecting the exciting, attractive topics in contemporary discrete mathematics. Discussed in the book are topics such as graph theory, partially ordered sets, geometrical Ramsey theory, computational complexity issues and applications. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Readership Graduate students and research mathematicians interested in discrete mathematics, theoretical computer science and applications; operations research scientists and computer scientists. Table of Contents  P. Boiron, E. Sopena, and L. Vignal  Acyclic improper colourings of graphs with bounded degree
 P. Ossona de Mendez and H. de Fraysseix  Intersection graphs of Jordan arcs
 J. Díaz, M. Serna, and P. Spirakis  Linear and nonlinear systems: A survey
 R. G. Downey, M. R. Fellows, and U. Stege  Parameterized complexity: A framework for systematically confronting computational intractability
 G. Elekes  On the structure of large homothetic subsets
 S. P. Fekete, W. Hochstättler, S. Kromberg, and C. Moll  The complexity of an inverse shortest paths problem
 A. Frank  Finding minimum weighted generators of a path system
 J. R. Griggs and G. Rote  On the distribution of sums of vectors in general position
 A. Gupta, D. Kaller, S. Mahajan, and T. Shermer  The generalized matching problem on partial \(k\)trees
 W. Hochstättler and M. Loebl  Bases of cocycle lattices and submatrices of a Hadamard matrix
 M. Klazar  On the maximum lengths of DavenportSchinzel sequences
 A. V. Kostochka, T. Luczak, G. Simonyi, and E. Sopena  On the minimum number of edges giving maximum oriented chromatic number
 J. Kratochvíl, Zs. Tuza, and M. Voigt  New trends in the theory of graph colorings: Choosability and list coloring
 W. Mader  Topological minors in graphs of minimum degree \(n\)
 P. Mihók  Reducible properties and uniquely partitionable graphs
 J. Nešetřil, J. Solymosi, and P. Valtr  Induced monochromatic subconfigurations
 J. Nešetřil and C. Tardif  Density
 P. Pančoška, V. Janota, and J. Nešetřil  Spectra, graphs, and proteins. Towards understanding of protein folding
 F. S. Roberts  Meaningless statements
 M. Rosenfeld  Graceful matchings in finite fields, the factordifference sets of integers, and integers of the form \(a^2 + kb^2\)
 M. Simonovits  How to solve a Turán type extremal graph problem? (Linear decomposition)
 A. Sali and G. Simonyi  Oriented list colouring of undirected graphs
 J. Spencer and L. Thoma  On the limit values of probabilities for the first order properties of graphs
 W. T. Trotter  Ramsey theory and partially ordered sets
 P. Valtr  Generalizations of DavenportSchinzel sequences
