21 citations · 39 across the 20 of their papers we have counts for
4 papers · 1 filter
Local Dimension is Unbounded for Planar Posets
Bartłomiej Bosek, Jarosław Grytczuk, William T. Trotter
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets in Kelly's example have bounded Boolean dimension and bounded local dimension, le…
Centroidal localization game
Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk +3
One important problem in a network is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations. For instance, the metric dimension of a gr…
Localization game on geometric and planar graphs
Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk +3
The main topic of this paper is motivated by a localization problem in cellular networks. Given a graph we want to localize a walking agent by checking his distance to as few v…
A Tight Bound for Shortest Augmenting Paths on Trees
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski +1
The shortest augmenting path technique is one of the fundamental ideas used in maximum matching and maximum flow algorithms. Since being introduced by Edmonds and Karp in 1972, it…