Evolving random geometric graph models for mobile wireless networks. - Nikhil Karamchandani; D. Manjunath; D. Yogeshwaran; Srikanth K. Iyer (WiOpt, 2006)

On the Path Coverage Properties of Random Sensor Networks. - S. Sundhar Ram; D. Manjunath; Srikanth K. Iyer; D. Yogeshwaran (IEEE Trans. Mob. Comput., 2007)

Connectivity in sub-Poisson networks. - Bartlomiej Blaszczyszyn; D. Yogeshwaran (Allerton, 2010)

Limit theory for geometric statistics of clustering point processes. - Bartlomiej Blaszczyszyn; D. Yogeshwaran; Joseph E. Yukich (CoRR, 2016)

Randomly Weighted d-Complexes: Minimal Spanning Acycles and Persistence Diagrams. - Primoz Skraba; Gugan Thoppe; D. Yogeshwaran (Electron. J. Comb., 2020)

Spectral gap bounds for the simplicial Laplacian and an application to random complexes. - Samir Shukla; D. Yogeshwaran (J. Comb. Theory A, 2020)

Hyperuniform and rigid stable matchings. - Michael Andreas Klatt; Günter Last; D. Yogeshwaran (Random Struct. Algorithms, 2020)

An analysis of probabilistic forwarding of coded packets on random geometric graphs. - B. R. Vinay Kumar; Navin Kashyap; D. Yogeshwaran (Perform. Evaluation, 2023)

Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees. - Günter Last; Giovanni Peccati; D. Yogeshwaran (Random Struct. Algorithms, 2023)

Advances in random topology. - Omer Bobrowski; D. Yogeshwaran (J. Appl. Comput. Topol., 2024)