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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:683a64f8b81f9
DTSTART;TZID=America/Toronto:20220914T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220914T143000
URL:/computer-science/events/masters-thesis-presentatio
 n-algorithms-complexity-connectivity-properties-of-flip-graph-after-forbid
 ding-triangulation-edges
SUMMARY:Master’s Thesis Presentation • Algorithms and Complexity •\nC
 onnectivity Properties of the Flip Graph After Forbidding\nTriangulation E
 dges
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS MASTER’S THESIS PRESENTATION WI
 LL TAKE PLACE\nONLINE.\n\nREZA BIGDELI\, MASTER’S CANDIDATE\n_David R. C
 heriton School of Computer Science_\n\nSUPERVISOR: Professor Anna Lubiw\n\
 nThe flip graph for a set $P$ of points in the plane has a vertex for\neve
 ry triangulation of $P$\, and an edge when two triangulations differ\nby o
 ne flip that replaces one triangulation edge by another.\n\nThe flip graph
  is known to have some connectivity properties:\n 
DTSTAMP:20250531T021000Z
END:VEVENT
END:VCALENDAR