Instytut Informatyki Analitycznej

数学与计算机系 uj-lift-theme.uniwersytet-jagiellonski

Seminaria

Coarse cops and robber games

19.03.2025

Decision problems in information theory

13.03.2025

Clique number of tournaments

12.03.2025

Cops, robbers, and vertex covers

06.03.2025

The 1/3 - 2/3 conjecture

27.02.2025

Every graph is essential to large treewidth

26.02.2025

3-colorability of 4-regular hamiltonian graphs

23.01.2025

A survey of coarse graph theory

22.01.2025

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

16.01.2025

Cleaning Regular Graphs with Brushes

16.01.2025