BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: We describe some recent developments in treewidth-based algori
 thms for knots\, which exploit the structure of the underlying 4-valent pla
 nar graph. In particular\, we show how these led to the first general sub-e
 xponential-time algorithm for the HOMFLY-PT polynomial\, and we describe so
 me recent progress on parameterised algorithms for unknot recognition. 
DTSTAMP:20181113T132100
DTSTART:20180702T141500
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9 
 \n 14195 Berlin \n Room 005 (ground floor)
SEQUENCE:0
SUMMARY:Benjamin Burton (University of Queensland\, Australia): From parame
 terised to non-parameterised algorithms in knot theory
UID:89792466@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20180702-L-Bur
 ton.html
END:VEVENT
END:VCALENDAR