
SCIENTIFIC PROGRAMS AND ACTIVITIES 

April 20, 2019  
OttawaCarleton Discrete Mathematics Days 2008

Organizers:  

Qiang Wang (Carleton) 
Registration on site Fee $20 online to May 1, $25 onsite (there is no refund for cancellations) Students, postdocs, and invited speakers are fee exempt 
Schedule  Abstracts 
Contributed Talks  Participant List  
Invited Speakers  Directions to Carleton  Accommodation  Ottawa 
Since 2002, the Ottawa  Carleton Discrete Mathematics Day has
been held annually in the spring, alternating its location between
Carleton University and the University of Ottawa. The meeting is
an offspring of the Carleton Discrete Mathematics Days held in the
past at Carleton University. (For more information on recent Discrete
Mathematics Days please visit:
http://www.fields.utoronto.ca/programs/scientific/0607/discrete_math/
http://www.fields.utoronto.ca/programs/scientific/0506/discrete_math/
http://www.fields.utoronto.ca/programs/scientific/0405/discrete_math/
http://www.math.carleton.ca/~daniel/dmd04.html.
Traditionally, the meeting consists of four onehour invited talks presented in a single day, a Saturday. In addition, a fifth speaker is invited to give a colloquium talk in the Ottawa  Carleton Institute of Mathematics and Statistics on the preceding Friday afternoon. The invited speakers, known for their eloquence of presentation and excellence in research, are chosen carefully to cover a broad range of topics and aspects of discrete mathematics. The Friday colloquium talk is addressed to a general audience of mathematicians.
The objective of the meeting is to gather researchers, postdoctoral fellows, and graduate students from the Ontario/Quebec area working in various fields of discrete mathematics in order to stimulate research collaboration in this vibrant interdisciplinary area. This year's speakers for the Discrete Mathematics Day lead research in the areas of graph theory, combinatorial structures, combinatorial enumeration, and algorithms. They have been involved in theoretical, applied, and algorithmic aspects of discrete mathematics.
The Discrete Math Workshop will run for 2 days this year, Friday (May 9) and Saturday (May 10), and will include five onehour invited talks by the above speakers as well as contributed talks.
Please note that another workshop in graph theory http://www.fields.utoronto.ca/programs/scientific/0708/graph_theory/
will be also held at Carleton University from May 11 to May 13.
David Bremner, Technische Universität München
The duality between maximal separation and minimal distance
Ian Goulden, University of Waterloo
Maps and Branched Covers  Combinatorics, Geometry and Physics
Ortrud Oellermann, University of Winnipeg
Graph Classes Characterized by Local Convexities
Bruce Shepherd, McGill University
Robust Optimization of Networks
Qing Xiang, University of Deleware
Symplectic analogues of Hamada's Formula
Friday May 9 

9:00  9:30  Registration 
9:30  10:30  Ortrud R. Oellermann, University of Winnipeg Graph Classes Characterized by Local Convexities 
10:30  11:00  Coffee Break 
11:00  11:30  Andrea Burgess, University of Ottawa Closed trail decompositions of complete equipartite graphs 
11:30  12:00  Shonda Gosselin, University of Ottawa Selfcomplementary uniform hypergraphs 
12:00  2:00  Lunch Break 
2:00  2:30  Karen Meagher, University of Regina A MultiPartite Version of the ErdosKoRado Theorem 
2:30  3:00  Sebastian Raaphorst, University of Toronto A conjecture for antipasch maximum Partial Steiner Triple Systems 
3:00  3:30  Coffee Break 
3:30  4:30  Qing Xiang, University of Deleware Symplectic analogues of Hamada’s Formula 
5:00  Reception 
Saturday May 10 

9:30  10:30  Bruce Shepherd, McGill University Robust Optimization of Networks 
10:30  11:00  Coffee Break 
11:00  12:00  David Bremner, Technische University at
Munchen The duality between maximal separation and minimal distance 
12:00  2:00  Lunch Break 
2:00  3:00  Ian Goulden, University of Waterloo Maps and Branched Covers  Combinatorics, Geometry and Physics 
3:00  3:30  Coffee Break 
3:30  4:00  Jane Gao, University of Waterloo Connectivity of random regular graphs generated by the pegging algorithm 
4:00  4:30  Mateja Sajna, University of Ottawa Computing the probabilistic transitive closure of a bipolar weighted digraph 
Fullname  University Name 
AlBashabsheh, Ali  Carleton University 
Bailey, Robert  Carleton University 
Baker, Andrew  University of Guelph 
Boyd, Sylvia  University of Ottawa 
Bremner, David  University of New Brunswick 
Burgess, Andrea  University of Ottawa 
Cameron, Amy  University of Ottawa 
Epple, Dennis D.A.  University of Victoria 
Francetic, Nevena  University of Toronto 
Gao, Pu  University of Waterloo 
Gosselin, Shonda  University of Ottawa 
Goulden, Ian  University of Waterloo 
Haghighi, Maryam  University of Ottawa 
Harvey, Kyle  Carleton University 
Kennedy, William  McGill University 
Li, Zhentao  McGill University 
Meagher, Karen  University of Regina 
Naserasr, Reza  Carleton University 
Niesink, Patrick  University of Ottawa 
Oellermann, Ortrud  University of Winnipeg 
Raaphorst, Sebastian  
Raaphorst, Sebastian  University of Toronto 
Sajna, Mateja  University of Ottawa 
Shepherd, Bruce  McGill University 
Stevens, Brett  Carleton University 
Thomson, David  Carleton University 
Wang, Qiang Steven  Carleton University 
Xiang, Qing  University of Delaware 
Zhang, CunQuan  West Virginia University 
To Be Confirmed  
Kumar, Reji  University of Victoria 
Le, Anh Vinh  Harvard University 
Top