32 citations · 63 across the 14 of their papers we have counts for
22 papers
Maximum Matching on Regular Nonbipartite Graphs
Varsha Dani, Thomas P. Hayes, Seth Pettie
Blocking flow-type maximum matching algorithms are based on finding maximal sets of shortest augmenting paths. They run in time, on both bipartite [HK73, Din70, Kar7…
Energy-Efficient Maximal Independent Sets in Radio Networks
Dominick Banasik, Varsha Dani, Fabien Dufoulon +3
The maximal independent set (MIS) is one of the most fundamental problems in distributed computing, and it has been studied intensively for over four decades. This paper focuses on…
Low-Distortion Clustering in Bounded Growth Graphs
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes
The well-known clustering algorithm of Miller, Peng, and Xu (SPAA 2013) is useful for many applications, including low-diameter decomposition and low-energy distributed algorithms.…
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks
Varsha Dani, Thomas P. Hayes
Recent work has shown that it is sometimes feasible to significantly reduce the energy usage of some radio-network algorithms by adaptively powering down the radio receiver when it…
Reconstruction of Random Geometric Graphs: Breaking the Omega(r) distortion barrier
Varsha Dani, Josep Díaz, Thomas P. Hayes +1
Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network an…
Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks
Varsha Dani, Aayush Gupta, Thomas P. Hayes +1
We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for suc…