Katedra Podstaw Informatyki - lista publikacji
Nadjednostka:
1-16 z 16.
2021
16.
Alan Frieze, Wojciech Szpankowski, Krzysztof Turowski
The Concentration of the Maximum Degree in the Duplication-Divergence Models, International Conference on Computing and Combinatorics [COCOON], (2021), 413-424
15.
Grzegorz Gutowski, Tomasz Krawczyk, Krzysztof Maziarz, Douglas West, Xuding Zhu, Michał Zając
The Slow-Coloring Game on Sparse Graphs: k-Degenerate, Planar, and Outerplanar, Journal of Combinatorics vol. 12 (2021) (2021), 283 – 302
14.
Marek Kubale, Tytus Pikies, Krzysztof Turowski
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines, International Conference on Automated Planning and Scheduling [ICAPS], (2021), 262-270
13.
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-time algorithms for finding large induced sparse subgraphs, Algorithmica vol. 83 (2021), 2634-2650
12.
A note on the asymptotic expressiveness of ZF and ZFC, Journal of Logic and Computation vol. 31 (2021), 1598–1607
11.
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
Sparse Kneser graphs are Hamiltonian, Journal of the London Mathematical Society vol. 103 (2021), 1253-1275
10.
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
Colouring polygon visibility graphs and their generalizations, International Symposium on Computational Geometry [SoCG] vol. 189 of Leibniz International Proceedings in Informatics (LIPIcs) (2021), 29:1-29:16
9.
Improving Gebauer’s construction of 3-chromatic hypergraphs with few edges, International Colloquium on Automata Languages and Programming [ICALP] vol. Leibniz International Proceedings in Informatics (LIPIcs) (2021), 89:1-89:9
8.
Katarzyna Grygiel, Isabella Larcher
7.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
6.
5.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
4.
Robert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski
T-colorings, divisibility and circular chromatic number, Discussiones Mathematicae Graph Theory vol. 41(2) (2021), 441-450
3.
Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Approximating pathwidth for graphs of small treewidth, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2021), 1965-1976
2.
Parinya Chalermsook, Bartosz Walczak
Coloring and maximum weight independent set of rectangles, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2021), 860-868
1.
Lech Duraj, Jakub Kozik, Dmitry A. Shabanov
Random hypergraphs and property B, European Journal of Combinatorics vol. Volume 91, January 2021, 103205 (2021), 1-11