Deepu Benson

According to our database, Deepu Benson authored at least 6 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Hazard-free Decision Trees.

Deepu Benson, Balagopal Komarath, Jayalal Sarma, Nalli Sai Soumya

CoRR, January, 2025

Sensitivity and Query Complexity Under Uncertainty.

Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024

On Oriented Diameter of Power Graphs.

Deepu Benson, Bireswar Das, Dipan Dey, Jinia Ghosh

CoRR, 2024

2023

Improved bounds for the oriented radius of mixed multigraphs.

Jasine Babu, Deepu Benson, Deepak Rajendraprasad

J. Graph Theory, August, 2023

2020

An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter.

Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka

Proceedings of the Computer Science - Theory and Applications, 2020

2017

The m-Ranking of nodes in complex networks.

K. Reji Kumar, Shibu Manuel, Deepu Benson

Proceedings of the 9th International Conference on Communication Systems and Networks, 2017