Use this form to submit a title and abstract for a talk that has been invited, or is proposed as a contribution to the conference. Please choose either "Contributed Talks", or the name of the minisymposium in which you were invited to speak. Contributed talks are welcomed in all subject areas consistent with the conference themes and are reviewed by the Program Committee prior to acceptance.

All talks, except in the case of Plenary Speakers, are 25 minutes in length (including questions).

Submit abstract to:

-- select -- Plenary Speakers -------- Broadcast and Algorithms Complexity and Reductions Designs Enumeration I Enumeration II Graph Colouring Graph Theory I Graph Theory II Graph Theory III Graph Theory IV Matroids, Codes and Numbers Optimization Ramsey Theory and Extremal Combinatorics Random Graphs Visibility and Geometry Words and Recurrences -------- Algebraic Combinatorics Algorithmic Methods in Comparative Genomics Analytic Combinatorics Applications of Generating Functions Applied Combinatorics and the Natural Sciences I Applied Combinatorics and the Natural Sciences II Chromatic Graph Theory Combinatorics and Geometry of Linear Optimization Cycle Decompositions of Graphs I Cycle Decompositions of Graphs II Decidability in Automatic and Related Sequences Design Theory Discrete Math Coast to Coast: Newfoundland and the West Discrete Math Coast to Coast: The Maritimes and the Middle Domination in Graphs Enumerative Combinatorics Eric Mendelsohn: Colleagues and Descendants I Eric Mendelsohn: Colleagues and Descendants II Eric Mendelsohn: Colleagues and Descendants III Extremal Combinatorics Finite Fields in Combinatorics I Finite Fields in Combinatorics II Galois Geometries and Applications I Galois Geometries and Applications II Geometric Representations of Graphs Graph Homomorphisms Graph Structure and Algorithms Graph Theory Graph Theory with Applications in Chemistry I Graph Theory with Applications in Chemistry II Gray Codes and Universal Cycles Hypergraphs Independence Number: Theory and Applications I. Independence Number: Theory and Applications II. Nested Recurrence Relations Partitioning Graphs into Independent Sets and Cliques Popular Lecture Probabilistic Combinatorics

 

Surname:

 

Given name(s):

 

Name:

Only abstracts from those on the official list of speakers will be accepted. If your name does not appear in the list above (or is incorrect), please contact the session organizer to request a change.

 

Email:

 

Institution:

 

Talk Title:

 

Subject Area:

-- select -- applications of discrete and algorithmic mathematics coding theory combinatorial algorithms combinatorics of words computational biology computational complexity designs discrete and computational geometry discrete optimization enumeration graphs and digraphs hypergraphs information processing lattice point enumeration matroids ordered sets telecommunication networks web graphs other

 

 

 

Note: You must check the Print View above before submitting this form.