Date / Time / Room	Speaker	Title (link to abstract)
	Summer 2002
	Tue 14 May / 3:30 / EAA 1100	Rados Rodoicic, MIT	Rainbow Arithmetic Progressions
	Tue 28 May / 3:30 / EAA 1100	Sean McGuinness, U. Umea and Montana	Circuits intersecting cocircuits in graphs and matroids.
	Tue 11 Jun / 3:30 / EAA 1100	Claude Tardif, U. Regina	The projectivity of the graphs $G_d^k$
	Tue 18 Jun / 3:30 / K 9509	Joergen Bang-Jensen, U. Southern Denmark	Steiner type problems in tournament-like digraphs
	Tue 25 Jun / 3:30 / K 9500 (!)	Winfried Hochstaettler, Brandenburg U. of Tech.	Max-flow min-cut duality for a paint shop problem
	Tue 02 Jul / 3:30 / EAA 1100	Luis Goddyn, Mathematics, SFU	Flows and Tensions on maps of high edge width.
	Tue 09 Jul / 3:30 / EAA 1100	Peter Higgins, Mathematics,	Sur une Th\'eor\`eme de Sierpi\'nsk (In English!)
	Tue 16 Jul / 3:30 / EAA 1100	Khee-Meng Koh, Nat. U. of Singapore	On the Chromaticity of graphs
	Tue 23 Jul / 3:30 / EAA 1100	UBC PiMS Event - Lovasz	See their program for titles and abstracts.
	Tue 30 Jul / 3:30 / EAA 1100	Marnie Mishna	Enumeration via D-finite Symmetric Functions
	Tue 6 Aug / 3:30 / EAA 1100	Luis Goddyn	Chromatic numbers of matroids
	Tue 6 Aug / 3:30 / EAA 1100	Bill McCuaig	Edmonds' arc-disjoint arborescences theorem
	Past Semesters:
	Spring 2002
	Tue 05 Feb / 3:30 / EAA 1100	Reza Naserasr, Math, SFU	Homomorphisms from sparse graphs with large girth.
	Tue 12 Feb / 3:30 / EAA 1100	Qianping Gu, CS, SFU	Permutation routing on WDM optical hypercubes I.
	Tue 19 Feb / 3:30 / EAA 1100	Qianping Gu, CS, SFU	Permutation routing on WDM optical hypercubes II.
	Tue 05 Mar / 3:30 / EAA 1100	Luis Goddyn, Math, SFU	Graph coloring and Matroids.
	Tue 05 Mar / 3:30 / EAA 1100	Tom Friedetzky, CS, SFU	The Natural Work-Stealing Algorithm is Stable
	Tue 19 Mar / 3:30 / EAA 1100	Petr Lisonek, Math, SFU	Caps and Binary Linear Codes
	Tue 26 Mar / 3:30 / EAA 1100	Petra Berenbrink, CS, SFU	Simple routing strategies for Adversarial networks.
	Tue 02 Apr / 3:30 / EAA 1100	Pavol Hell, CS/Math, SFU	Complexity of generalized list-colourings.
	Tue 09 Apr / 3:30 / EAA 1100	Laco Stacho, Math, SFU	Edge-disjoint spanners in the Cartesian product of graphs
	Fall 2001
	Tue 18 Sep / 3:30 / EAA 1100	Luis Goddyn, Math, SFU	Binary Gray Codes with long bit runs.
	Tue 25 Sep / 3:30 / EAA 1100	Louis Ibarra, CS, SFU	The clique-separator graph for chordal graphs and its subclasses.
	Tue 02 Oct / 3:30 / EAA 1100	Ladislav Stacho, Math, SFU	New upper-bound for chromatic number.
	Tue 09 Oct / 3:30 / EAA 1100	Amitava Bhattacharya, TIFR	A short proof of a EKR type theorem.
	Tue 16 Oct / 3:30 / EAA 1100	Juan Montellano, UNAM	Anti-Ramsey Problems.
	Tue 23 Oct / 3:30 / EAA 1100	Ladislav Stacho, Math, SFU	Spannin trees with bounded number of branch vertices.
	Tue 30 Oct / 3:30 / EAA 1100	Bill McCuaig, Math, SFU	The Hat Game.
	Tue 06 Nov / 3:30 / EAA 1100	Mohammad Ghebleh, Math, SFU	Uniuqely list colorable graphs.
	Tue 13 Nov / 3:30 / EAA 1100	Petr Lisonek, Math, SFU	Geometric Representations of Graphs.
	Tue 20 Nov / 3:30 / EAA 1100	Luis Goddyn, Math, SFU	Using the Nullstellensatz for edge list colouring.
	Tue 27 Nov / 3:30 / EAA 1100	Reza Naserasr, Math, SFU	On the covering number of graphs.
	Tue 04 Dec / 3:30 / EAA 1100	Roded Sharan, Technion, Haifa	Incomplete Directed Perfect Phylogeny.
	Tue 11 Dec / 3:30 / EAA 1100	Frederic Havet, CNRS, France	Design of fault tolerant on-board networks with priorities
	Tue 18 Dec / 3:30 / EAA 1100	Mirka Miller, Newcastle, Australia	Eccentric Digraphs
	Summer 2001
	Thu 10 May / 3:30 / EAA 1100	John Mighton, Fields Inst.	A New Reduction of Graph Theory and Binary Matroids
	Tue 15 May / 3:30 / EAA 1100	Sergei Bespamyatnikh, CS, U. British Columbia	Graph of triangulations of convex polytopes in R^3
	Tue 26 Jun / 3:30 / K 9509	Matt DeVos, Princeton U.	On Packing T-Joins
	Tue 10 Jul / 3:30 / EAA 1100	Moishe Rosenfeld, U. of Washington	Hamiltonian Decomposition of Prisms over cubic graphs
	Tue 17 Jul / 3:30 / K 9509	Claude Tardif, U. of Regina	Fractional aspects of Hedetniemi's conjecture
	Spring 2001
	Tue 30 Jan / 3:30 / K9509	Reza Naserasr, Math, SFU	On $\Delta$-critical graphs
	Wed 31 Jan / 2:30 / K9509	Brett Stevens, Math, SFU	Packing and covering designs
	Tue 06 Feb / 3:30 / K9509	Luis Goddyn, Math, SFU	Range-restricted flows in regular matroids.
	Tue 13 Feb / 3:30 / EAA 1100	Jarik Nesetril, Charles University, Prague	On a homomorphism duality for oriented trees.
	Tue 20 Feb / 2:30 / EAA 1100	Valentine Kabanets, Inst. for Advanced Study	In search of an easy witness: Exponential time vs probabilistic polytime.
	Tue 20 Feb / 3:40 / EAA 1100	Wayne Broughton, Okanagan University Coll.	Quasi-3 Designs and Hadamard Matrices.
	Wed 28 Feb / 3:30 / K9509	Pavol Hell, SFU	List homomorphisms and partitions
	Tue 6 Mar / 3:30 / EAA 1100	Steph Durocher, U. British Columbia	The tangled tale of the rectilinear crossing number of K_n
	Tue 13 Mar / 3:30 / EAA 1100	Richard Anstee, U. British Columbia	Small Forbidden Configurations
	Tue 20 Mar / 3:30 / EAA 1100	Brett Stevens, Math, SFU	Packing Arrays II: Beyond Codes, the Triumphant Return of Designs!
	Tue 27 Mar / 2:30 / EAA 1100	Lou Ibarra, U. Victoria	Dynamic algorithms for chordal and interval graphs.
	Tue 27 Mar / 3:30 / EAA 1100	Jonathan Jedwab, Hewlett-Packard Labs, Bristol	Combinatorial Design Theory in an Industrial Research Lab
	Wed 28 Mar / 2:30 / K 9509	William Evans, U. British Columbia	Recovering lines with fixed linear probes
	Wed 28 Mar / 3:30 / K 9509	Petr Lisonek, Math, SFU	Classification of Binary Linear Codes with Small Codimension
	Tue 3 Apr / 3:30 / EAA 1100	Mateja Sajna, Capilano Coll.	Decomposition of complete graphs into cycles of a fixed length
	Wed 4 Apr / 3:30 / K 9509	Veselin Jungic, Math, SFU	Diophantine Ramsey Theory and Recurrence in Dynamical Systems
	Tue 10 Apr / 3:30 / EAA 1100	Ladislav Stacho, Math, SFU	Edge Disjoint Cycles Through Prescribed Vertices
	Tue 17 Apr / 3:30 / EAA 1100	Nancy Neudauer, Pacific Lutheren U.	Bicircular Matroids and Transversal Presentations