Worshop on Logic, Graphs, and Algorithms, 2022

›9:30 (1h)

Sebastian Siebertz: Algorithmic meta-theorems
Sebastian Siebertz

› Salle 02-022 (JPN), Bât 5, Campus St Priest

›10:30 (30min)

Coffee break

› Salle 02-022 (JPN), Bât 5, Campus St Priest

›11:00 (30min)

Colin Geniet: First-order logic and twin-width in tournaments
Colin Geniet

› Salle 02-022 (JPN), Bât 5, Campus St Priest

›11:30 (30min)

Stefan Szeider: From Twin-Width to Propositional Logic and Back
Stefan Szeider

› Salle 02-022 (JPN), Bât 5, Campus St Priest

›12:00 (30min)

Giannos Stamoulis: Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classe
Giannos Stamoulis

› Salle 02-022 (JPN), Bât 5, Campus St Priest

›12:30 (2h30)

Lunch

› Salle 02-022 (JPN), Bât 5, Campus St Priest

›15:00 (1h)

Szymon Toruńczyk: On monadically stable and monadically NIP classes of graphs
Szymon Toruńczyk

› Salle 02-022 (JPN), Bât 5, Campus St Priest

›16:00 (30min)

Coffee break

› Salle 02-022 (JPN), Bât 5, Campus St Priest

›16:30 (30min)

Zdeněk Dvořák: Approximation meta-algorithms for FO properties
Zdeněk Dvořák

› Salle 02-022 (JPN), Bât 5, Campus St Priest

›17:00 (30min)

Peter Rossmanith: Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond
Peter Rossmanith

› Salle 02-022 (JPN), Bât 5, Campus St Priest

›17:30 (1h)

Open problems session