BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: Abstract:   In this talk\, I will present a subexponential par
 ameterized algorithm for finding  k  vertex-disjoint paths of minimal total
  length between given terminal pairs in a planar graph parameterized by the
  number of edges in the solution. The algorithm generalizes to different se
 ttings such as edge-weighted graphs and/or directed graphs. We complement o
 ur algorithm by an almost matching ETH-based lower bound.   This is joint w
 ork with Petr Golovach and Fedor Fomin. 
DTSTAMP:20241211T105300
DTSTART:20241213T141500
CLASS:PUBLIC
LOCATION:Takustraße 9\, Seminarrraum 049
SEQUENCE:0
SUMMARY:Matthias Bentert: Planar min-sum disjoint paths in subexponential F
 PT time
UID:147227218@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/inf/dates/kolloquium/2024-12-13-Bentert.htm
 l
END:VEVENT
END:VCALENDAR