|
 | Up a level |
Athreya, S and Gupta, P and Yogeshwaran, D (2023) Volume approximation of strongly C-convex domains by random polyhedra. In: Advances in Mathematics, 432 .
Vinay Kumar, BR and Kashyap, N and Yogeshwaran, D (2021) An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs. In: 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks, WiOpt 2021, 18-21 Oct 2021, Virtual, Philadelphia.
Iyer, SK and Yogeshwaran, D (2020) Thresholds for vanishing of 'isolated' faces in random �ech and vietoris-rips complexes. In: Annales de l'institut Henri Poincare (B) Probability and Statistics, 56 (3). pp. 1869-1897.
Skraba, P and Thoppe, G and Yogeshwaran, D (2020) Randomly weighted d-complexes: Minimal spanning acycles and Persistence diagrams. In: Electronic Journal of Combinatorics, 27 (2).
Iyer, Srikanth K and Yogeshwaran, D (2012) Percolation and connectivity in AB random geometric graphs. In: ADVANCES IN APPLIED PROBABILITY, 44 (1). pp. 21-41.
Iyer, Srikanth K and Yogeshwaran, D (2010) Percolation and Connectivity in AB Random Geometric Graphs. TR-PME-2010-17.
Iyer, Srikanth K and Manjunath, D and Yogeshwaran, D (2008) Limit Laws for k-Coverage of Paths by a Markov-Poisson-Boolean Model. In: Stochastic Models, 24 (4). pp. 558-582.
Ram, Sundhar S and Manjunath, D and Iyer, Srikanth K and Yogeshwaran, D (2007) On the Path Coverage Properties of Random Sensor Networks. In: IEEE Transactions On Mobile Computing, 6 (5). pp. 446-458.
Karamchandani, Nikhil and Manjunath, D and Yogeshwaran, D and Iyer, Srikanth K (2006) Evolving Random Geometric Graph Models for Mobile Wireless Networks. In: 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 03-06 April 2006, Boston.
