25 citations · 119 across the 29 of their papers we have counts for
Showing 2017 · cs.DMShow all
2 papers · 2 filters
cs.DM2017
The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents)
Dariusz Dereniowski, Andrzej Lingas, Dorota Osula +2
We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initia…
cs.DM2017★ 3 cited
Shared processor scheduling
Dariusz Dereniowski, Wieslaw Kubiak
We study the shared processor scheduling problem with a single shared processor where a unit time saving (weight) obtained by processing a job on the shared processor depends on th…