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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e02967b3c5b
DTSTART;TZID=America/Toronto:20250509T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250509T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-luke-schaeffer
SUMMARY:Tutte colloquium-Luke Schaeffer
CLASS:PUBLIC
DESCRIPTION:TITLE:Faster linear algebra using treewidth\n\nSPEAKER:\n Luke 
 Schaeffer\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n MC 5501\
 n\nABSTRACT: \n\n: We look at the complexity of solving sparse linear syst
 ems as a\nfunction of the treewidth of the instance. That is\, the sparse 
 matrix\nis associated with a sparse graph\, and solutions can be found fas
 ter\nwhen that graph has low treewidth. We give a parameterized algorithm\
 nin system size and treewidth achieving the conjectured optimal\nperforman
 ce.\n\nThis is joint work with Daniel Grier.\n\n 
DTSTAMP:20260416T001223Z
END:VEVENT
END:VCALENDAR