Recherche
(Uniquement en présentiel / Only offline, no online version) A geometric graph G is a graph drawn in the Euclidean plane such that its vertices are
/Exposé en anglais/Talk in english/ We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd distance from
Michael Raskin (LaBRI) Title: Giant Components in Random Temporal Graphs Abstract: A temporal graph is a graph whose edges appear only at certain
Sébastien Bouchard Title: Universal Exploration Sequences and Undirected s-t Connectivity (continued) Abstract: Undirected s-t connectivity (USTCON)
**Enumerating Regular Languages in Bounded Delay** We study the task, for a given language L, of enumerating the (generally infinite) sequence of its