25 citations · 119 across the 29 of their papers we have counts for
35 papers
Graph Partitioning with Demands: Generalized Conductance and its Applications
Michał Szyfelbein, Dariusz Dereniowski
In this work, we study various graph partitioning problems under a general demand model. In each such task, we are given a graph with a capacity function $c\colon E\t…
Hierarchical -Clustering: Approximation and Hardness of Clustering into Trees and Bounded Diameter Graphs
Michał Szyfelbein, Dariusz Dereniowski
Consider the following variation on the Hierarchical Clustering problem: Usually, while building a hierarchical clustering, one recursively partitions the data until each cluster b…
Precedence-Constrained Decision Trees and Coverings
Michał Szyfelbein, Dariusz Dereniowski
This work considers a number of optimization problems and reductive relations between them. The two main problems we are interested in are the Optimal Decision Tree and Set Cover.…
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…
Low-degree spanning trees of -edge-connected graphs in linear time
Dariusz Dereniowski, Janusz Dybizbański, Przemysław Karpiński +2
We present a simple linear-time algorithm that finds a spanning tree of a given -edge-connected graph such that each vertex of has degree at most $\lceil \frac{°…
On multidimensional generalization of binary search
Dariusz Dereniowski, Przemysław Gordinowicz, Karolina Wróbel
This work generalizes the binary search problem to a -dimensional domain , where and , in the following way. Giv…