East Coast Combinatorics

Members

• Tim Alderson (UNBSJ) --- geometry and coding theory. Tim@unbsj.ca
• Cathy A. Baker (MtA) --- geometry. cbaker@mta.ca
• Frank Bennett (MSVU) --- designs (PBD, Mendelsohn, conjugate orthogonal latin squares). frank.bennett@msvu.ca
• David Bremner (UNB) --- computational geometry. bremner@unb.ca
• Jason I. Brown (Dal) --- graphs and orders (network reliability, colourings, Ramsey theory, simplicial complexes). brown@mscs.dal.ca
• Nancy E. Clarke (Dal) --- graphs (cops-and-robbers, searching). nancy.clarke@acadiau.ca
• Robert MG Dawson (SMU) --- combinatorial geometries, robert.dawson@stmarys.ca
• Danny Dyer (SMU) --- graphs (searching), dyer@math.mun.ca
• Sara Faridi (Dal) --- Combinatorial Algebra, faridi@mathstat.dal.ca
• Art Finbow (SMU) --- graphs (independence, domination), art.finbow@stmarys.ca
• Stephen Finbow (SFX) --- graphs (independence, domination), sfinbow@stfx.ca
• Shannon Fitzpatrick (UPEI) ---Independence slfitzpatric@Upei.CA
• Georg Gunther (SWGC) --- graphs (independence, domination). ggunther@beothuk.swgc.mun.ca
• Bert L. Hartnell (SMU) --- graphs (independence, domination, products). bert.hartnell@stmarys.ca
• David Horrocks (UPEI) --- graphs (dependence); orders (Sperner Theory). dhorrocks@upei.ca
• John Irving (SMU) --- enumeration john.irving@smu.ca
• Jeannette Janssen (Dal) --- graphs janssen@mscs.dal.ca
• Michael McAllister (Dal) --- algorithms (geometric and graph algorithms) mcallist@cs.dal.ca
• Evangelos Milios (Dal) --- search and navigation in graph like worlds, and characterization of large graphs. eem@cs.dal.ca
• Barry Monson (UNB) --- abstract regular polytopes. barry@erdos.math.unb.ca
• Richard J. Nowakowski (Dal) --- graphs (products, independence, games on), combinatorial games. rjn@mscs.dal.ca
• David Pike (MUN) --- graph theory (graph decompositions and cycle properties). dapike@math.mun.ca
• Pawel Pralat (Dal) --- graph theory , pralat@mathstat.dal.ca
• James Preen (UCB) --- graph theory (hamiltonian cycles and algorithms). james_preen@uccb.ca
• Andrew Rau-Chaplin (Dal) --- algorithms (parallel geometric and graph algorithms). arc@cs.dal.ca
• Rolf Rees (MUN) --- Designs rolf@math.mun.ca
• Alyssa Sankey (UNB) --- association schemes, strongly regular graphs, alyssa@math.unb.ca
• Suzanne Seager (MSVU) --- graphs (food webs, domination). suzanne.seager@msvu.ca
• Nabil Shalaby (MUN) --- designs (Skolem, covering and packing). nshalaby@math.mun.ca
• Hugh Thomas (UNB) --- algebraic combinatorics, algebraic geometry, representation theory, hugh@erdos.math.unb.ca
• Ping Wang (StFX) --- graphs (girth, diameter). pwang@juliet.stfx.ca
• Norbert Zeh (Dal) --- graph algorithms. nzeh@cs.dal.ca

• Meghan Allen (Dal) --- combinatorial games. ameghan@mathstat.dal.ca
• Bob Garrish (Dal) --- graphs. drassk@miramichi.net
• Neil McKay (Dal) --- combinatorial games. themckayguy@gmail.com
• Sable McKeil (Dal) --- graphs (searching). SMCKEIL@DAL.CA
• Margaret-Ellen Messinger, (Dal) --- graphs (searching). MMESSING@DAL.CA
• Paul Ottaway, (Dal) --- combinatorial games. ottaway@mathstat.dal.ca
• Angela Siegel, (Dal) --- combinatorial games. siegel@mathstat.dal.ca,

• Activities - look here for seminar notes;