BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:425c2527-b5e1-4b47-8946-6aba1095f52b
X-WR-CALNAME:[LX+RATIO] Colin Geniet (IBS\, Korea)
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20271031T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20251026T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20261025T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20250330T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20260329T020000
RDATE:20270328T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:425c2527-b5e1-4b47-8946-6aba1095f52b
DTSTAMP:20260511T234435Z
CLASS:PUBLIC
DESCRIPTION:Title: Simon's Factorisation in graph theory\n\nAbstract: This 
 talk aims to give an overview of the applications of automata\ntheory to g
 raphs of small tree-width or clique-width\, and particularly\nthe use of S
 imon's Factorisation Forests Theorem.\n\nA first part will focus on MSO de
 finable decompositions\, which were the\nfirst application of Simon's theo
 rem in graph theory\, by Bojańczyk and\nPilipczuk. I will explain the cont
 ext of this problem\, the grand lines\nof their proof\, some recent varian
 ts of their result\, and remaining open\nquestions.\n\nI will conclude wit
 h a few more graph theoretic problems for which\nSimon's theorem proves eq
 ually useful\, such as finding proper\ncolourings\, and minimal obstructio
 ns to some structures.\n\n\nImport automatique depuis https://framagenda.o
 rg/remote.php/dav/public-calendars/D3yqF7nwys9amfyY?export par sync_icals_
 to_drupal.py pour M2F
DTSTART;TZID=Europe/Paris:20260224T140000
DTEND;TZID=Europe/Paris:20260224T150000
LOCATION:178
SEQUENCE:0
SUMMARY:[LX+RATIO] Colin Geniet (IBS\, Korea)
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
