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:683a4336e517a
DTSTART;TZID=America/Toronto:20190621T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190621T130000
URL:/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-ishan-bansal
SUMMARY:Combinatorial Optimization Reading Group - Ishan Bansal
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Maximum Cardinality Popular Matchings\n\nSp
 eaker:\n Ishan Bansal\n\nAffiliation:\n University of À¶Ý®ÊÓƵ\n\nRoom:\n 
 MC 5479\n\nABSTRACT:\n\nWe have seen the algorithm by Abraham\, Irving\,
  Kavitha\,\nand Mehlhorn which deals with finding popular matchings (can
  be\neasily modified to give maximum cardinality popular matchings) in\nbi
 partite graphs with one-sided preference lists.\n 
DTSTAMP:20250530T234558Z
END:VEVENT
END:VCALENDAR