4 citations · 4 across the 4 of their papers we have counts for
6 papers
Approximation Algorithms for Directed Weighted Spanners
Elena Grigorescu, Nithish Kumar, Young-San Lin
In the pairwise weighted spanner problem, the input consists of an -vertex-directed graph, where each edge is assigned a cost and a length. Given vertex pairs and a distance…
Phase Transitions of Diversity in Stochastic Block Model Dynamics
Simina Brânzei, Nithish Kumar, Gireeja Ranade
This paper proposes a stochastic block model with dynamics where the population grows using preferential attachment. Nodes with higher weighted degree are more likely to recruit ne…
Fractional eternal domination: securely distributing resources across a network
Fnu Devvrit, Aaron Krim-Yee, Nithish Kumar +4
This paper initiates the study of fractional eternal domination in graphs, a natural relaxation of the well-studied eternal domination problem. We study the connections to flows an…
CoMet: Modeling Group Cohesion for Socially Compliant Robot Navigation in Crowded Scenes
Adarsh Jagan Sathyamoorthy, Utsav Patel, Moumita Paul +3
We present CoMet, a novel approach for computing a group's cohesion and using that to improve a robot's navigation in crowded scenes. Our approach uses a novel cohesion-metric that…
Dynamically Feasible Deep Reinforcement Learning Policy for Robot Navigation in Dense Mobile Crowds
Utsav Patel, Nithish Kumar, Adarsh Jagan Sathyamoorthy +1
We present a novel Deep Reinforcement Learning (DRL) based policy to compute dynamically feasible and spatially aware velocities for a robot navigating among mobile obstacles. Our…
A study of cops and robbers in oriented graphs
Devvrit Khatri, Natasha Komarov, Aaron Krim-Yee +4
We consider the well-studied cops and robbers game in the context of oriented graphs, which has received surprisingly little attention to date. We examine the relationship between…