67 citations · 145 across the 10 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
An easy subexponential bound for online chain partitioning
Bartłomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk +2
Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width into chains. We improve this to with a simpler and…
cs.DS2014★ 11 cited
On-line approach to off-line coloring problems on graphs with geometric representations
Tomasz Krawczyk, Bartosz Walczak
The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs with geometric representations and competitive analysis of on-line algor…