Tenth SIAM Conference on Discrete Mathematics, June 12-15, 2000, Radisson Metrodome Hotel, Minneapolis, Minnesota

Sponsored by SIAM Activity Group on Discrete Mathematics
With the cooperation of the Institute for Mathematics and Its Applications

About the Conference | Who Should Attend | Major Themes

About the Conference

Discrete mathematics is a relatively young branch of the mathematical sciences, with a wide range of challenging research problems and important applications in industry. Discrete mathematics has applications to all fields of computer science, and to the physical and biological sciences. It is used extensively in telecommunications, information processing and manufacturing, and many businesses and industries use techniques of discrete optimization to improve the efficiency of their operations.

Discrete mathematics is a dynamic and rapidly expanding field and is experiencing explosive growth in both theory and applications. Researchers in discrete mathematics have established important connections with mainstream areas of pure and applied mathematics, and as a consequence, research techniques and problems are drawn from a wide range of different fields, including algebra,topology, geometry, probability, analysis, and logic.

The purpose of this conference is to highlight the major theoretical advances in the field, the development of new tools for discrete mathematics, and the most significant of the new applications of discrete mathematics to problems arising in industry and business. The conference also seeks to bring together participants from the many different environments where discrete mathematics is developed and applied.

Who Should Attend?

The conference will bring together researchers in discrete mathematics, geometry, algebra, computer science, combinatorial optimization, and operations research. The wide scope of the conference should provide an excellent opportunity for sharing of ideas and problems among specialists in and users of discrete mathematics from academia, government and industry.

Major Themes

Traditional Areas of Discrete Mathematics:

  • Graph Theory
  • Combinatorics
  • Ordered Sets
  • Combinatorial Designs and Codes
  • Combinatorial Algorithms

Highlighting Interactions with:

  • Symbolic Computation
  • Combinatorial and Computational Geometry
  • Computational Biology
  • Statistical Mechanics
  • Number Theory

©2000 Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 3/16/00; Updated 5/13/00