activity
20122026
most citedLocalization game on geometric and planar graphs

21 citations · 39 across the 20 of their papers we have counts for

collaborators
Showing 2014 · cs.DSShow all

1 paper · 2 filters

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…