Informatyka Teoretyczna - Instytut Informatyki Analitycznej

Informatyka Teoretyczna

Piotr Micek and Bartosz Walczak

Wednesdays 14:15 - 15:45, room 0174 or zoom

This is our main seminar. We cover a wide range of topics in theoretical computer science and combinatorics. We present here our most recent results and we share this space with our collaborators, visitors, and distinguished guests.

The seminar runs in a hybrid form.

Coarse cops and robber games

19.03.2025

Ugo Giocanti, Jagiellonian University

Clique number of tournaments

12.03.2025

Pierre Aboulker, ÉNS Paris

Every graph is essential to large treewidth

26.02.2025

Nicolas Trotignon, CNRS, ÉNS Lyon

A survey of coarse graph theory

22.01.2025

Agelos Georgakopoulos, University of Warwick

Linear bounds on treewidth in terms of excluded planar minors

15.01.2025

Sang-il Oum, Institute for Basic Science

On graphs coverable by k shortest paths

18.12.2024

Maël Dumas, University of Warsaw

On Erdős-Pósa properties of tripods in directed graphs

11.12.2024

Marcin Briański, Jagiellonian University

Homogeneous substructures in ordered uniform (random) matchings

04.12.2024

Andrzej Ruciński, Adam Mickiewicz University in Poznań

Bounding ε-scatter dimension via metric sparsity

27.11.2024

Marcin Pilipczuk, University of Warsaw

Locally chordal graphs

20.11.2024

Tara Abrishami, Universität Hamburg