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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6b00d38e2ef13
DTSTART;TZID=America/Toronto:20261123T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261123T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-hadas-barabash-finding-full-immersions
SUMMARY:Graphs and Matroids | Hadas Barabash\, Finding full immersions is\n
 fixed-parameter tractable in labeled tour graphs
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Hadas Barabash\n\nAFFILIATION:\n Georgia Tech\n\nROO
 M:\n MC 6029\n\nABSTRACT: We give an $O_{\\mathcal{H}}(n^5)$-time algorit
 hm to test\nwhether an $n$-vertex labeled tour graph has a full immersion\
 nisomorphic to a labeled tour graph $\\mathcal{H}$. A \\emph{labeled tour\
 ngraph} is a connected $4$-regular graph whose edges are labeled by\nbinar
 y vectors of fixed length. To obtain a \\emph{full immersion}\, a\nvertex 
 may be removed only by pairing up its four incident edges and\n``splitting
  off'' both pairs\, summing the labels within each pair.\nEven for one-bit
  labels\, no polynomial-time algorithm was previously\nknown for arbitrary
  fixed $\\mathcal{H}$. Our results have implications\nfor \\emph{vertex-mi
 nors}\, whose study is motivated by applications in\nquantum networking.
DTSTAMP:20261120T231110Z
END:VEVENT
END:VCALENDAR