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:69e06ada77f9c
DTSTART;TZID=America/Toronto:20181019T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181019T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-matthias-mnich
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Tutte Colloquium - Matthias Mnich
CLASS:PUBLIC
DESCRIPTION:TITLE: New algorithms for maximum disjoint paths based on\ntre
 e-likeness\n\nSpeaker:\n Matthias Mnich\n\nAffiliation:\n University of Bo
 nn\n\nRoom:\n MC 5501\n\nABSTRACT:\n\nWe study the classical NP-hard probl
 ems of finding maximum-size\nsubsets from given sets of k terminal pairs t
 hat can be routed via\nedge-disjoint paths (MaxEDP) or node-disjoint paths
  (MaxNDP) in a\ngiven graph.
DTSTAMP:20260416T045138Z
END:VEVENT
END:VCALENDAR