BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:2b9f387c-9325-403b-99bd-d00e55f3b435
X-WR-CALNAME:[gt.go] - 'A tight local algorithm for the minimum dominating 
 set problem in > outerplanar graphs' and 'Limiting crossing numbers' by Al
 exandra Wesole
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20230326T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20201025T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20211031T030000
RDATE:20221030T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20210328T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20220327T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:2b9f387c-9325-403b-99bd-d00e55f3b435
DTSTAMP:20260414T231855Z
CLASS:PUBLIC
DESCRIPTION:/Exposé en anglais/Talk in english/\n\n*A tight local algorithm
  for the minimum dominating set problem in outerplanar graphs*\n\nWe prese
 nt a deterministic local algorithm which computes a 5-approximation of a m
 inimum dominating set on outerplanar graphs\, and show that this is optima
 l.  Our algorithm only requires knowledge of the degree of a vertex and of
  its neighbors\, so that large messages and unique identifiers are not nee
 ded. This is joint work with Marthe Bonamy\, Linda Cook and Carla Groenlan
 d.\n\n\n\n*Limiting crossing numbers*\n\nIn this talk we will explain a se
 t up which shows that the theory of graph limits introduced by Lovász et a
 l. can be applied to intersection graphs of graph drawings. We consider a 
 model of random\, geodesic drawings of the complete bipartite graph Kn\,n 
 on the unit sphere and show that the intersection graphs form a convergent
  series (for n going to infinity). This talk is based on joint work with M
 arthe Bonamy and Bojan Mohar.\n\n\n[Alexandra Wesole] (Simon Fraser Univer
 sity\, Vancouver)\n\nhttp://www.sfu.ca/~agwesole/\n\n\n{Remarques/Remarks}
 \n\n▼\nCet exposé sera enregistré\, merci de désactiver votre webcam et mi
 cro si vous ne souhaitez pas apparaître sur l'enregistrement. Les échanges
  informels avant et après l'exposé\, ainsi  que les questions\, ne seront 
 pas enregistrés.\n\nN'hésitez pas à venir un peu avant le début de l'expos
 é pour faire des tests (et discuter informellement). Nous auront également
  des discussions informelles post-GT.\n\nÀ très bientôt\, \n\nMarthe & Jon
 athan\n\nRetrouvez toutes les informations du GT dématérialisé sur https:/
 /combalgo.labri.fr/pmwiki.php/Groupe/GT-en-LIGNE\n\n\n▼\nThis presentation
  will be recorded\, please deactivate your webcam and microphone if you do
  not wish to appear on the recording. Informal exchanges before and after 
 the presentation\, as well as questions\, will not be recorded.\n\nDo not 
 hesitate to come a little before the start of the presentation to test (an
 d chat informally). We will also have informal post-working group discussi
 ons.\n\nSee you soon\,\n\nMarthe & Jonathan\n\nFind all the information of
  the dematerialized working group on the web page https://combalgo.labri.f
 r/pmwiki.php/Groupe/GT-en-LIGNE
DTSTART;TZID=Europe/Paris:20210903T140000
DTEND;TZID=Europe/Paris:20210903T150000
LOCATION:A30/178 et sur https://webconf.u-bordeaux.fr/b/mar-ef4-zed
SEQUENCE:0
SUMMARY:[gt.go] - 'A tight local algorithm for the minimum dominating set p
 roblem in > outerplanar graphs' and 'Limiting crossing numbers' by Alexand
 ra Wesole
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
