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:6833302cb2eb7
DTSTART;TZID=America/Toronto:20220810T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220810T140000
URL:/computer-science/events/phd-seminar-algorithms-and
 -complexity-dispersion-on-intervals-a-geometric-approach
SUMMARY:PhD Seminar • Algorithms and Complexity • Dispersion on Interva
 ls:\nA Geometric Approach
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS PHD SEMINAR WILL TAKE PLACE ONLIN
 E.\n\nANURAG MURTY NAREDLA\, PHD CANDIDATE\n_David R. Cheriton School of C
 omputer Science_\n\nSUPERVISOR: Professor Anna Lubiw\n\nIn the dispersion 
 problem for ordered intervals\, the input is an\nordered list of intervals
  on the real line\, and the task is to select\none point from each interva
 l\, such that the ordering of points along\nthe line respects the given or
 dering of intervals and such that the\npoints are “far apart” from eac
 h other.\n 
DTSTAMP:20250525T145852Z
END:VEVENT
END:VCALENDAR