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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e02a7d932bd
DTSTART;TZID=America/Toronto:20220301T110000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220301T110000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-louis-esperet
SUMMARY:Graphs and Matroids Seminar - Louis Esperet
CLASS:PUBLIC
DESCRIPTION:TITLE: Packing and covering balls in planar graphs\n\nSpeaker:
 \n Louis Esperet\n\nAffiliation:\n G-SCOP Laboratory\n\nZoom:\n Join via 
 http://matroidunion.org/?page_id=2477 or please\nemail Shayla Redlin\n\nA
 BSTRACT:\n\nThe set of all vertices at distance at most r from a vertex v 
 in a\ngraph G is called an r-ball. We prove that the minimum number of\nve
 rtices hitting all r-balls in a planar graph G is at most a constant\n(ind
 ependent of r) times the maximum number of vertex-disjoint r-balls\nin G.
DTSTAMP:20260416T001701Z
END:VEVENT
END:VCALENDAR