| 2023 | CIAC | Dynamic Coloring on Restricted Graph Classes. | Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy |
| 2021 | IWOCA | Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. | Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy |
| 2020 | COMPLEXIS | Evolution of Physics Sub-fields. | Murali Krishna Enduri, I. Vinod Reddy, Shivakumar Jolad |
| 2019 | IWOCA | Parameterized Algorithms for Graph Burning Problem. | Anjeneya Swami Kare, I. Vinod Reddy |
| 2018 | WALCOM | On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity. | Jayesh Choudhari, I. Vinod Reddy |
| 2018 | WALCOM | On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. | Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy |
| 2017 | IWOCA | The Parameterized Complexity of Happy Colorings. | Neeldhara Misra, I. Vinod Reddy |
| 2016 | COCOON | Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three. | Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy |
| 2015 | WALCOM | Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. | Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy |