Kolorowanie geometrycznych grafów przecięć i problemy pokrewne

Instytucja Finansująca / Przyznający: Narodowe Centrum Nauki

Tytuł: Kolorowanie geometrycznych grafów przecięć i problemy pokrewne

Kierownik: Bartosz Walczak

Rozpoczęcie: 2016-01-28

Zakończenie: 2019-09-27

Uwagi: Sonata 9


Uczestnicy

UczestnikRolaEdycja
Tomasz Krawczyk Wykonawca
Publikacje
Alexandre Rok, Bartosz Walczak, Coloring curves that cross a fixed curve vol. 77 of Leibniz International Proceedings in Informatics (2017), "33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak, Sparse Kneser graphs are Hamiltonian, (2018), "Proceedings of 50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC’18)", Association for Computing Machinery (ACM)
Mikkel Abrahamsen, Bartosz Walczak, Common tangents of two disjoint polygons in linear time and constant workspace, ACM Transactions on Algorithms vol. 15 (2018), 12:1-21
Alexandre Rok, Bartosz Walczak, Coloring curves that cross a fixed curve, Discrete and Computational Geometry vol. 61 (2019), 830-851
Bartosz Walczak, Coloring triangle-free L-graphs with O(log log n) colors, Acta Mathematica Universitatis Comenianae vol. 88 (2019), 1063-1069
Alexandre Rok, Bartosz Walczak, Outerstring graphs are χ-bounded, SIAM Journal on Discrete Mathematics vol. 33 (2019), 2181-2199
Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood, Planar graphs have bounded nonrepetitive chromatic number, Advances in Combinatorics vol. 2020 (2020), 5:1-11
Parinya Chalermsook, Bartosz Walczak, Coloring and maximum weight independent set of rectangles, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2021), 860-868
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
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak, Sparse Kneser graphs are Hamiltonian, Journal of the London Mathematical Society vol. 103 (2021), 1253-1275
Vida Dujmović, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood, Clustered 3-colouring graphs of bounded degree, Combinatorics Probability and Computing vol. 31 (2022), 123-135
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak, Coloring polygon visibility graphs and their generalizations, Journal of Combinatorial Theory. Series B vol. 161 (2023), 268-300
Mikkel Abrahamsen, Bartosz Walczak, Distinguishing classes of intersection graphs of homothets or similarities of two convex disks, International Symposium on Computational Geometry [SoCG] vol. 258 of Leibniz International Proceedings in Informatics (LIPIcs) (2023), 2:1-2:16
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak, Grounded L-graphs are polynomially χ-bounded, Discrete and Computational Geometry vol. 70 (2023), 1523-1550
Bartosz Walczak, Coloring triangle-free L-graphs with O(log log n) colors, European Journal of Combinatorics vol. 117 (2024), 103831