25 citations · 119 across the 29 of their papers we have counts for
4 papers · 1 filter
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…
A Framework for Searching in Graphs in the Presence of Errors
Dariusz Dereniowski, Stefan Tiegel, Przemysław Uznański +1
We consider the problem of searching for an unknown target vertex in a (possibly edge-weighted) graph. Each \emph{vertex-query} points to a vertex and the response either a…
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…
Finding small-width connected path decompositions in polynomial time
Dariusz Dereniowski, Dorota Osula, Paweł Rzążewski
A connected path decomposition of a simple graph is a path decomposition such that the subgraph of induced by is connected for ea…