Bartłomiej Bosek

From MaRDI portal
Person:251889

Available identifiers

zbMath Open bosek.bartlomiejMaRDI QIDQ251889

List of research outcomes





PublicationDate of PublicationType
Majority coloring of infinite digraphs2024-10-18Paper
Majority choosability of countable graphs2024-01-23Paper
On a problem of Steinhaus2023-12-18Paper
https://portal.mardi4nfdi.de/entity/Q60591762023-11-02Paper
Mrs. Correct and Majority Colorings2022-07-20Paper
Graph polynomials and group coloring of graphs2022-04-07Paper
Recoloring Unit Interval Graphs with Logarithmic Recourse Budget2022-02-16Paper
Shortest Augmenting Paths for Online Matchings on Trees2022-01-18Paper
Hat chromatic number of graphs2021-09-30Paper
Nonrepetitive list colorings of the integers2021-06-17Paper
Planar posets that are accessible from below have dimension at most 62021-04-16Paper
On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains2021-02-08Paper
Local dimension is unbounded for planar posets2020-12-03Paper
Reflections on the Erd\H {o}s Discrepancy Problem2020-05-28Paper
Dilworth's Theorem for Borel Posets2020-04-05Paper
A tight bound for shortest augmenting paths on trees2020-02-12Paper
Weight choosability of oriented hypergraphs2019-07-25Paper
Generalized arboricity of graphs with large girth2019-03-25Paper
Centroidal localization game2019-03-05Paper
Majority coloring game2019-02-20Paper
Localization game on geometric and planar graphs2018-12-03Paper
An easy subexponential bound for online chain partitioning2018-05-25Paper
Shortest augmenting paths for online matchings on trees2018-04-12Paper
On-line Chain Partitioning Approach to Scheduling2018-03-18Paper
Graph coloring and Graham's greatest common divisor problem2018-01-19Paper
Majority choosability of digraphs2017-10-16Paper
Harmonious coloring of uniform hypergraphs2017-07-19Paper
A subexponential upper bound for the on-line chain partitioning problem2016-05-03Paper
On the duality of semiantichains and unichain coverings.2016-03-02Paper
Shortest Augmenting Paths for Online Matchings on Trees2016-02-26Paper
Additive coloring of planar graphs2014-09-19Paper
Forbidden structures for efficient first-fit chain partitioning (extended abstract)2013-11-01Paper
Variants of online chain partition problem of posets2013-10-02Paper
First-Fit Coloring of Incomparability Graphs2013-06-27Paper
On-line dimension of semi-orders2013-06-26Paper
On-line version of Rabinovitch theorem for proper intervals2012-11-15Paper
News about Semiantichains and Unichain Coverings2012-09-10Paper
On-line chain partitions of orders: a survey2012-03-23Paper
First-Fit Algorithm for the On-Line Chain Partitioning Problem2010-12-03Paper
https://portal.mardi4nfdi.de/entity/Q35759972010-07-28Paper
On-line chain partitioning of up-growing interval orders2007-10-12Paper

Research outcomes over time

This page was built for person: Bartłomiej Bosek