Following are subject classifications for the sessions. The codes in parentheses designate session type and number. The session types are contributed presentations (CP), invited presentations (IP), joint plenary sessions (JP) and minisymposia (MS). The poster session will take place on Monday, 6:30 PM-8:00 PM, Sidney Smith Building, Hangar Pub.

Algorithms and Complexity | Applications | Combinatorial Optimization | Connections with Other Branches of Mathematics | Graph Theory | Probabilistic CombinatoricsApproximation Algorithms -Parts I and II (MS17 and MS20)

Graph Algorithms Via Spectral Techniques (JP1)

Hamiltonicity (CP14)

Parameterized Complexity (MS6)

Permanents, Pfaffian Orientations, and Even-Directed Circuits (IP4)

Randomized Algorithms (MS15)

The Traveling Salesman Problem (IP3)

Well Structured Graphs and Algorithms (MS11)

Computational Biology (CP4)

Computational Molecular Biology (MS14)

Discrete Mathematics as a Tool for Molecular Biology (JP2)

Efficient Scheduling Algorithms - Parts I and II (MS7 and MS10)

Enumerative Combinatorics and Related Applications (MS5)

Visibility Representations for Graphs (IP2)

Networks (CP6)

Recent Advances in Radio Channel Assignment (MS20)

Efficient Scheduling Algorithms - Parts I and II (MS7 and MS10)

Matroid Representation (MS13)

Polyhedral Combinatorics (CP10)

Scheduling (CP2)

Semidefinite Programming in Combinatorial Optimization (IP5)

The Traveling Salesman Problem (IP3)

Algebraic Combinatorics (CP1)

Combinatorial Designs (CP7)

Enumerative Combinatorics and Related Applications (MS5)

Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures (IP1)

Interaction Between Number Theory and Combinatorics (IP6)

Logic and Random Structures (MS2)

Matroid Representation (MS13)

Number Theory and Formal Languages (MS19)

Ordered Sets (CP3)

Discharging Methods (MS17)

Diverse Topics (CP8)

Graph Coloring (CP5)

Graph Theory I and II (CP9 and CP15)

Perfect Graphs - Parts I and II (MS1 and MS3)

Perfect Graphs and Intersection Families (CP12)

Permanents, Pfaffian Orientations, and Even-Directed Circuits (IP4)

Trees and Enumeration (CP11)

Topological Graph Theory (MS16)

Recent Developments on the Regularity Lemma (MS4)

Visibility Representations for Graphs (IP2)

Well Structured Graphs and Algorithms (MS11)

Concentration of Measure and Isoperimetric Inequalities (MS8)

Graph Algorithms Via Spectral Techniques (JP1)

Logic and Random Structures (MS2)

Probabilistic Combinatorics (CP13)

Random and Asymptotic Methods for Combinatorial Structures (MS12)

Randomized Algorithms (MS15)

The Probabilistic Method (MS9)