A simple representation of subwords of the Fibonacci word. - Bartosz Walczak (Inf. Process. Lett., 2010)

A Graph-Grabbing Game. - Piotr Micek; Bartosz Walczak (Comb. Probab. Comput., 2011)

Extending Partial Representations of Function Graphs and Permutation Graphs. - Pavel Klavík; Jan Kratochvíl; Tomasz Krawczyk; Bartosz Walczak (ESA, 2012)

Parity in graph sharing games. - Piotr Micek; Bartosz Walczak (Discret. Math., 2012)

Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors. - Tomasz Krawczyk; Arkadiusz Pawlik; Bartosz Walczak (WG, 2013)

Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors - Tomasz Krawczyk; Arkadiusz Pawlik; Bartosz Walczak (CoRR, 2013)

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. - Arkadiusz Pawlik; Jakub Kozik; Tomasz Krawczyk; Michal Lason; Piotr Micek; William T. Trotter; Bartosz Walczak (Discret. Comput. Geom., 2013)

Coloring Relatives of Interval Overlap Graphs via On-line Games. - Tomasz Krawczyk; Bartosz Walczak (ICALP (1), 2014)

Outerplanar graph drawings with few slopes. - Kolja B. Knauer; Piotr Micek; Bartosz Walczak (Comput. Geom., 2014)

Triangle-free geometric intersection graphs with no big independent sets. - Bartosz Walczak (CoRR, 2014)

Coloring Intersection Graphs of Arc-Connected Sets in the Plane. - Michal Lason; Piotr Micek; Arkadiusz Pawlik; Bartosz Walczak (Discret. Comput. Geom., 2014)

An extremal problem on crossing vectors. - Michal Lason; Piotr Micek; Noah Streib; William T. Trotter; Bartosz Walczak (J. Comb. Theory A, 2014)

Triangle-free intersection graphs of line segments with large chromatic number. - Arkadiusz Pawlik; Jakub Kozik; Tomasz Krawczyk; Michal Lason; Piotr Micek; William T. Trotter; Bartosz Walczak (J. Comb. Theory B, 2014)

New bounds on the maximum number of edges in k-quasi-planar graphs. - Andrew Suk; Bartosz Walczak (Comput. Geom., 2015)

Coloring curves intersecting a fixed line. - Alexandre Rok; Bartosz Walczak (CoRR, 2015)

Dimension and cut vertices: an application of Ramsey theory. - William T. Trotter; Bartosz Walczak; Ruidong Wang (CoRR, 2015)

Coloring Triangle-Free Rectangle Overlap Graphs with $$O( log log n)$$ O ( log log n ) Colors. - Tomasz Krawczyk; Arkadiusz Pawlik; Bartosz Walczak (Discret. Comput. Geom., 2015)

Triangle-Free Geometric Intersection Graphs with No Large Independent Sets. - Bartosz Walczak (Discret. Comput. Geom., 2015)

Asymmetric Coloring Games on Incomparability Graphs. - Tomasz Krawczyk; Bartosz Walczak (Electron. Notes Discret. Math., 2015)

Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace. - Mikkel Abrahamsen; Bartosz Walczak (ESA, 2016)

Graph Drawings with One Bend and Few Slopes. - Kolja Knauer; Bartosz Walczak (LATIN, 2016)

Tree-width and dimension. - Gwenaël Joret; Piotr Micek; Kevin G. Milans; William T. Trotter; Bartosz Walczak; Ruidong Wang (Comb., 2016)

Outer common tangents and nesting of convex hulls of two disjoint simple polygons in linear time and constant workspace. - Mikkel Abrahamsen; Bartosz Walczak (CoRR, 2016)

Decomposition of Multiple Packings with Subquadratic Union Complexity. - János Pach; Bartosz Walczak (Comb. Probab. Comput., 2016)

Extending Partial Representations of Trapezoid Graphs. - Tomasz Krawczyk; Bartosz Walczak (WG, 2017)

On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations. - Tomasz Krawczyk; Bartosz Walczak (Comb., 2017)

On the Beer Index of Convexity and Its Variants. - Martin Balko; Vít Jelínek; Pavel Valtr 001; Bartosz Walczak (Discret. Comput. Geom., 2017)

Boolean Dimension and Local Dimension. - William T. Trotter; Bartosz Walczak (Electron. Notes Discret. Math., 2017)

Minors and dimension. - Bartosz Walczak (J. Comb. Theory B, 2017)

Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision. - Adam Gagol; Piotr Micek; Bartosz Walczak (J. Graph Theory, 2017)

Sparse Kneser graphs are Hamiltonian. - Torsten Mütze; Jerri Nummenpalo; Bartosz Walczak (STOC, 2018)

Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane. - Torsten Mütze; Bartosz Walczak; Veit Wiechert (CoRR, 2018)

Planar graphs have bounded nonrepetitive chromatic number. - Vida Dujmovic; Louis Esperet; Gwenaël Joret; Bartosz Walczak; David R. Wood (CoRR, 2019)

Coloring Curves that Cross a Fixed Curve. - Alexandre Rok; Bartosz Walczak (Discret. Comput. Geom., 2019)

Dimension of posets with planar cover graphs excluding two long incomparable chains. - David M. Howard 002; Noah Streib; William T. Trotter; Bartosz Walczak; Ruidong Wang (J. Comb. Theory A, 2019)

Outerstring Graphs are χ-Bounded. - Alexandre Rok; Bartosz Walczak (SIAM J. Discret. Math., 2019)

Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace. - Mikkel Abrahamsen; Bartosz Walczak (ACM Trans. Algorithms, 2019)

Coloring triangle-free L-graphs with O(log log n) colors. - Bartosz Walczak (CoRR, 2020)

Colouring Polygon Visibility Graphs and Their Generalizations. - James Davies; Tomasz Krawczyk; Rose McCarty; Bartosz Walczak (SoCG, 2021)

Coloring and Maximum Weight Independent Set of Rectangles. - Parinya Chalermsook; Bartosz Walczak (SODA, 2021)

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. - Jana Novotná 001; Karolina Okrasa; Michal Pilipczuk; Pawel Rzazewski; Erik Jan van Leeuwen; Bartosz Walczak (Algorithmica, 2021)

A Solution to Ringel's Circle Problem. - James Davies; Chaya Keller; Linda Kleist; Shakhar Smorodinsky; Bartosz Walczak (SoCG, 2022)

Clustered 3-colouring graphs of bounded degree. - Vida Dujmovic; Louis Esperet; Pat Morin; Bartosz Walczak; David R. Wood (Comb. Probab. Comput., 2022)

Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs. - Marthe Bonamy; Nicolas Bousquet 001; Michal Pilipczuk; Pawel Rzazewski; Stéphan Thomassé; Bartosz Walczak (J. Comb. Theory B, 2022)

Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks. - Mikkel Abrahamsen; Bartosz Walczak (SoCG, 2023)

Approximating Pathwidth for Graphs of Small Treewidth. - Carla Groenland; Gwenaël Joret; Wojciech Nadara; Bartosz Walczak (ACM Trans. Algorithms, 2023)

Coloring polygon visibility graphs and their generalizations. - James Davies; Tomasz Krawczyk; Rose McCarty; Bartosz Walczak (J. Comb. Theory B, 2023)

Grounded L-Graphs Are Polynomially χ-Bounded. - James Davies; Tomasz Krawczyk; Rose McCarty; Bartosz Walczak (Discret. Comput. Geom., 2023)

Separator Theorem and Algorithms for Planar Hyperbolic Graphs. - Sándor Kisfaludi-Bak; Jana Masaríková; Erik Jan van Leeuwen; Bartosz Walczak; Karol Wegrzycki (SoCG, 2024)

Cliquewidth and Dimension. - Gwenaël Joret; Piotr Micek; Michal Pilipczuk; Bartosz Walczak (SODA, 2024)

Separating Polynomial χ-Boundedness from χ-Boundedness. - Marcin Brianski; James Davies; Bartosz Walczak (Comb., 2024)

Polynomial-time recognition and maximum independent set in Burling graphs. - Pawel Rzazewski; Bartosz Walczak (CoRR, 2024)

Coloring triangle-free L-graphs with O(loglogn) colors. - Bartosz Walczak (Eur. J. Comb., 2024)

Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. - Meike Hatzel; Gwenaël Joret; Piotr Micek; Marcin Pilipczuk; Torsten Ueckerdt; Bartosz Walczak (Comb., 2024)

Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth. - Tara Abrishami; Marcin Brianski; Jadwiga Czyzewska; Rose McCarty; Martin Milanic; Pawel Rzazewski; Bartosz Walczak (SIAM J. Discret. Math., 2025)

A simple layered-wheel-like construction. - Maria Chudnovsky; David Fischer; Sepehr Hajebi; Sophie Spirkl; Bartosz Walczak (CoRR, 2025)