Seminars
GALaC organizes or participates in three different regular seminars.
GALaC team seminar
The GALaC team seminar is organized on a regular basis on Friday at 14:00 in the PCRI building (650) at LISN. Recent and up-coming seminars
Plateau Saclay Combinatorics Seminar
The Plateau Saclay Combinatorics Seminar is held on several Mondays at 11am in room Philippe Flajolet (top floor on the left) at LIX. It is co-organized by the Combi team of LIX and the GALaC team. The mailing list for this seminar is combi_lix_lri@services.cnrs.fr. Subscribe to this ...
Plateau Saclay Algorithms Seminar
The Plateau Saclay Algorithms Seminar is held every other Friday afternoon in LIX. This working group is partially supported by Labex DigiCosme (Digital worlds: distributed data, programs and architectures). If you do wish (or not) to receive any emails from this seminar, you can subscribe or unsubscribe from the mailing ...
Canadian Traveller Problems in Temporal Graphs.
summary: We focus on the Canadian Traveller Problem, where a traveller aims to travel on a network from s to t with the minimum cost, considering that a maximum of k edges can be blocked. These edges remain hidden from the traveller until they visit one of their endpoints. We ...
Algèbres tridendriformes, arbres de Schröder et algèbre de Hopf
Les concepts d’algèbres dendriformes, respectivement tridendriformes décrivent l’action de certains éléments du groupe symétrique appelés les battages et respectivement les battages contractants sur l’ensemble des mots dont les lettres sont des éléments d’un alphabet, respectivement d'un monoïde. Un lien entre les algèbres dendriformes et tridendriformes ...
TBA
summary: TBA
Current trends in Optimal Stopping Problems and Machine Learning
summary: Stochastic optimal stopping problems have a wide range of applications, from finance and economics to neuroscience,
robotics, and energy management. Many real-world applications involve complex models that have driven the development of
sophisticated numerical methods.
Recently, computational methods based on machine learning methods have been developed for solving such ...
Transversals in a collection of graphs with degree conditions
summary: Let G={G_1, G_2, ... , G_m} be a collection of n-vertex graphs on the same vertex set V (a graph system), and F be a simple graph with e(F) ≤ m. If there is an injection f: E(F) → [m] such that e &isinv E(G_{f(e)}) for each ...
Compact local certification of MSO properties for several tree-like parameters
summary: Local certification is interested in assigning labels (called certificates) to the vertices of a graph, in order to certify a certain property about said graph, or the correctness of a data-structure distributed on the graph. For the verification to be local, a vertex may only "see" its neighbourhood. A ...
Translations: fr