Kolorowanie grafów reprezentowanych geometrycznie

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

Tytuł: Kolorowanie grafów reprezentowanych geometrycznie

Kierownik: Jarosław Grytczuk

Rozpoczęcie: 2011-02-14

Zakończenie: 2014-09-28

Uwagi: PMN -Projekt międzynarodowy niewspółfinansowany


Uczestnicy

UczestnikRolaEdycja
Tomasz Krawczyk Wykonawca
Piotr Micek Wykonawca
Bartosz Walczak Wykonawca
Arkadiusz Pawlik Wykonawca
Adam Gągol Wykonawca
Mateusz Michałek Wykonawca
Publikacje
Kolja Knauer, Piotr Micek, Bartosz Walczak, Outerplanar graph drawings with few slopes vol. 7434 of Lecture Notes in Computer Science (2012), "Computing and Combinatorics, 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings", Springer
Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak, Extending partial representations of function graphs and permutation graphs vol. 7501 of Lecture Notes in Computer Science (2012), "Algorithms – ESA 2012, 20th Annual European Symposium on Algorithms, Ljubljana, Slovenia, September 10-12, 2012, Proceedings", Springer
Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, William T. Trotter, Bartosz Walczak, Triangle-free geometric intersection graphs with large chromatic number, DISCRETE COMPUT GEOM vol. 50 (2013), 714-726
Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak, Coloring intersection graphs of arcwise connected sets in the plane vol. 16 of CRM Series (2013), "The Seventh European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2013", Springer
Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak, Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors vol. 8165 of Lecture Notes in Computer Science (2013), "Graph-Theoretic Concepts in Computer Science, 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers", Springer
Andrew Suk, Bartosz Walczak, New bounds on the maximum number of edges in k-quasi-planar graphs vol. 8242 of Lecture Notes in Computer Science (2013), "Graph Drawing, 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers", Springer
Kolja Knauer, Piotr Micek, Bartosz Walczak, Outerplanar graph drawings with few slopes, COMP GEOM-THEOR APPL vol. 47 (2014), 614-624
Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, William T. Trotter, Bartosz Walczak, Triangle-free intersection graphs of line segments with large chromatic number, J COMB THEORY B vol. 105 (2014), 6-10
Alexandre Rok, Bartosz Walczak, Outerstring graphs are χ-bounded, (2014), "30th Annual Symposium on Computational Geometry, SoCG 2014, June 8-11, 2014, Kyoto, Japan", Association for Computing Machinery (ACM)
Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak, Coloring intersection graphs of arc-connected sets in the plane, DISCRETE COMPUT GEOM vol. 52 (2014), 399-415
Andrew Suk, Bartosz Walczak, New bounds on the maximum number of edges in k-quasi-planar graphs, COMP GEOM-THEOR APPL vol. 50 (2015), 24-33
Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak, Coloring triangle-free rectangle overlap graphs with O(log log n) colors, DISCRETE COMPUT GEOM vol. 53 (2015), 199-220
Bartosz Walczak, Triangle-free geometric intersection graphs with no large independent sets, DISCRETE COMPUT GEOM vol. 53 (2015), 221-225
János Pach, Bartosz Walczak, Decomposition of multiple packings with subquadratic union complexity, COMB PROBAB COMPUT vol. 25 (2016), 145-153