34 citations · 50 across the 20 of their papers we have counts for
9 papers · 1 filter
Simple approximation algorithms for Polyamorous Scheduling
Yuriy Biktairov, Leszek Gąsieniec, Wanchote Po Jiamjitrak +3
In Polyamorous Scheduling, we are given an edge-weighted graph and must find a periodic schedule of matchings in this graph which minimizes the maximal weighted waiting time betwee…
Polyamorous Scheduling
Leszek Gąsieniec, Benjamin Smith, Sebastian Wild
Finding schedules for pairwise meetings between the members of a complex social group without creating interpersonal conflict is challenging, especially when different relationship…
Perpetual maintenance of machines with different urgency requirements
Leszek Gąsieniec, Tomasz Jurdziński, Ralf Klasing +4
A garden is populated by bamboos with the respective daily growth rates . It is assumed that the initial heights of…
Information Gathering in Ad-Hoc Radio Networks
Marek Chrobak, Kevin Costello, Leszek Gasieniec
In the ad-hoc radio network model, nodes communicate with their neighbors via radio signals, without knowing the topology of the graph. We study the information gathering problem,…
Temporal flows in Temporal networks
Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec +2
We introduce temporal flows on temporal networks, i.e., networks the links of which exist only at certain moments of time. Such networks are ephemeral in the sense that no link exi…
Efficiently Correcting Matrix Products
Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas +2
We study the problem of efficiently correcting an erroneous product of two matrices over a ring. Among other things, we provide a randomized algorithm for correcting a…
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols
Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski +3
In this work we focus on a natural class of population protocols whose dynamics are modelled by the discrete version of Lotka-Volterra equations. In such protocols, when an agent $…
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
Marek Chrobak, Kevin Costello, Leszek Gasieniec +1
We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards…
The Beachcombers' Problem: Walking and Searching with Mobile Robots
Jurek Czyzowicz, Leszek Gasieniec, Konstantinos Georgiou +2
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robots. Consider a line segment and a set of mobile robots $r_1,r_2,...,…