Instytut Informatyki Analitycznej

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

Seminaria

A simple counting argument applied to graph colorings

29.11.2023

An O(n√n) algorithm to color proper circular arcs

23.11.2023

Any 7-chromatic graph has a K7 or K4,4 as a minor

23.11.2023

Monochromatic configurations on the circle

22.11.2023

Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm

16.11.2023

On Two problems of Defective Choosability of Graphs

16.11.2023

Tight bound for the Erdős-Pósa property of tree minors

15.11.2023

Graph Homomorphisms: From Structure to Algorithms

09.11.2023

When surrounding is not catching in Cops and Robber

08.11.2023

Circle graphs and monadic second-order logic

26.10.2023