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 every other Monday afternoon at 3PM 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 Subscribe to ...

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 ...

Algorithms for the Metric Dimension problem on directed graphs

-- Antoine Dailly (LIMOS, Clermont-Ferrand)

summary: In graph theory, the Metric Dimension problem is the following: we are looking for a minimum-size set R of vertices, such that for any pair of vertices of the graph, there is a vertex from R whose two distances to the vertices of the pair are distinct. This problem ...

Algorithmes de partitionnement par comparaison de paires

-- Élie de Panafieu (Nokia Bell Labs) (LIX)

On cherche à reconstruire une partition d'un ensemble donné en envoyant des paires d'éléments à un oracle qui nous indique s'ils appartiennent à la même partie de la partition. Nous cherchons les algorithmes qui retrouvent la partition en un minimum de questions à l'oracle. Ce problème ...

Complexity of positional games

-- Valentin Gledel (Umeå Universitet)

summary: Positional games are two-player games played on a hypergraph. The players alternate selecting vertices of the hypergraph, and the winning conditions depend solely on the filling of the hyperedges. Tic-tac-toe is a famous example of a positional game, with the rows, columns, and diagonals forming the hyperedges and the ...

Language-theoretic methods in semigroup theory

-- Carl-Fredrik Nyberg Brodda (Université Gustave Eiffel) (LIX)

Language-theoretic methods in combinatorial group theory go back to the fundamental work by Anisimov in the 1970s. Since then, the area has exploded, including such deep theorems as the Muller-Schupp theorem: a group has context-free word problem if and only if it is virtually free. In this talk, I will ...

The Domino Snake Problem

-- Nicolás Bitar (LISN, Galac)

summary: Deep within the swamp of undecidability lies the elusive domino snake. This species, first discovered in the 1970s by Myers, was originally introduced as an a priori simpler problem than the now celebrated Domino Problem. In this talk we will take a tour through what is known about this ...

See all

Translations: fr