default search action
Bartosz Walczak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j32]Marcin Brianski, James Davies, Bartosz Walczak:
Separating Polynomial χ-Boundedness from χ-Boundedness. Comb. 44(1): 1-8 (2024) - [j31]Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. 44(2): 417-427 (2024) - [j30]Bartosz Walczak:
Coloring triangle-free L-graphs with O(loglogn) colors. Eur. J. Comb. 117: 103831 (2024) - [c21]Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki:
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. SoCG 2024: 67:1-67:17 - [c20]Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak:
Cliquewidth and Dimension. SODA 2024: 1437-1446 - [i39]Pawel Rzazewski, Bartosz Walczak:
Polynomial-time recognition and maximum independent set in Burling graphs. CoRR abs/2407.16666 (2024) - 2023
- [j29]James Davies, Tomasz Krawczyk, Rose McCarty
, Bartosz Walczak:
Grounded L-Graphs Are Polynomially χ-Bounded. Discret. Comput. Geom. 70(4): 1523-1550 (2023) - [j28]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Coloring polygon visibility graphs and their generalizations. J. Comb. Theory B 161: 268-300 (2023) - [j27]Carla Groenland
Approximating Pathwidth for Graphs of Small Treewidth. ACM Trans. Algorithms 19(2): 16:1-16:19 (2023) - [c19]Mikkel Abrahamsen
Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks. SoCG 2023: 2:1-2:16 - [i38]Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight bound on treedepth in terms of pathwidth and longest path. CoRR abs/2302.02995 (2023) - [i37]Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak:
Cliquewidth and dimension. CoRR abs/2308.11950 (2023) - [i36]Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki:
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. CoRR abs/2310.11283 (2023) - 2022
- [j26]Vida Dujmovic, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood:
Clustered 3-colouring graphs of bounded degree. Comb. Probab. Comput. 31(1): 123-135 (2022) - [j25]Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak:
Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs. J. Comb. Theory B 152: 353-378 (2022) - [c18]James Davies, Chaya Keller
A Solution to Ringel's Circle Problem. SoCG 2022: 33:1-33:14 - [i35]Marcin Brianski, James Davies, Bartosz Walczak:
Separating polynomial χ-boundedness from χ-boundedness. CoRR abs/2201.08814 (2022) - 2021
- [j24]Jana Novotná, Karolina Okrasa
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica 83(8): 2634-2650 (2021) - [c17]James Davies, Tomasz Krawczyk, Rose McCarty
Colouring Polygon Visibility Graphs and Their Generalizations. SoCG 2021: 29:1-29:16 - [c16]Parinya Chalermsook, Bartosz Walczak:
Coloring and Maximum Weight Independent Set of Rectangles. SODA 2021: 860-868 - [c15]Carla Groenland, Gwenaël Joret, Wojciech Nadara
Approximating Pathwidth for Graphs of Small Treewidth. SODA 2021: 1965-1976 - [i34]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Colouring polygon visibility graphs and their generalizations. CoRR abs/2103.07803 (2021) - [i33]Mikkel Abrahamsen, Bartosz Walczak:
Distinguishing classes of intersection graphs of homothets or similarities of two convex disks. CoRR abs/2108.04588 (2021) - [i32]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Grounded L-graphs are polynomially χ-bounded. CoRR abs/2108.05611 (2021) - [i31]James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak:
A solution to Ringel's circle problem. CoRR abs/2112.05042 (2021) - 2020
- [i30]Bartosz Walczak:
Coloring triangle-free L-graphs with O(log log n) colors. CoRR abs/2002.10755 (2020) - [i29]Parinya Chalermsook, Bartosz Walczak:
Coloring and Maximum Weight Independent Set of Rectangles. CoRR abs/2007.07880 (2020) - [i28]Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak:
Approximating pathwidth for graphs of small treewidth. CoRR abs/2008.00779 (2020)
2010 – 2019
- 2019
- [j23]Alexandre Rok, Bartosz Walczak:
Coloring Curves that Cross a Fixed Curve. Discret. Comput. Geom. 61(4): 830-851 (2019) - [j22]David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak
Dimension of posets with planar cover graphs excluding two long incomparable chains. J. Comb. Theory A 164: 1-23 (2019) - [j21]Alexandre Rok, Bartosz Walczak:
Outerstring Graphs are χ-Bounded. SIAM J. Discret. Math. 33(4): 2181-2199 (2019) - [j20]Mikkel Abrahamsen
Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace. ACM Trans. Algorithms 15(1): 12:1-12:21 (2019) - [c14]Jana Novotná
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC 2019: 23:1-23:11 - [i27]Vida Dujmovic, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood:
Planar graphs have bounded nonrepetitive chromatic number. CoRR abs/1904.05269 (2019) - [i26]Jana Novotná
Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR abs/1910.01082 (2019) - 2018
- [c13]Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
Sparse Kneser graphs are Hamiltonian. STOC 2018: 912-919 - [i25]Torsten Mütze, Bartosz Walczak, Veit Wiechert:
Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane. CoRR abs/1802.09969 (2018) - 2017
- [j19]Tomasz Krawczyk, Bartosz Walczak
On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations. Comb. 37(6): 1139-1179 (2017) - [j18]Martin Balko
On the Beer Index of Convexity and Its Variants. Discret. Comput. Geom. 57(1): 179-214 (2017) - [j17]William T. Trotter, Bartosz Walczak
Boolean Dimension and Local Dimension. Electron. Notes Discret. Math. 61: 1047-1053 (2017) - [j16]Bartosz Walczak
Minors and dimension. J. Comb. Theory B 122: 668-689 (2017) - [j15]Adam Gagol, Piotr Micek, Bartosz Walczak
Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision. J. Graph Theory 85(1): 22-50 (2017) - [c12]Alexandre Rok, Bartosz Walczak:
Coloring Curves That Cross a Fixed Curve. SoCG 2017: 56:1-56:15 - [c11]Tomasz Krawczyk, Bartosz Walczak:
Extending Partial Representations of Trapezoid Graphs. WG 2017: 358-371 - [i24]William T. Trotter, Bartosz Walczak:
Boolean dimension and local dimension. CoRR abs/1705.09167 (2017) - [i23]Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak:
Sparse Kneser graphs are Hamiltonian. CoRR abs/1711.01636 (2017) - 2016
- [j14]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak
Tree-width and dimension. Comb. 36(4): 431-450 (2016) - [j13]János Pach, Bartosz Walczak
Decomposition of Multiple Packings with Subquadratic Union Complexity. Comb. Probab. Comput. 25(1): 145-153 (2016) - [c10]Mikkel Abrahamsen
Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace. ESA 2016: 4:1-4:15 - [c9]Kolja Knauer
Graph Drawings with One Bend and Few Slopes. LATIN 2016: 549-561 - [i22]Mikkel Abrahamsen, Bartosz Walczak:
Outer common tangents and nesting of convex hulls of two disjoint simple polygons in linear time and constant workspace. CoRR abs/1601.01816 (2016) - [i21]David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang:
The dimension of posets with planar cover graphs excluding two long incomparable chains. CoRR abs/1608.08843 (2016) - 2015
- [j12]Andrew Suk, Bartosz Walczak
New bounds on the maximum number of edges in k-quasi-planar graphs. Comput. Geom. 50: 24-33 (2015) - [j11]Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
Coloring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors. Discret. Comput. Geom. 53(1): 199-220 (2015) - [j10]Bartosz Walczak
Triangle-Free Geometric Intersection Graphs with No Large Independent Sets. Discret. Comput. Geom. 53(1): 221-225 (2015) - [j9]Tomasz Krawczyk, Bartosz Walczak
Asymmetric Coloring Games on Incomparability Graphs. Electron. Notes Discret. Math. 49: 803-811 (2015) - [c8]Martin Balko
On the Beer Index of Convexity and Its Variants. SoCG 2015: 406-420 - [c7]Bartosz Walczak
Minors and Dimension. SODA 2015: 1698-1707 - [i20]Tomasz Krawczyk, Bartosz Walczak:
Asymmetric coloring games on incomparability graphs. CoRR abs/1503.04748 (2015) - [i19]William T. Trotter, Bartosz Walczak, Ruidong Wang:
Dimension and cut vertices: an application of Ramsey theory. CoRR abs/1505.08162 (2015) - [i18]Kolja B. Knauer, Bartosz Walczak:
Graph drawings with one bend and few slopes. CoRR abs/1506.04423 (2015) - [i17]Alexandre Rok, Bartosz Walczak:
Coloring curves intersecting a fixed line. CoRR abs/1512.06112 (2015) - 2014
- [j8]Kolja B. Knauer
Outerplanar graph drawings with few slopes. Comput. Geom. 47(5): 614-624 (2014) - [j7]Michal Lason
Coloring Intersection Graphs of Arc-Connected Sets in the Plane. Discret. Comput. Geom. 52(2): 399-415 (2014) - [j6]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason
Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory B 105: 6-10 (2014) - [j5]Michal Lason
An extremal problem on crossing vectors. J. Comb. Theory A 128: 41-55 (2014) - [c6]Alexandre Rok, Bartosz Walczak
Outerstring graphs are χ-bounded. SoCG 2014: 136 - [c5]Tomasz Krawczyk, Bartosz Walczak
Coloring Relatives of Interval Overlap Graphs via On-line Games. ICALP (1) 2014: 738-750 - [i16]Tomasz Krawczyk, Bartosz Walczak:
Coloring relatives of interval overlap graphs via on-line games. CoRR abs/1402.2437 (2014) - [i15]Bartosz Walczak:
Triangle-free geometric intersection graphs with no big independent sets. CoRR abs/1404.0169 (2014) - [i14]Bartosz Walczak:
Minors and dimension. CoRR abs/1407.4066 (2014) - [i13]Adam Gagol, Piotr Micek, Bartosz Walczak:
Graph sharing game and the structure of weighted graphs with forbidden subdivision. CoRR abs/1411.6727 (2014) - [i12]Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak:
On the Beer index of convexity and its variants. CoRR abs/1412.1769 (2014) - 2013
- [j4]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason
Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. Discret. Comput. Geom. 50(3): 714-726 (2013) - [c4]Andrew Suk, Bartosz Walczak
New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs. GD 2013: 95-106 - [c3]Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors. WG 2013: 333-344 - [i11]Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak:
Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors. CoRR abs/1301.0541 (2013) - [i10]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-Width and Dimension. CoRR abs/1301.5271 (2013) - [i9]Andrew Suk, Bartosz Walczak:
New bounds on the maximum number of edges in k-quasi-planar graphs. CoRR abs/1309.0395 (2013) - [i8]Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak:
Coloring intersection graphs of arc-connected sets in the plane. CoRR abs/1310.7558 (2013) - [i7]Alexandre Rok, Bartosz Walczak:
Outerstring graphs are $χ$-bounded. CoRR abs/1312.1559 (2013) - [i6]János Pach, Bartosz Walczak:
Decomposition of multiple packings with subquadratic union complexity. CoRR abs/1312.3215 (2013) - 2012
- [j3]Piotr Micek, Bartosz Walczak
Parity in graph sharing games. Discret. Math. 312(10): 1788-1795 (2012) - [c2]Kolja B. Knauer
Outerplanar Graph Drawings with Few Slopes. COCOON 2012: 323-334 - [c1]Pavel Klavík
Extending Partial Representations of Function Graphs and Permutation Graphs. ESA 2012: 671-682 - [i5]Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak:
Extending partial representations of function graphs and permutation graphs. CoRR abs/1204.6391 (2012) - [i4]Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak:
An extremal problem on crossing vectors. CoRR abs/1205.1824 (2012) - [i3]Kolja B. Knauer, Piotr Micek, Bartosz Walczak:
Outerplanar graph drawings with few slopes. CoRR abs/1205.2548 (2012) - [i2]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. CoRR abs/1209.1595 (2012) - [i1]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free geometric intersection graphs with large chromatic number. CoRR abs/1212.2058 (2012) - 2011
- [j2]Piotr Micek, Bartosz Walczak
A Graph-Grabbing Game. Comb. Probab. Comput. 20(4): 623-629 (2011) - 2010
- [j1]Bartosz Walczak
A simple representation of subwords of the Fibonacci word. Inf. Process. Lett. 110(21): 956-960 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: