
Program
All talks will take place in room 137 of the Information Technology Building
 map
Thursday, August 18
8:008:50 

Registration and continental breakfast 
8:509:00 

Welcome
Mo Elbestawi, Dean, Faculty of Engineering 
9:0010:00 
Invited I 
Proof complexity and combinatorial principles  Stephen
Cook, University of Toronto 
10:0010:15 
Break 

10:1510:40 
1A 
Characterizations of unsatisfiability via semidefinite
optimization  Miguel Anjos, University of Waterloo 
10:4011:05 
1B 
Stable matching problems with exchange restrictions
 Robert Irving, University of Glasgow

11:0511:30 
1C 
Subdivisions with low stabbing numbers  Csaba Toth,
Massachusetts Institute of Technology 
11:3011:55 
1D 
Random extraction from freehand drawings and its semantics
based on forcing complexity  Toshio Suzuki, Osaka Prefecture University

12:0013:00 
Lunch 

13:0014:00 
Invited II 
Approximate and exact completion problems for euclidean
distance matrices using semidefinite programming  Henry Wolkowicz,
University of Waterloo 
14:0014:25 
2A 
How good are interior point methods?
KleeMinty cubes tighten iterationcomplexity bounds  Eissa Nematollahi,
McMaster University 
14:2514:50 
2B 
Sorting with networks of data structures  Angele Hamel,
Wilfrid Laurier University 
14:5015:15 
2C 
On the diameter of a mixed chordal ring network  Jennifer
Chen, National Chiao Tung University 
15:1515:30 
Break 

15:3015:55 
3A 
Packing trees in VLSI design and communication networks
 Hu Zhang, McMaster University 
15:5516:20 
3B 
Global bounds for the VLSI macrocell floorplanning
using semidefinite programming  Matthias Takouda, University of Waterloo

16:2016:45 
3C 
VLSI floorplanning using a novel combinatorial optimization
technique  Chaomin Luo, University of Waterloo 
16:4517:00 
Break 

17:0017:25 
4A 
The test suite generation problem: optimal instances
and their implications  Christine Cheng, University of Wisconsin 
17:2517:50 
4B 
Constructing broadcast graphs on odd number of vertices
 Hovhannes Harutyunyan, Concordia University 
17:5018:15 
4C 
An efficient tree matching algorithm  Yangjun Chen,
University of Winnipeg 
18:30
19:0022:00

Bus departure
Banquet 

Friday, August 19
8:309:00 

Continental Breakfast 
9:0010:00 
Invited III 
Fractional total colouring  Bruce Reed, McGill University 
10:0010:15 
Break 

10:1510:40 
5A 
Geometric and combinatorial issues in data depth  Greg
Aloupis, Université Libre de Bruxelles 
10:4011:05 
5B 
Colourful simplicial depth  Tamon Stephen, McMaster University

11:0511:30 
5C 
Primaldual methods for data depth  David Bremner, University of
New Brunswick 
11:3011:55 
5D 
Generalized Berge moves  William Hua, McMaster University 
12:0013:00 
Lunch 

13:0014:00 
Invited IV 
Combinatorics of algebraic structures  Nantel Bergeron, York University

14:0014:25 
6A 
A problem on semigroups with applications to the Ktheory of C*algebras
 Hugh Thomas, University of New Brunswick 
14:2514:50 
6B 
A fine classification of closed planar sets according to their nonconvexity
 Ziva Deutsch, Jerusalem College 
14:5015:15 
6C 
Canonical triangulation of a graph, with a coding application 
Luca Castelli Aleardi, Ecole Polytechnique 
15:1515:30 
Break 

15:3016:30 
Invited V 
Interplay between algorithms and combinatorics on words  Maxime
Crochemore, Université de MarnelaVallée 
16:3016:55 
7A 
Random De Bruijn sequences and the design of DNA codewords  Christine
Heitsch, University of Wisconsin 
16:5517:20 
7B 
A loopless Gray code for minimal signed binary representations 
Joe Sawada, University of Guelph 
17:2017:45 
7C 
Lexicographically sorting fibonacci rotations  Manolis Christodoulakis,
King's College 
17:4518:10 
7D 
Wildcards in delta matching  Yoan Pinzon, King's College 
Saturday, August 20
8:309:00 

Continental Breakfast 
9:0010:00 
Invited VI 
Algorithms for some disjoint path problems  Bill Cunningham,
University of Waterloo 
10:0010:15 
Break 

10:1510:40 
8A 
On the maximum number of allowed Tpaths  Laszlo Szego,
University of Waterloo 
10:4011:05 
8B 
Recognizing greedy structures  David Tankus, Tel Aviv
University and the Negev Academic College of Engineering 
11:0511:30 
8C 
Vertex magic cycles, edge magic cycles  Dan McQuillan,
Norwich University 
11:3011:55 
8D 
On the structure of Lehman matrices  Bertrand Guenin, University
of Waterloo 
12:0013:00 
Lunch 

13:0014:00 
Invited VII 
Good colorations of the vertices of a simple polytope
and a theorem of scarf  Jean Fonlupt, Université de Paris
VI 
14:0014:25 
9A 
Minimum Entropy Coloring  Samuel Fiorini, Université
Libre de Bruxelles 
14:2514:50 
9B 
Some properties of the cut polyhedron  Viet Hung Nguyen,
Université de Paris VI 
14:5015:15 
9C 
On cutting plane algorithms Walid BenAmeur, Institut
National des Télécomunications 
15:1515:30 
Break 

15:3015:55 
10A 
Utilizing IMRT intensity map complexity measures in segmentation
algorithms  Kelly Sorensen, University of Wisconsin 
15:5516:20 
10B 
A column generation feasibility approach for the bin
packing problem  Samir Elhedhli, University of Waterloo 
16:2016:45 
10C 
Performance ratio of dense schedules for openshop with
job release dates  Rongjun Chen, Lakehead University 
16:4517:10 
10D 
Reasoning with Permutations  Tim Paterson, McMaster
University 
17:1017:20 

Closing Remarks 
Workshop Banquet
The workshop banquet will be held aboard the Hamilton Harbour
Queen on Thursday, August 18. Enjoy a delicious dinner, live entertainment
and panoramic views while cruising one of North America’s most noteworthy
harbours. This is included in your registration fee, however additional
banquet tickets ($50 CAD) may be purchased by registrants prior to the
workshop (see registration form).
A limited number of banquet tickets may also be available for purchase
at the registration desk.
