Novel Deterministic Heuristics for Building Minimum Spanning Trees with Constrained Diameter. - C. Patvardhan 001; Prem Prakash Vuppuluri (PReMI, 2009)

Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem. - C. Patvardhan 001; Prem Prakash Vuppuluri; Anand Srivastav (Int. J. Math. Oper. Res., 2012)

Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. - C. Patvardhan 001; Prem Prakash Vuppuluri; Anand Srivastav (Informatica (Slovenia), 2015)

Animal-Vehicle Collision Mitigation Using Deep Learning in Driver Assistance Systems. - Mudit Goswami; Prem Prakash Vuppuluri; Dhruv Goswami (ICACDS (1), 2019)

A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem. - Prem Prakash Vuppuluri; C. Patvardhan 001; Anand Srivastav (Eng. Appl. Artif. Intell., 2020)

Novel Heuristics for the Euclidean Leaf-Constrained Minimum Spanning Tree Problem. - Prem Prakash Vuppuluri; C. Patvardhan 001 (SN Comput. Sci., 2020)

Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem. - Prem Prakash Vuppuluri; Chellapilla Patvardhan (Expert Syst. J. Knowl. Eng., 2021)

Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities. - Marcelo Rodrigues de Holanda Maia; Miguel Reula; Consuelo Parreño-Torres; Prem Prakash Vuppuluri; Alexandre Plastino 001; Uéverton S. Souza; Sara Ceschia; Mario Pavone; Andrea Schaerf (Soft Comput., 2023)