Bartosz Walczak

98 papers A* 14A 3B 5Misc 1Journal 74Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Burling Graphs in Graphs with Large Chromatic Number. SODA Tara Abrishami, Marcin Brianski, James Davies, Xiying Du, Jana Masaríková, Pawel Rzazewski, Bartosz Walczak
2026	A*	`conf`	On a Clique Game and the Erdős-Hajnal Problem on High-Chromatic High-Girth Subgraphs. SODA Seth Pettie, Gábor Tardos, Bartosz Walczak
2025	J	`jnl`	A simple layered-wheel-like construction. CoRR Maria Chudnovsky, David Fischer, Sepehr Hajebi, Sophie Spirkl, Bartosz Walczak
2025	J	`jnl`	Burling graphs in graphs with large chromatic number. CoRR Tara Abrishami, Marcin Brianski, James Davies, Xiying Du, Jana Masaríková, Pawel Rzazewski, Bartosz Walczak
2025	J	`jnl`	Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth. SIAM J. Discret. Math. Tara Abrishami, Marcin Brianski, Jadwiga Czyzewska, Rose McCarty, Martin Milanic, Pawel Rzazewski, Bartosz Walczak
2025	B	`conf`	Polynomial-Time Recognition and Maximum Independent Set in Burling Graphs. WG Pawel Rzazewski, Bartosz Walczak
2024	A*	`conf`	Cliquewidth and Dimension. SODA Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
2024	J	`jnl`	Coloring triangle-free L-graphs with O(loglogn) colors. Eur. J. Comb. Bartosz Walczak
2024	J	`jnl`	Polynomial-time recognition and maximum independent set in Burling graphs. CoRR Pawel Rzazewski, Bartosz Walczak
2024	J	`jnl`	Separating Polynomial χ-Boundedness from χ-Boundedness. Comb. Marcin Brianski, James Davies, Bartosz Walczak
2024	A*	`conf`	Separator Theorem and Algorithms for Planar Hyperbolic Graphs. SoCG Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
2024	J	`jnl`	Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
2023	J	`jnl`	Approximating Pathwidth for Graphs of Small Treewidth. ACM Trans. Algorithms Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
2023	J	`jnl`	Cliquewidth and dimension. CoRR Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
2023	J	`jnl`	Coloring polygon visibility graphs and their generalizations. J. Comb. Theory B James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
2023	A*	`conf`	Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks. SoCG Mikkel Abrahamsen, Bartosz Walczak
2023	J	`jnl`	Grounded L-Graphs Are Polynomially χ-Bounded. Discret. Comput. Geom. James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
2023	J	`jnl`	Separator Theorem and Algorithms for Planar Hyperbolic Graphs. CoRR Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
2023	J	`jnl`	Tight bound on treedepth in terms of pathwidth and longest path. CoRR Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
2022	A*	`conf`	A Solution to Ringel's Circle Problem. SoCG James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak
2022	J	`jnl`	Clustered 3-colouring graphs of bounded degree. Comb. Probab. Comput. Vida Dujmovic, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood
2022	J	`jnl`	Degeneracy of J. Comb. Theory B Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak
2022	J	`jnl`	Separating polynomial χ-boundedness from χ-boundedness. CoRR Marcin Brianski, James Davies, Bartosz Walczak
2021	J	`jnl`	A solution to Ringel's circle problem. CoRR James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak
2021	A*	`conf`	Approximating Pathwidth for Graphs of Small Treewidth. SODA Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
2021	A*	`conf`	Coloring and Maximum Weight Independent Set of Rectangles. SODA Parinya Chalermsook, Bartosz Walczak
2021	A*	`conf`	Colouring Polygon Visibility Graphs and Their Generalizations. SoCG James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
2021	J	`jnl`	Colouring polygon visibility graphs and their generalizations. CoRR James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
2021	J	`jnl`	Distinguishing classes of intersection graphs of homothets or similarities of two convex disks. CoRR Mikkel Abrahamsen, Bartosz Walczak
2021	J	`jnl`	Grounded L-graphs are polynomially χ-bounded. CoRR James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
2021	J	`jnl`	Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2020	J	`jnl`	Approximating pathwidth for graphs of small treewidth. CoRR Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
2020	J	`jnl`	Coloring and Maximum Weight Independent Set of Rectangles. CoRR Parinya Chalermsook, Bartosz Walczak
2020	J	`jnl`	Coloring triangle-free L-graphs with O(log log n) colors. CoRR Bartosz Walczak
2019	J	`jnl`	Coloring Curves that Cross a Fixed Curve. Discret. Comput. Geom. Alexandre Rok, Bartosz Walczak
2019	J	`jnl`	Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace. ACM Trans. Algorithms Mikkel Abrahamsen, Bartosz Walczak
2019	J	`jnl`	Dimension of posets with planar cover graphs excluding two long incomparable chains. J. Comb. Theory A David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang
2019	J	`jnl`	Outerstring Graphs are χ-Bounded. SIAM J. Discret. Math. Alexandre Rok, Bartosz Walczak
2019	J	`jnl`	Planar graphs have bounded nonrepetitive chromatic number. CoRR Vida Dujmovic, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood
2019	B	`conf`	Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2019	J	`jnl`	Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2018	J	`jnl`	Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane. CoRR Torsten Mütze, Bartosz Walczak, Veit Wiechert
2018	A*	`conf`	Sparse Kneser graphs are Hamiltonian. STOC Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
2017	J	`jnl`	Boolean Dimension and Local Dimension. Electron. Notes Discret. Math. William T. Trotter, Bartosz Walczak
2017	J	`jnl`	Boolean dimension and local dimension. CoRR William T. Trotter, Bartosz Walczak
2017	A*	`conf`	Coloring Curves That Cross a Fixed Curve. SoCG Alexandre Rok, Bartosz Walczak
2017	B	`conf`	Extending Partial Representations of Trapezoid Graphs. WG Tomasz Krawczyk, Bartosz Walczak
2017	J	`jnl`	Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision. J. Graph Theory Adam Gagol, Piotr Micek, Bartosz Walczak
2017	J	`jnl`	Minors and dimension. J. Comb. Theory B Bartosz Walczak
2017	J	`jnl`	On the Beer Index of Convexity and Its Variants. Discret. Comput. Geom. Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
2017	J	`jnl`	On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations. Comb. Tomasz Krawczyk, Bartosz Walczak
2017	J	`jnl`	Sparse Kneser graphs are Hamiltonian. CoRR Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
2016	J	`jnl`	Decomposition of Multiple Packings with Subquadratic Union Complexity. Comb. Probab. Comput. János Pach, Bartosz Walczak
2016	B	`conf`	Graph Drawings with One Bend and Few Slopes. LATIN Kolja Knauer, Bartosz Walczak
2016	A	`conf`	Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace. ESA Mikkel Abrahamsen, Bartosz Walczak
2016	J	`jnl`	Outer common tangents and nesting of convex hulls of two disjoint simple polygons in linear time and constant workspace. CoRR Mikkel Abrahamsen, Bartosz Walczak
2016	J	`jnl`	The dimension of posets with planar cover graphs excluding two long incomparable chains. CoRR David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang
2016	J	`jnl`	Tree-width and dimension. Comb. Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
2015	J	`jnl`	Asymmetric Coloring Games on Incomparability Graphs. Electron. Notes Discret. Math. Tomasz Krawczyk, Bartosz Walczak
2015	J	`jnl`	Asymmetric coloring games on incomparability graphs. CoRR Tomasz Krawczyk, Bartosz Walczak
2015	J	`jnl`	Coloring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors. Discret. Comput. Geom. Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
2015	J	`jnl`	Coloring curves intersecting a fixed line. CoRR Alexandre Rok, Bartosz Walczak
2015	J	`jnl`	Dimension and cut vertices: an application of Ramsey theory. CoRR William T. Trotter, Bartosz Walczak, Ruidong Wang
2015	J	`jnl`	Graph drawings with one bend and few slopes. CoRR Kolja B. Knauer, Bartosz Walczak
2015	A*	`conf`	Minors and Dimension. SODA Bartosz Walczak
2015	J	`jnl`	New bounds on the maximum number of edges in k-quasi-planar graphs. Comput. Geom. Andrew Suk, Bartosz Walczak
2015	A*	`conf`	On the Beer Index of Convexity and Its Variants. SoCG Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
2015	J	`jnl`	Triangle-Free Geometric Intersection Graphs with No Large Independent Sets. Discret. Comput. Geom. Bartosz Walczak
2014	J	`jnl`	An extremal problem on crossing vectors. J. Comb. Theory A Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak
2014	J	`jnl`	Coloring Intersection Graphs of Arc-Connected Sets in the Plane. Discret. Comput. Geom. Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak
2014	—	`conf`	Coloring Relatives of Interval Overlap Graphs via On-line Games. ICALP (1) Tomasz Krawczyk, Bartosz Walczak
2014	J	`jnl`	Coloring relatives of interval overlap graphs via on-line games. CoRR Tomasz Krawczyk, Bartosz Walczak
2014	J	`jnl`	Graph sharing game and the structure of weighted graphs with forbidden subdivision. CoRR Adam Gagol, Piotr Micek, Bartosz Walczak
2014	J	`jnl`	Minors and dimension. CoRR Bartosz Walczak
2014	J	`jnl`	On the Beer index of convexity and its variants. CoRR Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
2014	J	`jnl`	Outerplanar graph drawings with few slopes. Comput. Geom. Kolja B. Knauer, Piotr Micek, Bartosz Walczak
2014	A*	`conf`	Outerstring graphs are χ-bounded. SoCG Alexandre Rok, Bartosz Walczak
2014	J	`jnl`	Triangle-free geometric intersection graphs with no big independent sets. CoRR Bartosz Walczak
2014	J	`jnl`	Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory B Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
2013	B	`conf`	Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors. WG Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
2013	J	`jnl`	Coloring intersection graphs of arc-connected sets in the plane. CoRR Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak
2013	J	`jnl`	Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors CoRR Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
2013	J	`jnl`	Decomposition of multiple packings with subquadratic union complexity. CoRR János Pach, Bartosz Walczak
2013	A	`conf`	New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs. GD Andrew Suk, Bartosz Walczak
2013	J	`jnl`	New bounds on the maximum number of edges in k-quasi-planar graphs. CoRR Andrew Suk, Bartosz Walczak
2013	J	`jnl`	Outerstring graphs are $χ$-bounded. CoRR Alexandre Rok, Bartosz Walczak
2013	J	`jnl`	Tree-Width and Dimension CoRR Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
2013	J	`jnl`	Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. Discret. Comput. Geom. Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
2012	J	`jnl`	An extremal problem on crossing vectors CoRR Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak
2012	A	`conf`	Extending Partial Representations of Function Graphs and Permutation Graphs. ESA Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak
2012	J	`jnl`	Extending partial representations of function graphs and permutation graphs CoRR Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak
2012	Misc	`conf`	Outerplanar Graph Drawings with Few Slopes. COCOON Kolja B. Knauer, Piotr Micek, Bartosz Walczak
2012	J	`jnl`	Outerplanar graph drawings with few slopes CoRR Kolja B. Knauer, Piotr Micek, Bartosz Walczak
2012	J	`jnl`	Parity in graph sharing games. Discret. Math. Piotr Micek, Bartosz Walczak
2012	J	`jnl`	Triangle-free geometric intersection graphs with large chromatic number CoRR Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
2012	J	`jnl`	Triangle-free intersection graphs of line segments with large chromatic number CoRR Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
2011	J	`jnl`	A Graph-Grabbing Game. Comb. Probab. Comput. Piotr Micek, Bartosz Walczak
2010	J	`jnl`	A simple representation of subwords of the Fibonacci word. Inf. Process. Lett. Bartosz Walczak