The third Canadian Discrete and Algorithmic Mathematics Conference
(CanaDAM) will be held May 31 to June 3, 2011 on the campus of the
University of Victoria in beautiful Victoria, British Columbia,
Canada.
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. CanaDAM is held in odd numbered years using a format similar
to the SIAM Conference on Discrete Mathematics. 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.
Please check the conference website, http://CanaDAM.Math.ca/2011, for
information about:
* contacts,
* accommodation,
* important dates,
* fees,
* local information,
* student/PDF funding,
* the organizing team, and
* how to participate in the meeting by submitting a talk or minisymposium.
The deadline for submission of
a minisymposium is January 15, 2011 (acceptance notifications send by
January 31, 2011). The deadline for submission of a contributed talk
is January 31, 2011 (acceptance notifications sent by February 7,
2011).
The deadline for Student / PDF funding applications is March 7, 2011
(notifications sent by March 28, 2011)
Online registration will be available shortly. The early registration
deadline is April 7, 2011.
Confirmed Invited Speakers:
Anne Bergeron (UQAM)
Sara Billey (University of Washington)
Allan Borodin (University of Toronto)
Chandra Chekuri (University of Illinois, Urbana-Champaign)
Jacob Fox (MIT)
Jeff Kahn (Rutgers University)
Alice Silverberg (University of California at Irvine)
Stephan Thomasse (Universite Montpellier 2)
Confirmed Invited Minisymposia:
Discrete and Computational Geometry - Binay Bhattacharya (Simon Fraser
University)
Combinatorics/Discrete Mathematics in Genomics - Miklos Csuros
(University of Montreal)
Cryptography - Bruce Kapron (University of Victoria)
Extremal Graph Theory - Penny Haxell (University of Waterloo)
Combinatorial Optimization - Mohit Singh (McGill)
Recent Advances in Computational Complexity - Venkatesh Srinivasan
(University of Victoria)
Algebraic Combinatorics - Mike Zabrocki (York University)
Probabilistic Combinatorics - Tom Bohman and Po-Shen Loh (Carnegie
Mellon University)
Problem Session - hosted by Brett Stevens (Carleton University)
Please submit open problems for this session directly to Brett at
brett@math.carleton.ca, and
put "CanaDAM open problems" in the Subject: field when doing so.
Please pass this message along to colleagues in discrete mathematics.
Our apologies to those who receive it more than once. The organizing
team expresses its thanks and gratitude to the Canadian Mathematical
Society for the conference's web presence.
======================================================
CanaDAM 2011
Deuxieme annonce et soumission de presentations et de minisymposiums
Le Troisieme congres canadien de mathematiques discretes et
algorithmiques aura lieu du 31 mai au 3 juin 2011 sur le campus de
l'Universite de Victoria, situe dans la belle ville de Victoria
(Colombie-Britannique, Canada). Le congres portera sur la theorie et
les applications des structures discretes. Son but est de mettre en
evidence les developpements recents et importants de cette branche des
mathematiques. Le congres rassemblera des chercheurs des diverses
disciplines ayant des interactions avec les mathematiques discretes et
algorithmiques. Les congres CanaDAM ont lieu pendant les annees impaires
et leur format est semblable a celui de la SIAM Conference on Discrete
Mathematics. Parmi les sujets qui seront abordes, mentionnons en
particulier les graphes et digraphes, les matroides, les ensembles
ordonnes, la combinatoire des plans d'experience, la theorie des codes,
le denombrement des structures discretes, la combinatoire des mots,
l'optimisation discrete, la geometrie discrete et algorithmique, le
denombrement des points d'un treillis, les algorithmes combinatoires,
la theorie de la complexite, et finalement les applications des
mathematiques discretes et algorithmiques, incluant (entre autres) les
applications aux graphes de la toile, a la biologie computationnelle,
aux reseaux de telecommunication et au traitement de l'information.
Veuillez consulter le site du congres, http://CanaDAM.Math.ca/2011 ,
pour des renseignements sur
* les personnes a contacter,
* l'hebergement,
* les dates importantes,
* les frais d'inscription,
* la ville et le campus,
* l'aide financiere pour les etudiants et stagiaires postdoctoraux,
* le comite d'organisation et
* la procedure pour soumettre une presentation ou un minisymposium.
Les minisymposiums devront etre
soumis au plus tard le 15 janvier 2011 et les personnes qui les
proposeront recevront une reponse au plus tard le 31 janvier 2011. Les
presentations devront etre soumises au plus tard le 31 janvier 2011 et
leurs auteurs recevront une reponse au plus tard le 7 fevrier 2011.
Les etudiants ou stagiaires postdoctoraux devront faire leur demande
d'aide financiere au plus tard le 7 mars 2011 et recevront une reponse
au plus tard le 28 mars 2011.
Il sera bientot possible de s'inscrire en ligne au congres. La date
limite pour l'inscription avec frais reduits est le 7 avril 2011.
Conferenciers invites ayant confirme leur participation
Anne Bergeron (UQAM)
Sara Billey (University of Washington)
Allan Borodin (University of Toronto)
Chandra Chekuri (University of Illinois, Urbana-Champaign)
Jacob Fox (MIT)
Jeff Kahn (Rutgers University)
Alice Silverberg (University of California at Irvine)
Stephan Thomasse (Universite Montpellier 2)
Minisymposiums sur invitation confirmes
Discrete and Computational Geometry - Binay Bhattacharya (Simon Fraser
University)
Combinatorics / Discrete Mathematics in Genomics - Miklos Csuros
(Universite de Montreal)
Cryptography - Bruce Kapron (University of Victoria)
Extremal Graph Theory - Penny Haxell (University of Waterloo)
Combinatorial Optimization - Mohit Singh (McGill)
Recent Advances in Computational Complexity - Venkatesh Srinivasan
(University of Victoria)
Algebraic Combinatorics - Mike Zabrocki (York University)
Probabilistic Combinatorics - Tom Bohman et Po-Shen Loh (Carnegie
Mellon University)
Seance de problemes
Brett Stevens, de l'Universite Carleton, presidera une seance de
problemes pendant le congres CanaDAM 2011. Toute personne desirant
soumettre des problemes ouverts est invitee a les envoyer a Brett
Stevens (brett@math.carleton.ca), en donnant "CanaDAM open problems"
comme sujet du message.
Veuillez faire circuler cette annonce parmi vos collegues en
mathematiques discretes, et nous excuser si vous la recevez plus d'une
fois. Le Comite d'organisation est tres reconnaissant a la Societe
mathematique du Canada de son aide pour la diffusion sur la toile des
informations concernant le congres.
==================
Gary MacGillivray
Department of Mathematics and Statistics
University of Victoria
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
