Discrete mathematics is a 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 field 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.

Themes

Discrete Mathematics, including:

Design Theory
Enumeration
Extremal Combinatorics
Graph Theory
Combinatorial Algorithms
Ordered Sets
Algebraic Combinatorics
Topological and Analytical Techniques in Combinatorics
Probabilistic Combinatorics
Combinatorial Number Theory
Discrete Geometry
Ramsey Theory
Matroids

With connections to other disciplines, including:

Computer Science
Computational Biology
Optimization
Probability
Game Theory