Seminars are given every Friday from 2:00 to 3:00 (usually in room 178, but not for the time being). You are welcome 10 minutes earlier for tea, coffee and cake.

In order to receive the announcements, just send an email to with subject "subscribe labri.go-gt Cookie Monster", where Cookie is your first name and Monster your last name.

See the agenda of the seminars:; to add it to yours , or flash the following QRCode:

Next talks:

The talks are now also available online :

Vendredi 24 juin ŗ 14h - NathanaŽl Fijalkow
Universal graphs for playing games

I will introduce the notion of universal graphs for playing games: they are similar in spirit to the usual notion, but parameterised by an additional condition, such as (for weighted graphs) "all cycles have non negative total weights". I will briefly show what are their applications (algorithms for model checking games), and then focus on the combinatorial questions: understanding the size of minimal universal graphs.

This talk will survey a number of more or less recent results jointly obtained with Thomas Colcombet, Pierre Ohlmann, and Paweł Gawrychowski.



GT Graphs and Optimization


 Previous Years

edit SideBar

Blix theme adapted by David Gilbert, powered by PmWiki