Instytut Informatyki Analitycznej

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

Seminaria

The chromatic number of Kneser graphs

25.04.2019

How 'hard' a video game can be?

25.04.2019

On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree (M. Equi et al.)

24.04.2019

Algorithms for posets and graphs games – coloring and matching

24.04.2019

A simpler implementation and analysis of Chazelle’s Soft Heaps (H. Kaplan, U. Zwick)

17.04.2019

Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables by Iovka Boneva, Joachim Niehren, and Momar Sakho

17.04.2019

Turán’s graph theorem

11.04.2019

Gaming is a hard job, but someone has to do it!

11.04.2019

Testing isomorphism of circular-arc graphs - Hsu's approach revisited

10.04.2019

What Percentage of Programs Halt? by Laurent Laurent Bienvenu, Damien Desfontaines and Alexander Shen

10.04.2019