25 citations · 119 across the 29 of their papers we have counts for
11 papers · 1 filter
A framework for distributed discrete evacuation strategies
Piotr Borowiecki, Dariusz Dereniowski, Łukasz Kuszner
In this paper, we study discrete evacuation in networks, where agents know the network topology and designated exit nodes but do not know the number and initial positions of other…
Searching by Heterogeneous Agents
Dariusz Dereniowski, Łukasz Kuszner, Robert Ostrowski
In this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search p…
Shared Processor Scheduling of Multiprocessor Jobs
Dariusz Dereniowski, Wieslaw Kubiak
We study shared processor scheduling of weighted jobs where each job can be executed on its private processor and simultaneously on possibly $\textit{many…
On tradeoffs between width- and fill-like graph parameters
Dariusz Dereniowski, Adam Stański
In this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges a…
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…
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…
Distributed Searching of Partial Grids
Dariusz Dereniowski, Dorota Urbańska
We consider the following distributed pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown -node network. Their goal is to…
Shared multi-processor scheduling
Dariusz Dereniowski, Wieslaw Kubiak
We study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order…
Structural Properties of an Open Problem in Preemptive Scheduling
Bo Chen, Ed Coffman, Dariusz Dereniowski +1
Structural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemp…
Distinguishing Views in Symmetric Networks: A Tight Lower Bound
Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak
The view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers , there…
From Pathwidth to Connected Pathwidth
Dariusz Dereniowski
It is proven that the connected pathwidth of any graph is at most $2\cdot\pw(G)+1$, where $\pw(G)$ is the pathwidth of . The method is constructive, i.e. it yields an effici…