Welcome to Combinatorics and Optimization

Winter 2020 Undergraduate Research Assistantship (URA) Opportunities.

Spring 2020 Undergraduate Research Assistantship Program (URA). ***ON-LINE APPICATIONS OPEN November 1, 2019.***

Tutte's Distinguished Lecture Series 

The very successful Tutte's 100th Distinguished Lecture Series has now completed. That success has led to a Tutte Distinguished Lecture once per term. The next lecture will happen in the Spring term.

*Recordings of occurred talks are all available on C&O's YouTube Channel   

Grad Studies: Fall 2020 applications now open

 New Deadline: February 1, '20

  1. Nov. 14, 2019Faculty of Mathematics Research Chair
    Levent Tuncel

    C&O Professor Levent Tuncel has been awarded a five-year Faculty of Mathematics Research Chair. The award recognizes Levent's exceptional scholarly achievements and pre-eminence in the field of optimization.

  2. Nov. 7, 2019"Protocols for Authentication and Key Establishment" is published by Springer
    Stebila book

    The book, written by Colin Boyd, Anish Mathuria and C&O Professor Douglas Stebila, is the most comprehensive and integrated treatment of the protocols required for authentication and key establishment.

  3. Oct. 25, 2019Samuel Jaques and Andre Linhares win the 2019 Alumni Gold Medals

    The Office of Alumni Affairs recognizes top graduating students for academic achievement by awarding medals to one master's student and one doctoral student at Fall convocation.

Read all news
  1. Dec. 5, 2019CompMath & CO Joint Seminar - Andreas Griewank

    Title: How can we optimize nonsmooth objectives globally?

    Speaker: Andreas Griewank
    Affiliation: Humboldt University, Germany
    Room: MC 5501


    In machine learning objective functions that are only piecewise smooth and should be globally minimized abound. The standard method of dealing with them is to apply a stochastic gradient method disregarding the rare points of nonsmoothness and hoping for the best as far as global optimality of the computed solution is concerned.

  2. Dec. 5, 2019Algebraic Combinatorics Seminar - Krystal Guo

    Title: Inverses of Trees

    Speaker: Krystal Guo
    Affiliation: Centre de Recherches Mathématiques & Université de Montréal
    Room: MC 5417


    A tree is invertible if and only if it has a perfect matching.

    Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix has entries in {0, ±1} and is the signed adjacency matrix of a graph which contains T.

  3. Dec. 6, 2019Tutte Colloquium - Koray Karabina

    Title: Biometric security: Design, implementation, and challenges

    Speaker: Koray Karabina
    Affiliation: Florida Atlantic University
    Room: MC 5501


    Biometric based cybersecurity technologies offer significant advantages in authentication, identification, and access control mechanisms.

All upcoming events