12 citations · 12 across the 2 of their papers we have counts for
5 papers
Online and Incremental Fractional Vertex Cover on Trees
Júlia Baligács, Bartłomiej Bosek, Yann Disser +5
In this paper we study the fractional vertex cover problem on trees in two related models: online and incremental. In the online model, the vertices of the tree are known a priori…
A tight lower bound for malicious online bipartite matching with limited recourse budget
Julia Baligacs, Bartłomiej Bosek, Paweł Putra +2
We study one-sided online bipartite matching with recourse. In this setting, one side of a bipartite graph is known in advance, while vertices on the other side arrive online toget…
Arboricity Nearly Bounds Degeneracy
Michał Lasoń, Bartłomiej Bosek, Grzegorz Gutowski +1
Arboricity and degeneracy are two fundamental and closely related graph parameters that measure the sparsity of a graph. Every -degenerate graph is -arboric, but some -arb…
A Note About Majority Colorings of Countable DAGs
Bartłomiej Bosek, Aleksander Katan
A majority coloring of an undirected graph is a vertex coloring in which for each vertex there are at least as many bi-chromatic edges containing that vertex as monochromatic ones.…
Additive colorings of planar graphs
Tomasz Bartnicki, Bartłomiej Bosek, Sebastian Czerwiński +3
An \emph{additive coloring} of a graph is an assignment of positive integers to the vertices of such that for every two adjacent vertices the sums of number…