BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20241105T100000
DTEND;TZID=Europe/Paris:20241105T110000
DTSTAMP:20260503T035250
CREATED:20241003T131153Z
LAST-MODIFIED:20241018T134335Z
UID:11664-1730800800-1730804400@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Planar or almost planar graphs: topology to the rescue of algorithms »\, Arnaud de Mesmay (LIGM\, Univ. Paris-Est)
DESCRIPTION:Many graphs encountered in practice have a particular structure. For example\, road networks have few or no intersections when drawn in a plane. We will see how this type of property interacts with the combinatorics of graphs\, and often leads to the development of algorithms that are more efficient than in the general case. This will be an introductory talk focused on giving general principles and a toolbox for algorithm design on embedded graphs.
URL:https://www.greyc.fr/event/seminaire-algorithmique-planar-or-almost-planar-graphs-topology-to-the-rescue-of-algorithms-arnaud-de-mesmay-ligm-univ-paris-est/
LOCATION:Sciences 3- S3 351
CATEGORIES:General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR