BEGIN:VCALENDAR
PRODID:-//Columba Systems Ltd//NONSGML CPNG/SpringViewer/ICal Output/3.3-
 M3//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20230502T083607Z
DTSTART:20230503T100000Z
DTEND:20230503T110000Z
SUMMARY:Logic semina: Kristina Vuskovic (Leeds) *Unusual time*
UID:{http://www.columbasystems.com/customers/uom/gpp/eventid/}m1fm-lh60ly
 1x-efulkj
DESCRIPTION:Title:  Structure and algorithms\n\nAbstract: In this talk we
  survey structural characterizations of different hereditary graph class
 es (i.e. classes closed under deletion of vertices)\, focusing on their 
 algorithmic consequences. Robertson and Seymour\, in their famous Graph 
 Minors Project\, elucidated the structure of graph classes that are clos
 ed under vertex deletion\, and deletion and contraction of edges (i.e. m
 inor-closed). Their structural characterization had far reaching algorit
 hmic consequences. Hereditary graph classes on the other hand are a lot 
 more complex\, and a whole new set of tools is needed to understand them
  structurally and to try to extract efficient algorithms from their stru
 cture.
STATUS:TENTATIVE
TRANSP:TRANSPARENT
CLASS:PUBLIC
LOCATION:Frank Adams 1 (and zoom\, link in email)\, Alan Turing Building\
 , Manchester
END:VEVENT
END:VCALENDAR