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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:683a526267943
DTSTART;TZID=America/Toronto:20190712T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190712T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-kanstantsin-pashkovich-0
SUMMARY:Tutte Colloquium - Kanstantsin Pashkovich
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: On the approximability of the stable matchi
 ng problem with\nties of size two and one-sided ties\n\nSpeaker:\n Kanstan
 tsin Pashkovich\n\nAffiliation:\n University of Ottawa\n\nRoom:\n MC 5501\
 n\nABSTRACT:\n\nThe stable matching problem is central for game theory. If
 \nparticipants are allowed to have ties\, the problem of finding a stable\
 nmatching of maximum cardinality is an NP-hard problem\, even when the\nti
 es are of size two.\n 
DTSTAMP:20250531T005042Z
END:VEVENT
END:VCALENDAR