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:69d912164fbc7
DTSTART;TZID=America/Toronto:20180725T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180725T133000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-drawing-planar-graphs-few
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar • Algorithms and Complexity — Drawing Planar Graphs wit
 h\nFew Geometric Primitives: Algorithms and Evaluation
CLASS:PUBLIC
DESCRIPTION:PHILIPP KINDERMANN\, POSTDOCTORAL FELLOW\n_David R. Cheriton Sc
 hool of Computer Science_\n\nThe visual complexity of a graph drawing is d
 efined as the number of\ngeometric objects needed to represent all its edg
 es. In particular\,\none object may represent multiple edges\, e.g.\, one 
 needs only one line\nsegment to draw two collinear incident edges. 
DTSTAMP:20260410T150702Z
END:VEVENT
END:VCALENDAR