Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak, Sparse Kneser graphs are Hamiltonian, Journal of the London Mathematical Society 103 (2021), 1253-1275
Parinya Chalermsook, Bartosz Walczak, Coloring and maximum weight independent set of rectangles, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2021), 860-868
Bartosz Walczak, Minors and dimension, Journal of Combinatorial Theory. Series B 122 (2017), 668-689
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak, Triangle-free intersection graphs of line segments with large chromatic number, Journal of Combinatorial Theory. Series B 105 (2014), 6-10

Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak, Cliquewidth and dimension, Proceedings of the London Mathematical Society 132 (2026), e70116
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
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
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] 16124 of Lecture Notes in Computer Science (2026), 445-460
Tara Abrishami, Marcin Briański, Jadwiga Czyżewska, Rose McCarty, Martin Milanič, Paweł Rzążewski, Bartosz Walczak, Excluding a clique or a biclique in graphs of bounded induced matching treewidth, SIAM Journal on Discrete Mathematics 39 (2025), 1189-1200

teoria grafów, algorytmika, geometria dyskretna

Bartosz Walczak

stopień/tytuł doktor habilitowany stanowisko

badawczo-dydaktyczne, profesor uczelni

jednostka

kontakt

bartosz.walczak@uj.edu.pl

Wydział Matematyki i Informatyki