The general topic of the conference is the theory and application of discrete structures. Its goal is to highlight the most salient trends in the field. The conference will bring together researchers from the various disciplines with which discrete and algorithmic mathematics interact. Particular areas of interest include graphs and digraphs, hypergraphs, matroids, ordered sets, designs, coding theory, enumeration, combinatorics of words, discrete optimization, discrete and computational geometry, lattice point enumeration, combinatorial algorithms, computational complexity, and applications of discrete and algorithmic mathematics, including (but not limited to) web graphs, computational biology, telecommunication networks, and information processing. The conference will follow its usual format. There will be eight plenary talks, one public interest talk, and invited mini-symposia, as well as contributed mini-symposia and talks
Topics: graphs and digraphs, hypergraphs, matroids, ordered sets, designs, coding theory, enumeration, combinatorics of words, discrete optimization, discrete and computational geometry, lattice point enumeration, combinatorial algorithms, computational complexity
