research
∙
05/28/2022
Overcoming Congestion in Distributed Coloring
We present a new technique to efficiently sample and communicate a large...
share
research
∙
12/01/2021
Near-Optimal Distributed Degree+1 Coloring
We present a new approach to randomized distributed graph coloring that ...
research
∙
09/14/2021
Distributed Vertex Cover Reconfiguration
Reconfiguration schedules, i.e., sequences that gradually transform one ...
research
∙
05/10/2021
Ultrafast Distributed Coloring of High Degree Graphs
We give a new randomized distributed algorithm for the Δ+1-list coloring...
research
∙
05/03/2021
Fault Tolerant Max-Cut
In this work, we initiate the study of fault tolerant Max Cut, where giv...
research
∙
12/28/2020
Efficient Randomized Distributed Coloring in CONGEST
Distributed vertex coloring is one of the classic problems and probably ...
research
∙
10/07/2020
Query Minimization under Stochastic Uncertainty
We study problems with stochastic uncertainty information on intervals f...
research
∙
07/30/2020
Local Conflict Coloring Revisited: Linial for Lists
Linial's famous color reduction algorithm reduces a given m-coloring of ...
research
∙
06/28/2018
Effective Wireless Scheduling via Hypergraph Sketches
An overarching issue in resource management of wireless networks is asse...
research
∙
03/12/2018
Spanning Trees With Edge Conflicts and Wireless Connectivity
We introduce the problem of finding a spanning tree along with a partiti...
research
∙
12/08/2017