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:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d95bbf3b105
DTSTART;TZID=America/Toronto:20190121T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190121T130000
URL:https://uwaterloo.ca/computer-science/events/masters-thesis-presentatio
 n-algorithms-and-complexity-bounds
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 2314 Waterloo ON N2L 3G1 Canada
SUMMARY:Master’s Thesis Presentation • Algorithms and Complexity —\nB
 ounds on Maximum Matchings in 1-Planar Graphs
CLASS:PUBLIC
DESCRIPTION:JOHN WITTNEBEL\, MASTER’S CANDIDATE\n_David R. Cheriton Schoo
 l of Computer Science_\n\nIn this thesis\, we study lower bounds on maximu
 m matchings in 1-planar\ngraphs. We expand upon the tools used for proofs 
 of matching bounds in\nother classes of graphs as well as some original id
 eas in order to\nfind these bounds. The first novel results we provide are
  lower bounds\nof maximum matching in 1-planar graphs as a function of the
 ir minimum\ndegree.
DTSTAMP:20260410T202119Z
END:VEVENT
END:VCALENDAR