BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.17.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LORIA
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Évènements pour LORIA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20241210T133000
DTEND;TZID=Europe/Paris:20241210T143000
DTSTAMP:20241112T084904Z
CREATED:20241112T083604Z
LAST-MODIFIED:20241112T084904Z
UID:26890-1733837400-1733841000@www.loria.fr
SUMMARY:Loria Colloquium: Jean Cardinal
DESCRIPTION:Next Loria colloquium will take place on Tuesday\, 10th December at 1:30 pm in the Amphitheater. \nWe will have the pleasure to welcome Jean Cardinal\, professor at the Université Libre de Bruxelles\, with a presentation (in English) entitled « Combinatorics\, Geometry\, and Algorithms« . \nAbstract: \nNumerous interactions exist between the fields of combinatorics\, discrete geometry — in the tradition initiated\, among others\, by Paul Erdős — and theoretical computer science. It is often fruitful to consider combinatorial abstractions to tackle computational geometry problems\, and conversely\, geometry crops up sometimes unexpectedly in a purely discrete computational context. \nWe will illustrate these interactions through an example related to our research. \nIn computational geometry\, it can be useful to encode sets of points in the plane by storing the orientation (clockwise or counterclockwise) of every triple of points. By considering the properties that these orientations must satisfy as axioms\, one can relate these encodings to tools from matroid theory. These ideas have helped to identify a specific complexity class that revealed useful for better understanding the difficulty of a number of problems in computational geometry. \nWe will strive to minimize technical content and make the presentation accessible to everyone. \nBiography: \nJean Cardinal is a professor of computer science at the Université libre de Bruxelles (ULB)\, in Brussels\, Belgium\, and co-director of the Algorithms Research Group. His research is in the field of theoretical computer science and discrete mathematics\, in particular computational geometry\, the branch of computer science devoted to the design and analysis of algorithms for problems involving geometric data. Heobtained his PhD from ULB in 2001\, with a fellowship from the FNRS\, and has held visiting professorships at various institutions since then\, the most recent ones being at ETH Zurich and Université Sorbonne Paris Nord. \nPeople from outside the laboratory must register by sending an email to Marie Baron: marie.baron (at) loria.fr before Friday\, 6th December.
URL:https://www.loria.fr/event/loria-colloquium-jean-cardinal/
LOCATION:Amphithéâtre du Loria
CATEGORIES:Colloquium Loria
END:VEVENT
END:VCALENDAR