research
∙
02/16/2021
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs
We provide a deterministic CONGEST algorithm to constant factor approxim...
share
research
∙
08/20/2020
On Fine-Grained Exact Computation in Regular Graphs
We show that there is no subexponential time algorithm for computing the...
research
∙
08/19/2020
Disjoint Shortest Paths with Congestion on DAGs
In the k-Disjoint Shortest Paths problem, a set of source terminal pairs...
research
∙
10/07/2019
Distributed Distance-r Dominating Set on Sparse High-Girth Graphs
The dominating set problem and its generalization, the distance-r domina...
research
∙
10/18/2018
Complexity of computing the anti-Ramsey numbers
The anti-Ramsey numbers are a fundamental notion in graph theory, introd...
research
∙
05/15/2018
