Theoretical computer science Seminar - 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.

Finding irrelevant vertices in linear time on bounded-genus graphs

13.11.2024

Giannos Stamoulis, University of Warsaw

Excluding a Burling graph

06.11.2024

Bartosz Walczak, Jagiellonian University

Triangulations of outer k-planar graphs

30.10.2024

Grzegorz Gutowski, Jagiellonian University

Kempe recoloring of sparse graphs

23.10.2024

Clément Legrand-Duchesne, Jagiellonian University

Weak coloring numbers of minor-closed graph classes

16.10.2024

Jędrzej Hodor, Jagiellonian University

Random thoughts on Borodin-Kostochka conjecture

09.10.2024

Zdeněk Dvořák, Charles University

Polynomial bounds for the Graph Minor Structure Theorem

02.10.2024

Michał Seweryn, Charles University

Induced C4-free subgraphs with high average degree

12.06.2024

António Girão, University of Oxford

Anticomplete subgraphs of large treewidth

05.06.2024

Maria Chudnovsky, Princeton University

Eliminating crossings in ordered graphs

29.05.2024

Alexander Wolff, Universität Würzburg