Varsha Dani

Rochester Institute of Technology — United States

Computer Science · Physical Sciences

16h-index1.5kcitations66works0.12yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(25), Cryptography and Data Security(18), Optimization and Search Problems(16), Mobile Ad Hoc Networks(8), Advanced Graph Theory Research(7)

Publications66 total

Improving Students' Algorithmic Mathematical Competency via In-class Activities: New Course Materials and a Preliminary Multi-Section Study
2026Open Access
Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks
2025Open Access
Low-Distortion Clustering in Bounded Growth Graphs
Lecture notes in computer science·2025
A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular Non-Bipartite Graphs
Society for Industrial and Applied Mathematics eBooks·2025
Energy-Efficient Maximal Independent Sets in Radio Networks
ArXiv.org·2025Open Access
Navigating the Edge: UAS Boundary Tracing for Efficient Volcanic Plume Monitoring
2024
Boundary sketching with asymptotically optimal distance and rotation
Theoretical Computer Science·2024
Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs
2024· 1 citedOpen Access
Low-Distortion Clustering in Bounded Growth Graphs
arXiv (Cornell University)·2024Open Access
Reconstruction of random geometric graphs: Breaking the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e978" altimg="si13.svg"><mml:mrow><mml:mi>Ω</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math> distortion barrier
European Journal of Combinatorics·2023Open Access
Boundary Sketching with Asymptotically Optimal Distance and Rotation
Lecture notes in computer science·2023· 1 cited
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
Distributed Computing·2022· 9 cited
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2022· 1 citedOpen Access
Improved Reconstruction of Random Geometric Graphs
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2022· 1 citedOpen Access
Reconstruction of Random Geometric Graphs: Breaking the Omega(r) distortion barrier
arXiv (Cornell University)·2021Open Access
Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks
2021· 3 cited
Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching\n in Radio Networks
arXiv (Cornell University)·2021Open Access
On the Power of Choice for k-Colorability of Random Graphs
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021Open Access
Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks
arXiv (Cornell University)·2021Open Access
The Energy Complexity of BFS in Radio Networks
2020· 21 citedOpen Access
page 1 of 4Next →

Frequent Co-authors

Thomas P. Hayes(32), Jared Saia(17), Mahnush Movahedi(9), Cristopher Moore(9), Seth Pettie(7), Abhinav Aggarwal(7), Yi‐Jun Chang(5), Valerie King(5), Josep Dı́az(5), Sham M. Kakade(3), Alina Beygelzimer(2), John Langford(2), Qizheng He(2), Wenzheng Li(2), Maxwell Young(2), Aayush Gupta(2), Ivona Bezáková(1), Peter L. Bartlett(1), Alexander Rakhlin(1), Ambuj Tewari(1)