D. Dereniowski

activity

20082026

most citedLeader Election for Anonymous Asynchronous Agents in Arbitrary Networks

25 citations · 119 across the 29 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

cs.DS2024

Low-degree spanning trees of $2$ -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 $T$ of a given $2$ -edge-connected graph $G$ such that each vertex $v$ of $T$ has degree at most $\lceil \frac{°…

cs.DS2024

On multidimensional generalization of binary search

Dariusz Dereniowski, Przemysław Gordinowicz, Karolina Wróbel

This work generalizes the binary search problem to a $d$ -dimensional domain $S_{1} \times \dots \times S_{d}$ , where $S_{i} = {0, 1, \dots, n_{i} - 1}$ and $d \geq 1$ , in the following way. Giv…

cs.DS2024

Searching in trees with monotonic query times

Dariusz Dereniowski, Izajasz Wrosz

We consider the following generalization of binary search in sorted arrays to tree domains. In each step of the search, an algorithm is querying a vertex $q$ , and as a reply, it re…

Low-degree spanning trees of 2-edge-connected graphs in linear time

On multidimensional generalization of binary search

Searching in trees with monotonic query times

Low-degree spanning trees of $2$ -edge-connected graphs in linear time