2 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.DS2022★ 2 cited
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks
Amy Babay, Michael Dinitz, Aravind Srinivasan +2
The spread of an epidemic is often modeled by an SIR random process on a social network graph. The MinINF problem for optimal social distancing involves minimizing the expected num…
cs.DS2021★ 2 cited
Fair Disaster Containment via Graph-Cut Problems
Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas +1
Graph cut problems are fundamental in Combinatorial Optimization, and are a central object of study in both theory and practice. Furthermore, the study of \emph{fairness} in Algori…
cs.DS2018
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network
Amy Babay, Michael Dinitz, Zeyu Zhang
We consider the Shallow-Light Steiner Network problem from a fixed-parameter perspective. Given a graph , a distance bound , and pairs of vertices $(s_1,t_1),\cdots,(s_p,…