Bartosz Walczak

422 total citations
27 papers, 110 citations indexed

About

Bartosz Walczak is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Bartosz Walczak has authored 27 papers receiving a total of 110 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 13 papers in Computer Graphics and Computer-Aided Design and 8 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Bartosz Walczak's work include Advanced Graph Theory Research (20 papers), Computational Geometry and Mesh Generation (13 papers) and Limits and Structures in Graph Theory (8 papers). Bartosz Walczak is often cited by papers focused on Advanced Graph Theory Research (20 papers), Computational Geometry and Mesh Generation (13 papers) and Limits and Structures in Graph Theory (8 papers). Bartosz Walczak collaborates with scholars based in Poland, United States and Switzerland. Bartosz Walczak's co-authors include Piotr Micek, William T. Trotter, Andrew Suk, James Davies, Torsten Mütze, Ruidong Wang, Vida Dujmović, Paweł Rzążewski, Stéphan Thomassé and Marthe Bonamy and has published in prestigious journals such as Discrete Mathematics, Journal of the London Mathematical Society and Journal of Combinatorial Theory Series B.

In The Last Decade

Bartosz Walczak

24 papers receiving 102 citations

Peers

Bartosz Walczak

CTM

DMC

CGCD

GT

AI

Rudi Pendavingh Netherlands

Jérémie Chalopin France

Piotr Micek Poland

John Gimbel United States

Dimitrios M. Thilikos France

Édouard Bonnet France

Sebastian Siebertz Germany

David Erwin United States

Cláudia Linhares Sales Brazil

Rudini Sampaio Brazil

Rudi Pendavingh Netherlands

Bartosz Walczak

89 ×1.0

CTM

43 ×1.0

DMC

12 ×0.4

CGCD

28 ×1.1

GT

24 ×1.6

AI

Citations per year, relative to Bartosz Walczak Bartosz Walczak (= 1×) peers Rudi Pendavingh

Countries citing papers authored by Bartosz Walczak

Since Specialization

Citations

This map shows the geographic impact of Bartosz Walczak's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Bartosz Walczak with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bartosz Walczak more than expected).

Fields of papers citing papers by Bartosz Walczak

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bartosz Walczak. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Bartosz Walczak. The network helps show where Bartosz Walczak may publish in the future.

Co-authorship network of co-authors of Bartosz Walczak

This figure shows the co-authorship network connecting the top 25 collaborators of Bartosz Walczak. A scholar is included among the top collaborators of Bartosz Walczak based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Bartosz Walczak. Bartosz Walczak is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Milanič, Martin, et al.. (2025). Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth. SIAM Journal on Discrete Mathematics. 39(2). 1189–1200.

2.

Davies, James, et al.. (2023). Separating Polynomial $$\chi $$-Boundedness from $$\chi $$-Boundedness. COMBINATORICA. 44(1). 1–8. 10 indexed citations

3.

Davies, James, et al.. (2023). Grounded L-Graphs Are Polynomially $$\chi $$-Bounded. Discrete & Computational Geometry. 70(4). 1523–1550. 2 indexed citations

4.

Davies, James C., et al.. (2023). Coloring polygon visibility graphs and their generalizations. Journal of Combinatorial Theory Series B. 161. 268–300.

5.

Joret, Gwenaël, et al.. (2022). Approximating Pathwidth for Graphs of Small Treewidth. ACM Transactions on Algorithms. 19(2). 1–19. 3 indexed citations

6.

Chalermsook, Parinya & Bartosz Walczak. (2021). Coloring and Maximum Weight Independent Set of Rectangles. arXiv (Cornell University). 860–868.

7.

Dujmović, Vida, Louis Esperet, Pat Morin, Bartosz Walczak, & David R. Wood. (2021). Clustered 3-colouring graphs of bounded degree. Combinatorics Probability Computing. 31(1). 123–135. 9 indexed citations

8.

Walczak, Bartosz. (2020). Coloring triangle-free L-graphs with $O(\log\log n)$ colors. arXiv (Cornell University). 88(3). 1063–1069. 1 indexed citations

9.

Mütze, Torsten, et al.. (2020). Sparse Kneser graphs are Hamiltonian. Journal of the London Mathematical Society. 103(4). 1253–1275. 5 indexed citations

10.

Howard, David M., et al.. (2018). Dimension of posets with planar cover graphs excluding two long incomparable chains. Journal of Combinatorial Theory Series A. 164. 1–23. 3 indexed citations

11.

Mütze, Torsten, et al.. (2018). Sparse Kneser graphs are Hamiltonian. Warwick Research Archive Portal (University of Warwick). 912–919. 5 indexed citations

12.

Walczak, Bartosz, et al.. (2018). Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace. ACM Transactions on Algorithms. 15(1). 1–21. 2 indexed citations

13.

Walczak, Bartosz. (2016). Minors and dimension. Journal of Combinatorial Theory Series B. 122. 668–689. 5 indexed citations

14.

Micek, Piotr, et al.. (2016). Tree-width and dimension. 7 indexed citations

15.

Suk, Andrew & Bartosz Walczak. (2015). New bounds on the maximum number of edges in k-quasi-planar graphs. Computational Geometry. 50. 24–33. 7 indexed citations

16.

Micek, Piotr, et al.. (2014). An extremal problem on crossing vectors. Journal of Combinatorial Theory Series A. 128. 41–55. 1 indexed citations

17.

Walczak, Bartosz, et al.. (2014). Outerstring graphs are χ-bounded. Jagiellonian University Repository (Jagiellonian University). 136–143. 3 indexed citations

18.

Walczak, Bartosz. (2014). Triangle-Free Geometric Intersection Graphs with No Large Independent Sets. Discrete & Computational Geometry. 53(1). 221–225. 4 indexed citations

19.

Micek, Piotr, et al.. (2013). Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. Discrete & Computational Geometry. 50(3). 714–726. 11 indexed citations

20.

Micek, Piotr & Bartosz Walczak. (2012). Parity in graph sharing games. Discrete Mathematics. 312(10). 1788–1795. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact