Instytut Informatyki Analitycznej

Wydział Matematyki i Informatyki Uniwersytet Jagielloński

Seminaria

On constructive methods in the theory of colour-critical graphs

18.05.2023

A note on degree-constrained subgraphs

18.05.2023

The pursuit of the dynamic optimality conjecture via the geometry of binary search trees

17.05.2023

Improved lower bounds on the number of edges in list critical and online list critical graphs

11.05.2023

A not 3-choosable planar graph without 3-cycles

11.05.2023

Neighborhood complexity of planar graphs

10.05.2023

On the structure of k-connected graphs without K_k-minor

04.05.2023

Pólya's Permanent Problem

04.05.2023

Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance

27.04.2023

Edge lower bounds for list critical graphs, via discharging

27.04.2023