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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d17f981a864
DTSTART;TZID=America/Toronto:20181010T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181010T133000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-complexity-graph-drawings
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar • Algorithms and Complexity — The Complexity of Graph\n
 Drawings and Representations
CLASS:PUBLIC
DESCRIPTION:ANNA LUBIW\n_David R. Cheriton School of Computer Science_\n\nI
 n this talk I will look at geometric graph representations from the\npersp
 ective of three issues: the algorithmic complexity of finding a\nrepresent
 ation\; the bit complexity of the representation\; and whether\nthere is a
  morph between any two combinatorially equivalent\nrepresentations.
DTSTAMP:20260404T211608Z
END:VEVENT
END:VCALENDAR