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:68d1821d918f9
DTSTART;TZID=America/Toronto:20250509T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250509T163000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-luke-schaeffer
SUMMARY:Tutte colloquium-Luke Schaeffer
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE:Faster linear algebra using treewidth\n\nSPEA
 KER:\n Luke Schaeffer\n\nAFFILIATION:\n University of À¶Ý®ÊÓƵ\n\nLOCATION
 :\n MC 5501\n\nABSTRACT: \n\n: We look at the complexity of solving sparse
  linear systems 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 faster\nwhen that graph has low treewidth. We give a parameterize
 d algorithm\nin system size and treewidth achieving the conjectured optima
 l\nperformance.\n\nThis is joint work with Daniel Grier.\n\n \n 
DTSTAMP:20250922T170637Z
END:VEVENT
END:VCALENDAR