Instytut Informatyki Analitycznej - lista publikacji
Nadjednostka:
Podjednostki:
1-9 z 9.
2026
9.
Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
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
Cliquewidth and dimension, Proceedings of the London Mathematical Society vol. 132 (2026), e70116
6.
Stijn Cambie, Ervin Győri, Nika Salia, Casey Tompkins, James Tuite
The maximum Wiener index of a uniform hypergraph, Discrete Mathematics vol. 349 (2026), 114797
5.
Ervin Győri, Binlong Li, Nika Salia, Casey Tompkins, Kitti Varga, Manran Zhu
On graphs without cycles of length 0 modulo 4, Journal of Combinatorial Theory. Series B vol. 176 (2026), 7-29
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
1.
Sławomir Rams, Alexander Degtyarev
Counting lines with Vinberg's algorithm, Revista Matematica Iberoamericana (2026), 50 stron
