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:69d28d013e2b5
DTSTART;TZID=America/Toronto:20190621T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190621T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-ishan-bansal
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 79 Waterloo ON N2L 3G1 Canada
SUMMARY:Combinatorial Optimization Reading Group - Ishan Bansal
CLASS:PUBLIC
DESCRIPTION:TITLE: Maximum Cardinality Popular Matchings\n\nSpeaker:\n Ish
 an Bansal\n\nAffiliation:\n University of Waterloo\n\nRoom:\n MC 5479\n\nA
 BSTRACT:\n\nWe have seen the algorithm by Abraham\, Irving\, Kavitha\,\n
 and Mehlhorn which deals with finding popular matchings (can be\neasily m
 odified to give maximum cardinality popular matchings) in\nbipartite graph
 s with one-sided preference lists.
DTSTAMP:20260405T162537Z
END:VEVENT
END:VCALENDAR