Current students

Please note: This PhD seminar will be given online.

Mustafa Abualsaud, PhD candidate
David R. Cheriton of Computer Science

Supervisor: Professor Mark Smucker

Please note: This master’s thesis presentation will be given online.

Seung Gyu Hyun, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Éric Schost

Please note: This PhD seminar will be given online.

Josh Jung, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Jesse Hoey

Please note: This PhD seminar will be given online.

Matthew Lakier, PhD candidate
David R. Cheriton School of Computer Science

Please note: This PhD defence will be given online.

Vijay Menon, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Kate Larson

Please note: This PhD seminar will be given online.

Nathan King, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Christopher Batty

Please note: This PhD defence will be given online.

Xinan Yan, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Bernard Wong

Please note: This PhD seminar will be given online.

Jay Henderson, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Edward Lank

Please note: This PhD seminar will be given online.

Alireza Heidarikhazaei, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ihab Ilyas

Please note: This master’s thesis presentation will be given online.

Cameron Seth, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Eric Blais

The GapDensest-k-Subgraph(d) problem (GapDkS(d)) is defined as follows: given a graph G and parameters k,d, distinguish between the case that G contains a k-clique, and the case that every k-subgraph of G has density at most d.