BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d138e517532
DTSTART;TZID=America/Toronto:20210812T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210812T130000
URL:https://uwaterloo.ca/computer-science/events/masters-thesis-presentatio
 n-algorithms-and-complexity-the-complexity-of-finding-dense-subgraphs-in-g
 raphs-with-large-cliques
LOCATION:200 University Avenue West Online master’s thesis presentation W
 aterloo ON N2L 3G1 Canada
SUMMARY:Master’s Thesis Presentation • Algorithms and Complexity • Th
 e\nComplexity of Finding Dense Subgraphs in Graphs with Large Cliques
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS MASTER’S THESIS PRESENTATION WILL BE GIVEN
 \nONLINE.\n\nCAMERON SETH\, MASTER’S CANDIDATE\n_David R. Cheriton Scho
 ol of Computer Scienc_e\n\nSUPERVISOR: Professor Eric Blais\n\nThe GapDens
 est-k-Subgraph(d) problem (GapDkS(d)) is defined as\nfollows: given a grap
 h G and parameters k\,d\, distinguish between the\ncase that G contains a 
 k-clique\, and the case that every k-subgraph of\nG has density at most d.
DTSTAMP:20260404T161429Z
END:VEVENT
END:VCALENDAR