Obserwuj
Bartosz Walczak
Tytuł
Cytowane przez
Cytowane przez
Rok
Triangle-free intersection graphs of line segments with large chromatic number
A Pawlik, J Kozik, T Krawczyk, M Lasoń, P Micek, WT Trotter, B Walczak
Journal of Combinatorial Theory, Series B 105, 6-10, 2014
1182014
Planar graphs have bounded nonrepetitive chromatic number
V Dujmović, L Esperet, G Joret, B Walczak, DR Wood
arXiv preprint arXiv:1904.05269, 2019
542019
New bounds on the maximum number of edges in k-quasi-planar graphs
A Suk, B Walczak
Computational Geometry 50, 24-33, 2015
542015
Extending partial representations of function graphs and permutation graphs
P Klavík, J Kratochvíl, T Krawczyk, B Walczak
European Symposium on Algorithms, 671-682, 2012
472012
Outerstring graphs are χ-bounded
A Rok, B Walczak
SIAM Journal on Discrete Mathematics 33 (4), 2181-2199, 2019
45*2019
Coloring and maximum weight independent set of rectangles
P Chalermsook, B Walczak
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
442021
Tree-width and dimension
G Joret, P Micek, KG Milans, WT Trotter, B Walczak, R Wang
Combinatorica 36 (4), 431-450, 2016
442016
Triangle-free geometric intersection graphs with large chromatic number
A Pawlik, J Kozik, T Krawczyk, M Lasoń, P Micek, WT Trotter, B Walczak
Discrete & Computational Geometry 50 (3), 714-726, 2013
442013
A graph-grabbing game
P Micek, B Walczak
Combinatorics, Probability and Computing 20 (4), 623-629, 2011
412011
Sparse Kneser graphs are Hamiltonian
T Mütze, J Nummenpalo, B Walczak
Journal of the London Mathematical Society 103 (4), 1253-1275, 2021
372021
Clustered 3-Colouring Graphs of Bounded Degree
V Dujmović, L Esperet, P Morin, B Walczak, DR Wood
arXiv preprint arXiv:2002.11721, 2020
342020
Separating Polynomial -Boundedness from -Boundedness
M Briański, J Davies, B Walczak
Combinatorica 44 (1), 1-8, 2024
332024
Outerplanar graph drawings with few slopes
K Knauer, P Micek, B Walczak
Computational Geometry 47 (5), 614-624, 2014
312014
Minors and dimension
B Walczak
Journal of Combinatorial Theory, Series B 122, 668-689, 2017
272017
Approximating pathwidth for graphs of small treewidth
C Groenland, G Joret, W Nadara, B Walczak
ACM Transactions on Algorithms 19 (2), 1-19, 2023
252023
Coloring triangle-free rectangle overlap graphs with O(log log n) colors
T Krawczyk, A Pawlik, B Walczak
Discrete & Computational Geometry 53 (1), 199-220, 2015
23*2015
Degeneracy of P_t-free and C_(⩾t)-free graphs with no large complete bipartite subgraphs
M Bonamy, N Bousquet, M Pilipczuk, P Rzążewski, S Thomassé, ...
Journal of Combinatorial Theory, Series B 152, 353-378, 2022
202022
On-line approach to off-line coloring problems on graphs with geometric representations
T Krawczyk, B Walczak
Combinatorica 37 (6), 1139-1179, 2017
20*2017
Parity in graph sharing games
P Micek, B Walczak
Discrete Mathematics 312 (10), 1788-1795, 2012
202012
Coloring curves that cross a fixed curve
A Rok, B Walczak
Discrete & Computational Geometry 61 (4), 830-851, 2019
192019
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20