Bartosz Walczak

From MaRDI portal
Person:324374

Available identifiers

zbMath Open walczak.bartoszWikidataQ62058458 ScholiaQ62058458MaRDI QIDQ324374

List of research outcomes





PublicationDate of PublicationType
Cliquewidth and dimension2024-11-28Paper
Coloring triangle-free L-graphs with \(O(\log\log n)\) colors2024-10-18Paper
Distinguishing classes of intersection graphs of homothets or similarities of two convex disks2024-10-16Paper
Separating polynomial \(\chi\)-boundedness from \(\chi\)-boundedness2024-04-09Paper
Coloring triangle-free L-graphs with \(O (\log \log n)\) colors2024-01-23Paper
Coloring and Maximum Weight Independent Set of Rectangles2024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61473732024-01-15Paper
Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded2023-12-21Paper
Approximating Pathwidth for Graphs of Small Treewidth2023-10-23Paper
Cliquewidth and dimension2023-08-23Paper
Coloring polygon visibility graphs and their generalizations2023-05-02Paper
Clustered 3-colouring graphs of bounded degree2023-03-31Paper
Tight bound on treedepth in terms of pathwidth and longest path2023-02-06Paper
https://portal.mardi4nfdi.de/entity/Q58755572023-02-03Paper
A solution to Ringel's circle problem2021-12-09Paper
Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs2021-11-17Paper
Sparse Kneser graphs are Hamiltonian2021-08-13Paper
Distinguishing classes of intersection graphs of homothets or similarities of two convex disks2021-08-10Paper
Subexponential-time algorithms for finding large induced sparse subgraphs2021-07-26Paper
Planar graphs have bounded nonrepetitive chromatic number2020-10-20Paper
Clustered 3-Colouring Graphs of Bounded Degree2020-02-26Paper
Outerstring Graphs are $\chi$-Bounded2019-11-20Paper
Sparse Kneser graphs are Hamiltonian2019-08-22Paper
Coloring curves that cross a fixed curve2019-05-21Paper
Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace2019-03-28Paper
Dimension of posets with planar cover graphs excluding two long incomparable chains2019-03-27Paper
Dimension and Cut Vertices: An Application of Ramsey Theory2018-10-09Paper
Coloring curves that cross a fixed curve2018-08-13Paper
On-line approach to off-line coloring problems on graphs with geometric representations2018-07-23Paper
Outerstring graphs are χ-bounded2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46062692018-03-02Paper
Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane2018-02-27Paper
Boolean dimension and local dimension2018-01-18Paper
Extending partial representations of trapezoid graphs2018-01-04Paper
A simple representation of subwords of the Fibonacci word2017-11-03Paper
On the Beer Index of Convexity and Its Variants2017-10-10Paper
Minors and Dimension2017-10-05Paper
Decomposition of Multiple Packings with Subquadratic Union Complexity2017-10-04Paper
Tree-width and dimension2017-08-25Paper
Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision2017-06-30Paper
On the Beer index of convexity and its variants2017-02-24Paper
Minors and dimension2016-11-25Paper
Asymmetric coloring games on incomparability graphs2016-10-14Paper
Graph Drawings with One Bend and Few Slopes2016-05-03Paper
New bounds on the maximum number of edges in \(k\)-quasi-planar graphs2016-01-15Paper
Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors2015-02-19Paper
Triangle-free geometric intersection graphs with no large independent sets2015-02-19Paper
Coloring intersection graphs of arc-connected sets in the plane2014-10-29Paper
An extremal problem on crossing vectors.2014-10-07Paper
Triangle-free intersection graphs of line segments with large chromatic number2014-08-27Paper
Asymmetric coloring games on incomparability graphs2014-07-01Paper
https://portal.mardi4nfdi.de/entity/Q54199812014-06-11Paper
Outerplanar graph drawings with few slopes2014-04-09Paper
New bounds on the maximum number of edges in \(k\)-quasi-planar graphs2013-12-20Paper
Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors2013-12-06Paper
Triangle-free geometric intersection graphs with large chromatic number2013-11-06Paper
Graph Drawings with One Bend and Few Slopes2012-09-25Paper
Extending Partial Representations of Function Graphs and Permutation Graphs2012-09-25Paper
Parity in graph sharing games2012-05-30Paper
A Graph-Grabbing Game2011-08-16Paper
Excluding a clique or a biclique in graphs of bounded induced matching treewidthN/APaper

Research outcomes over time

This page was built for person: Bartosz Walczak