Scholar
Bartosz Walczak
Google Scholar ID: lbz75scAAAAJ
Jagiellonian University in Kraków
Citations & Impact
Citations
682
H-index
15
i10-index
22
Publications
20
Co-authors
44
list available
Contact
No contact links provided.
Publications
Resume (English only)
Academic Achievements
- On a clique game and the Erdős-Hajnal problem on high-chromatic high-girth subgraphs (SODA 2026)
- Burling graphs in graphs with large chromatic number (SODA 2026)
- Polynomial-time recognition and maximum independent set in Burling graphs (WG 2025, Best Paper Award)
- Excluding a clique or a biclique in graphs of bounded induced matching treewidth (SIAM Journal on Discrete Mathematics 2025)
- A solution to Ringel's circle problem (Journal of the European Mathematical Society, in press; SoCG 2022)
- Separator theorem and algorithms for planar hyperbolic graphs (SoCG 2024)
- Tight bound on treedepth in terms of pathwidth and longest path (Combinatorica 2024)
- Separating polynomial χ-boundedness from χ-boundedness (Combinatorica 2024)
- Coloring triangle-free L-graphs with O(log log n) colors (European Journal of Combinatorics 2024)
- Cliquewidth and dimension (SODA 2024)
- Grounded L-graphs are polynomially χ-bounded (Discrete and Computational Geometry 2023)
- Distinguishing classes of intersection graphs of homothets or similarities of two convex disks (SoCG 2023)
- Coloring polygon visibility graphs and their generalizations (Journal of Combinatorial Theory, Series B 2023; SoCG 2021)
- Approximating pathwidth for graphs of small treewidth (ACM Transactions on Algorithms 2023; SODA 2021)
Research Experience
- Works at the Institute of Analytic Informatics, Jagiellonian University, Kraków, Poland.
Background
- Research interests include graph theory, algorithms, and discrete geometry.
