dr hab. Bartosz Walczak
Jednostki:
- Wydział Matematyki i Informatyki UJ
- Instytut Informatyki Analitycznej
- Katedra Podstaw Informatyki
Doktorat Otwarcie: 2010-12-16, Zamknięcie: 2012-12-20
Habilitacja Otwarcie: 2017-03-30, Zamknięcie: 2017-12-21
Publikacje:
58.
Sándor Kisfaludi-Bak, Jana Masaříková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Węgrzycki
Separator theorem and algorithms for planar hyperbolic graphs, International Symposium on Computational Geometry [SoCG] vol. 293 of Leibniz International Proceedings in Informatics (LIPIcs) (2024), 67:1-67:17
57.
Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
Tight bound on treedepth in terms of pathwidth and longest path, Combinatorica vol. 44 (2024), 417-427
56.
Coloring triangle-free L-graphs with O(log log n) colors, European Journal of Combinatorics vol. 117 (2024), 103831
55.
Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Cliquewidth and dimension, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1437-1446
54.
Marcin Briański, James Davies, Bartosz Walczak
Separating polynomial χ-boundedness from χ-boundedness, Combinatorica vol. 44 (2024), 1-8
53.
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
Grounded L-graphs are polynomially χ-bounded, Discrete and Computational Geometry vol. 70 (2023), 1523-1550
52.
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
51.
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
50.
Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Approximating pathwidth for graphs of small treewidth, ACM Transactions on Algorithms vol. 19 (2023), 16:1-19
49.
James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak
A solution to Ringel's circle problem, International Symposium on Computational Geometry [SoCG] vol. 224 of Leibniz International Proceedings in Informatics (LIPIcs) (2022), 33:1-33:14
48.
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
47.
Marthe Bonamy, Nicolas Bousquet, Michał Pilipczuk, Paweł Rzążewski, Stéphan Thomassé, Bartosz Walczak
46.
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
45.
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
Sparse Kneser graphs are Hamiltonian, Journal of the London Mathematical Society vol. 103 (2021), 1253-1275
44.
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
43.
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
42.
Parinya Chalermsook, Bartosz Walczak
Coloring and maximum weight independent set of rectangles, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2021), 860-868
41.
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
40.
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-time algorithms for finding large induced sparse subgraphs vol. 148 of Leibniz International Proceedings in Informatics (2019), "14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
39.
Alexandre Rok, Bartosz Walczak
Outerstring graphs are χ-bounded, SIAM Journal on Discrete Mathematics vol. 33 (2019), 2181-2199
38.
Coloring triangle-free L-graphs with O(log log n) colors, Acta Mathematica Universitatis Comenianae vol. 88 (2019), 1063-1069
37.
Alexandre Rok, Bartosz Walczak
Coloring curves that cross a fixed curve, Discrete and Computational Geometry vol. 61 (2019), 830-851
36.
David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang
35.
Mikkel Abrahamsen, Bartosz Walczak
34.
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)
33.
William T. Trotter, Bartosz Walczak, Ruidong Wang
Dimension and cut vertices: an application of Ramsey theory, (2018), "Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham", Cambridge University Press
32.
William T. Trotter, Bartosz Walczak
Boolean dimension and local dimension vol. 61 of Electronic Notes in Discrete Mathematics (2017), "The Ninth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2017", Elsevier Science
31.
Tomasz Krawczyk, Bartosz Walczak
On-line approach to off-line coloring problems on graphs with geometric representations, Combinatorica vol. 37 (2017), 1139-1179
30.
Tomasz Krawczyk, Bartosz Walczak
Extending partial representations of trapezoid graphs vol. 10520 of Lecture Notes in Computer Science (2017), "Graph-Theoretic Concepts in Computer Science, 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers", Springer
29.
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
28.
27.
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer index of convexity and its variants, Discrete and Computational Geometry vol. 57 (2017), 179-214
26.
Minors and dimension, Journal of Combinatorial Theory. Series B vol. 122 (2017), 668-689
25.
Mikkel Abrahamsen, Bartosz Walczak
Outer common tangents and nesting of convex hulls in linear time and constant workspace vol. 57 of Leibniz International Proceedings in Informatics (2016), "24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
24.
Kolja Knauer, Bartosz Walczak
Graph drawings with one bend and few slopes vol. 9644 of Lecture Notes in Computer Science (2016), "LATIN 2016: Theoretical Informatics, 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings", Springer
23.
János Pach, Bartosz Walczak
22.
Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
Tree-width and dimension, Combinatorica vol. 36 (2016), 431-450
21.
Tomasz Krawczyk, Bartosz Walczak
Asymmetric coloring games on incomparability graphs vol. 49 of Electronic Notes in Discrete Mathematics (2015), "The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015", Elsevier Science
20.
Andrew Suk, Bartosz Walczak
19.
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer index of convexity and its variants vol. 34 of Leibniz International Proceedings in Informatics (2015), "31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
18.
Minors and dimension, (2015), "26th Annual ACM-SIAM Symposium on Discrete Algorithms, January 4-6, 2015, San Diego, California, USA", Society for Industrial and Applied Mathematics (SIAM)
17.
16.
Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
15.
14.
An extremal problem on crossing vectors, Journal of Combinatorial Theory - Series A vol. 128 (2014), 41-55
13.
Tomasz Krawczyk, Bartosz Walczak
Coloring relatives of interval overlap graphs via on-line games vol. 8572 of Lecture Notes in Computer Science (2014), "Automata, Languages, and Programming, 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I", Springer
12.
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)
11.
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
10.
Kolja Knauer, Piotr Micek, Bartosz Walczak
Outerplanar graph drawings with few slopes, Computational Geometry: Theory and Applications vol. 47 (2014), 614-624
9.
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
8.
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
7.
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
6.
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
5.
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
4.
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
3.
Parity in graph sharing games, Discrete Mathematics vol. 312 (2012), 1788-1795
2.
A graph-grabbing game, Combinatorics Probability and Computing vol. 20 (2011), 623-629
1.
A simple representation of subwords of the Fibonacci word, Information Processing Letters vol. 110 (2010), 956-960
Konferencje:
39.
New Perspectives in Colouring and Structure, Banff International Research Station, On-line, -, 2020-03-16 - 2020-03-19
38.
Parameterized Algorithms Retreat, Uniwersytet Warszawski, Krynica-Zdrój, Polska, 2020-02-24 - 2020-02-28
37.
27th International Symposium on Graph Drawing and Network Visualization, Charles University, Průhonice, Czechy, 2019-09-17 - 2019-09-20
36.
10th European Conference on Combinatorics, Graph Theory and Applications, Comenius University, Bratysława, Słowacja, 2019-08-26 - 2019-08-30
35.
Structural Graph Theory Workshop, Uniwersytet Warszawski, Gułtowy, Polska, 2019-06-24 - 2019-06-28
34.
Barbados Graph Theory Workshop, Bellairs Research Institute, Holetown, Barbados, 2019-04-05 - 2019-04-12
33.
Parameterized Algorithms Retreat, Uniwersytet Warszawski, Karpacz, Polska, 2019-02-25 - 2019-03-01
32.
7th Polish Combinatorial Conference, UAM, Będlewo, Polska, 2018-09-24 - 2018-09-28
31.
Order and Geometry Workshop 2018, Technische Universität Berlin, Ciążeń, Polska, 2018-09-18 - 2018-09-22
30.
FOC Fall School: Order and Geometry, Technische Universität Berlin, Rietz-Neuendorf, Niemcy, 2018-09-14 - 2018-09-17
29.
ICALP 2018 Workshop: Constrained Recognition Problems, Charles University, Praga, Czechy, 2018-07-09 - 2018-07-09
28.
Building Bridges II. Conference to celebrate 70th birthday of László Lovász, János Bolyai Mathematical Society, Eötvös Loránd University, Alfréd Rényi Institute of Mathematics, Budapeszt, Węgry, 2018-07-02 - 2018-07-06
27.
Workshop on Structural Sparsity, Logic and Algorithms, University of Warwick, Coventry, Wielka Brytania, 2018-06-18 - 2018-06-21
26.
34th International Symposium on Computational Geometry, Alfred Rényi Institute of Mathematics, Budapeszt, Węgry, 2018-06-11 - 2018-06-14
25.
Extremal Problems in Combinatorial Geometry, Banff International Research Station, Banff, Kanada, 2018-02-04 - 2018-02-09
24.
9th European Conference on Combinatorics, Graph Theory and Applications, Technische Universität Wien, Wiedeń, Austria, 2017-08-28 - 2017-09-01
23.
33rd International Symposium on Computational Geometry (SoCG 2017), University of Queensland, Brisbane, Australia, 2017-07-04 - 2017-07-07
22.
43rd International Workshop on Graph-Theoretic Concepts in Computer Science, TU Eindhoven, Heeze, Holandia, 2017-06-21 - 2017-06-23
21.
Highlights of Algorithms 2017, Technische Universität Berlin, Berlin, Niemcy, 2017-06-09 - 2017-06-11
20.
33rd European Workshop on Computational Geometry, Malmö University, Malmö, Szwecja, 2017-04-05 - 2017-04-07
19.
Algorithms, Logic and Structure, University of Warwick, Coventry, Wielka Brytania, 2016-12-12 - 2016-12-14
18.
6th Polish Combinatorial Conference, UAM, Będlewo, Polska, 2016-09-19 - 2016-09-23
17.
Order and Geometry Workshop 2016, Technische Universität Berlin, Gułtowy, Polska, 2016-09-14 - 2016-09-17
16.
São Paulo School of Advanced Science on Algorithms, Combinatorics and Optimization, University of São Paulo, São Paulo, Brazylia, 2016-07-18 - 2016-07-29
15.
32nd International Symposium on Computational Geometry, Tufts University, Boston, Stany Zjednoczone, 2016-06-14 - 2016-06-18
14.
Highlights of Algorithms 2016, Université Paris Diderot, Paryż, Francja, 2016-06-06 - 2016-06-08
13.
Combinatorics: Challenges and Applications, Tel Aviv University, Tel Aviv, Izrael, 2016-01-17 - 2016-01-21
12.
Homonolo, Charles University, Nová Louka, Czechy, 2015-12-07 - 2015-12-11
11.
EMS-LMS Mathematical Weekend, University of Birmingham, Birmingham, Wielka Brytania, 2015-09-18 - 2015-09-20
10.
8th European Conference on Combinatorics, Graph Theory and Applications, University of Bergen, Bergen, Norwegia, 2015-08-31 - 2015-09-04
9.
25th British Combinatorial Conference, University of Warwick, Coventry, Wielka Brytania, 2015-07-06 - 2015-07-10
8.
31st International Symposium on Computational Geometry, TU Eindhoven, Eindhoven, Holandia, 2015-06-22 - 2015-06-25
7.
47th Annual ACM Symposium on the Theory of Computing, ACM, Portland, Stany Zjednoczone, 2015-06-15 - 2015-06-17
6.
26th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, San Diego, Stany Zjednoczone, 2015-01-04 - 2015-01-06
5.
5th Polish Combinatorial Conference, UAM, Będlewo, Polska, 2014-09-22 - 2014-09-26
4.
Sum(m)it:240, Alfred Rényi Institute of Mathematics, Budapeszt, Węgry, 2014-07-07 - 2014-07-11
3.
SIAM Conference on Discrete Mathematics (DM14), SIAM, Minneapolis, Stany Zjednoczone, 2014-06-16 - 2014-06-19
2.
30th Annual Symposium on Computational Geometry, Tohoku University, Kioto, Japonia, 2014-06-08 - 2014-06-11
1.
EuroGIGA Final Conference, Freie Universität Berlin, Berlin, Niemcy, 2014-02-17 - 2014-02-21
Konferencje organizowane:
2.
Forum Informatyki Teoretycznej, Kraków, 2018-05-11, 2018-05-12
1.
Forum Informatyki Teoretycznej, Kraków, 2019-09-06, 2019-09-07
Granty (realizowane po maju 2009 roku)
Nagrody
Rok | Rodzaj | Rodzaj uhonorowanej działalności | Typ | |
---|---|---|---|---|
2016 | nagroda | wybitny dorobek naukowy lub artystyczny | krajowa | Szczegóły |