I agree that this site is using cookies. You can find further informations here.
X
Walczak, Bartosz
247  results:
Search for persons X
?
1

Coloring triangle-free L-graphs with O(loglogn) colors:

Walczak, Bartosz
European Journal of Combinatorics.  117 (2024)  - p. 103831 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Separating Polynomial $$\chi $$-Boundedness from $$\chi $$-..:

Briański, Marcin ; Davies, James ; Walczak, Bartosz
Combinatorica.  44 (2023)  1 - p. 1-8 , 2023
Link: https://doi.org/10.1007/..
 
?
3

Grounded L-Graphs Are Polynomially $$\chi $$-Bounded:

Davies, James ; Krawczyk, Tomasz ; McCarty, Rose.
Discrete & Computational Geometry.  70 (2023)  4 - p. 1523-1550 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Coloring polygon visibility graphs and their generalization:

Davies, James ; Krawczyk, Tomasz ; McCarty, Rose.
Journal of Combinatorial Theory, Series B.  161 (2023)  - p. 268-300 , 2023
Link: https://doi.org/10.1016/..
 
?
5

Approximating Pathwidth for Graphs of Small Treewidth:

Groenland, Carla ; Joret, Gwenaël ; Nadara, Wojciech.
ACM Transactions on Algorithms.  19 (2023)  2 - p. 1-19 , 2023
Link: https://doi.org/10.1145/..
 
?
6

Tight Bound on Treedepth in Terms of Pathwidth and Longest ..:

Hatzel, Meike ; Joret, Gwenaël ; Micek, Piotr...
Combinatorica.  44 (2023)  2 - p. 417-427 , 2023
Link: https://doi.org/10.1007/..
 
?
7

Degeneracy of P-free and C⩾-free graphs with no large compl..:

Bonamy, Marthe ; Bousquet, Nicolas ; Pilipczuk, Michał...
Journal of Combinatorial Theory, Series B.  152 (2022)  - p. 353-378 , 2022
Link: https://doi.org/10.1016/..
 
?
8

Approximating pathwidth for graphs of small treewidth:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Groenland, Carla ; Joret, Gwenaël ; Nadara, Wojciech. - p. 1965-1976 , 2021
Link: https://dl.acm.org/doi/1..
 
?
9

Coloring and Maximum Weight Independent Set of Rectangles:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Chalermsook, Parinya ; Walczak, Bartosz - p. 860-868 , 2021
Link: https://doi.org/10.1137/..
 
?
10

Clustered 3-colouring graphs of bounded degree:

Dujmović, Vida ; Esperet, Louis ; Morin, Pat..
Combinatorics, Probability and Computing.  31 (2021)  1 - p. 123-135 , 2021
Link: https://doi.org/10.1017/..
 
?
11

Coloring and maximum weight independent set of rectangles:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Chalermsook, Parinya ; Walczak, Bartosz - p. 860-868 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

Approximating Pathwidth for Graphs of Small Treewidth:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Groenland, Carla ; Joret, Gwenaël ; Nadara, Wojciech. - p. 1965-1976 , 2021
Link: https://doi.org/10.1137/..
 
?
13

Sparse Kneser graphs are Hamiltonian:

Mütze, Torsten ; Nummenpalo, Jerri ; Walczak, Bartosz
Journal of the London Mathematical Society.  103 (2020)  4 - p. 1253-1275 , 2020
Link: https://doi.org/10.1112/..
 
?
14

Subexponential-Time Algorithms for Finding Large Induced Sp..:

Novotná, Jana ; Okrasa, Karolina ; Pilipczuk, Michał...
Algorithmica.  83 (2020)  8 - p. 2634-2650 , 2020
Link: https://doi.org/10.1007/..
 
?
15

Outerstring Graphs are $\chi$-Bounded:

Rok, Alexandre ; Walczak, Bartosz
SIAM Journal on Discrete Mathematics.  33 (2019)  4 - p. 2181-2199 , 2019
Link: https://doi.org/10.1137/..
 
1-15