Katedra Podstaw Informatyki - lista publikacji
Nadjednostka:
1-10 z 10.
2026
10.
Changlong Wu, Jin Sima, Wojciech Szpankowski
Certifying Capabilities from Finite Tests: When Is It Possible?, International Conference on Machine Learning [ICML], (2026),
9.
Michael Drmota, Philippe Jacquet, Changlong Wu, Wojciech Szpankowski
Phase Transition of Regret for Logistic Regression with Large Weights, Algorithmic Learning Theory [ALT], (2026),
8.
Stijn Cambie, Ervin Győri, Nika Salia, Casey Tompkins, James Tuite
The maximum Wiener index of a uniform hypergraph, Discrete Mathematics vol. 349 (2026),
7.
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
6.
Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Cliquewidth and dimension, Proceedings of the London Mathematical Society vol. 132 (2026), e70116
5.
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
4.
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
3.
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
2.
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
1.
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