Instytut Informatyki Analitycznej - lista publikacji

1-9 z 9.

2026

8.
Jędrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
Centered colorings in minor-closed graph classes, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2026), 164-184
7.
Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
6.
Stijn Cambie, Ervin Győri, Nika Salia, Casey Tompkins, James Tuite
5.
Ervin Győri, Binlong Li, Nika Salia, Casey Tompkins, Kitti Varga, Manran Zhu
4.
Tara Abrishami, Marcin Briański, James Davies, Xiying Du, Jana Masaříková, Paweł Rzążewski, Bartosz Walczak
Burling graphs in graphs with large chromatic number, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2026), 3978-3998
3.
Seth Pettie, Gábor Tardos, Bartosz Walczak
On a clique game and the Erdős-Hajnal problem on high-chromatic high-girth subgraphs, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2026), 2903-2927
2.
Paweł Rzążewski, Bartosz Walczak
Polynomial-time recognition and maximum independent set in Burling graphs, International Workshop on Graph-Theoretic Concepts in Computer Science [WG] vol. 16124 of Lecture Notes in Computer Science (2026), 445-460