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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e03df707655
DTSTART;TZID=America/Toronto:20221125T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221125T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-stefan-weltge
SUMMARY:Tutte Colloquium - Stefan Weltge
CLASS:PUBLIC
DESCRIPTION:TITLE: Integer programs with bounded subdeterminants and two no
 nzeros\nper row\n\nSpeaker:\n Stefan Weltge\n\nAffiliation:\n Technical Un
 iversity of Munich\n\nLocation:\n MC 5501 or contact Eva Lee for Zoom lin
 k\n\nABSTRACT: Determining the complexity of integer linear programs with\
 ninteger coefficient matrices whose subdeterminants are bounded by a\ncons
 tant is currently a very actively discussed question in the field.\nIn thi
 s talk\, I will present a strongly polynomial-time algorithm for\nsuch int
 eger programs with the further requirement that every\nconstraint contains
  at most two variables. The core of our approach is\nthe first polynomial-
 time algorithm for the weighted stable set\nproblem on graphs that do not 
 contain more than k vertex-disjoint odd\ncycles\, where k is any constant.
  Previously\, polynomial-time\nalgorithms were only known for k = 0 (bipar
 tite graphs) and for k = 1.\n\nThis is joint work with Samuel Fiorini\, Gw
 enaël Joret\, and Yelena\nYuditsky\, which recently appeared at FOCS this
  year.
DTSTAMP:20260416T014007Z
END:VEVENT
END:VCALENDAR