The m-Ranking of nodes in complex networks. - K. Reji Kumar; Shibu Manuel; Deepu Benson (COMSNETS, 2017)

An improvement to Chvátal and Thomassen's upper bound for oriented diameter. - Jasine Babu; Deepu Benson; Deepak Rajendraprasad; Sai Nishant Vaka (Discret. Appl. Math., 2021)

Improved bounds for the oriented radius of mixed multigraphs. - Jasine Babu; Deepu Benson; Deepak Rajendraprasad (J. Graph Theory, 2023)

On Oriented Diameter of Power Graphs. - Deepu Benson; Bireswar Das; Dipan Dey; Jinia Ghosh (CoRR, 2024)

Sensitivity and Query Complexity Under Uncertainty. - Deepu Benson; Balagopal Komarath; Nikhil S. Mande; Nalli Sai Soumya; Jayalal Sarma; Karteek Sreenivasaiah (MFCS, 2025)

Hazard-free Decision Trees. - Deepu Benson; Balagopal Komarath; Jayalal Sarma; Nalli Sai Soumya (CoRR, 2025)