Seminars - Instytut Informatyki Analitycznej

Seminaria

Decision problems in information theory

13.03.2025

Sebastian Spyrzewski

Clique number of tournaments

12.03.2025

Pierre Aboulker, ÉNS Paris

Cops, robbers, and vertex covers

06.03.2025

Jędrzej Hodor

The 1/3 - 2/3 conjecture

27.02.2025

Bartłomiej Bosek

Every graph is essential to large treewidth

26.02.2025

Nicolas Trotignon, CNRS, ÉNS Lyon

3-colorability of 4-regular hamiltonian graphs

23.01.2025

Roman Gicala

A survey of coarse graph theory

22.01.2025

Agelos Georgakopoulos, University of Warwick

Cleaning Regular Graphs with Brushes

16.01.2025

Jakub Sordyl

Mapping Matchings to Minimum Vertex Covers: Kőnig’s Theorem Revisited

16.01.2025

Artur Salawa

Linear bounds on treewidth in terms of excluded planar minors

15.01.2025

Sang-il Oum, Institute for Basic Science