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.
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.
Please note: This PhD seminar will be given online.
Nathan King, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Christopher Batty