The Combinatorics Group

  1. Faculty
  2. Current Graduate Students
  3. Recent Graduates
  4. Graduate Studies
  5. Seminar
  6. Journals
  7. Links


Faculty

Faculty who are actively engaged in research in areas of combinatorics at Memorial University, along with a brief description of their interests, are listed below:

  • Danny Dyer
    Graph theory
  • David A. Pike
    Graph theory and design theory, graph decompositions and cycle properties, computational graph theory
  • Rolf Rees (1960-2012)
    Click here to view Dr. Rees' obituary.
  • Nabil Shalaby
    Skolem sequences, covering and packing designs, graph labellings
  • Andrea Burgess (Adjunct professor)
    Combinatorial design theory and graph theory
  • Jared Howell  (Adjunct professor)
    Graph Theory, Combinatorial Designs and Enumeration


Graduate Students

NameProgramYears in ProgramSupervisor(s)
Robert Luther Ph.D.2016-Pike / Burgess
Naeemah AlghamdiM.Sc.2011-Shalaby
Yashar Tavakoli M.Sc.2010-Dyer
Sadegheh HaghshenasPh.D.2010-Dyer / Shalaby
Farej OmerPh.D.2009-Shalaby
Daniela Silvesan Ph.D.2007-Shalaby
Xiaoliang QiM.Sc.2007-Parmenter / Shalaby
Iren DarijaniPh.D.2016-Pike


Recent Graduates

NameProgramSupervisor(s)Thesis TitleSubsequent Status
Asiyeh SanaeiPh.D. (2012)PikeExistential closure of graphsPost-doc, Acadia University
Andrew JessoM.Sc.
(2010)
Pike / ShalabyThe Hamiltonicity of Block-Intersection Graphs of Balanced Incomplete Block DesignsM.Ed. student, Memorial University
Rebecca KeepingM.Sc. (2010)Dyer / RadfordThe Watchman's Walk Problem and its Variations 
Sueng-Byong (Light) GoM.Sc. (2009)Mata-Montero / ShalabyCombinatorics and its applications in DNA analysis 
ÅÂÂÂÂÂÂÂÂÂÂÂ┬Éznur YaÅŸar DinerPh.D. (2008)Dyer / Kondratieva / PikeAlgorithmic Complexity and Extremality Characterizations for Edge Searching and Its VariationsLecturer, Memorial University
Joshua ManzerM.Sc. (2008)Dyer / PikePerfect Triple Configurations from MatchingsPh.D. student, University of Victoria
Daniela Silvesan M.Sc. (2007)ShalabyThe spectrum of Skolem and hooked Skolem sequences with a prescribed number of pairs in common and applicationsPh.D. student, Memorial University
Colin ReidM.Sc. (2006)ShalabyExtended near-Skolem type sequences, infinite Skolem sequences, and related topicsPh.D. student, McMaster University
Yubo Zou Ph.D. (2006)PikeDecycling and dominating cubes and gridsVisiting Assistant Professor, University of South Carolina
Andrea BurgessM.Sc. (2005)PikeCycle systems: an investigation of colouring and invariantsPh.D. student, University of Ottawa
David MorganM.Sc. (2001)ShalabyGracefully labelled trees from Skolem and related sequencesPh.D. student, University of Alberta


Graduate Studies

At the graduate level, studies in combinatorics may be undertaken which lead to both the M.Sc. and Ph.D. Details of our department's graduate programs can be reviewed here.

The School of Graduate Studies has a very helpful website about Memorial University, St. John's, and all that we have to offer.

We are always seeking interested and qualified candidates for our graduate programs, in which you can apply online.


Seminar

During the Fall and Winter semesters we have a seminar that usually meets every week. Follow this link to view a list of scheduled talks.


Journals

Many of the following journals are available, either electronically or in hardcopy format at the Queen Elizabeth II Library.

Links to additional combinatorics journals can be found here.


Links

Contact

Mathematics and Statistics

230 Elizabeth Ave

St. John's, NL A1B 3X9 CANADA

Tel: (709) 864-2530

Fax: (709) 864-2552

becomestudent@mun.ca