| 2026 | SODA | Burling Graphs in Graphs with Large Chromatic Number. | Tara Abrishami, Marcin Brianski, James Davies, Xiying Du, Jana Masarkov, Pawel Rzazewski, Bartosz Walczak |
| 2026 | SODA | On a Clique Game and the Erdős-Hajnal Problem on High-Chromatic High-Girth Subgraphs. | Seth Pettie, Gbor Tardos, Bartosz Walczak |
| 2025 | WG | Polynomial-Time Recognition and Maximum Independent Set in Burling Graphs. | Pawel Rzazewski, Bartosz Walczak |
| 2024 | SODA | Cliquewidth and Dimension. | Gwenal Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak |
| 2021 | SODA | Coloring and Maximum Weight Independent Set of Rectangles. | Parinya Chalermsook, Bartosz Walczak |
| 2021 | SODA | Approximating Pathwidth for Graphs of Small Treewidth. | Carla Groenland, Gwenal Joret, Wojciech Nadara, Bartosz Walczak |
| 2018 | STOC | Sparse Kneser graphs are Hamiltonian. | Torsten Mtze, Jerri Nummenpalo, Bartosz Walczak |
| 2017 | WG | Extending Partial Representations of Trapezoid Graphs. | Tomasz Krawczyk, Bartosz Walczak |
| 2016 | ESA | Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace. | Mikkel Abrahamsen, Bartosz Walczak |
| 2016 | LATIN | Graph Drawings with One Bend and Few Slopes. | Kolja Knauer, Bartosz Walczak |
| 2015 | SODA | Minors and Dimension. | Bartosz Walczak |
| 2014 | ICALP | Coloring Relatives of Interval Overlap Graphs via On-line Games. | Tomasz Krawczyk, Bartosz Walczak |
| 2013 | GD | New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs. | Andrew Suk, Bartosz Walczak |
| 2013 | WG | Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors. | Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak |
| 2012 | COCOON | Outerplanar Graph Drawings with Few Slopes. | Kolja B. Knauer, Piotr Micek, Bartosz Walczak |
| 2012 | ESA | Extending Partial Representations of Function Graphs and Permutation Graphs. | Pavel Klavk, Jan Kratochvl, Tomasz Krawczyk, Bartosz Walczak |