Is Stochastic Ranking Really better than Feasibility Rules for Constraint Handling in Evolutionary Algorithms? - Sulabh Bansal; Ashish Mani; Chellapilla Patvardhan (NaBIC, 2009)

Solution of "Hard" Knapsack Instances Using Quantum Inspired Evolutionary Algorithm. - C. Patvardhan 001; Sulabh Bansal; Anand Srivastav (Int. J. Appl. Evol. Comput., 2014)

Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm. - Chellapilla Patvardhan; Sulabh Bansal; Anand Srivastav (J. Comput. Appl. Math., 2015)

Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems. - Chellapilla Patvardhan; Sulabh Bansal; Anand Srivastav (Memetic Comput., 2015)

Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems. - C. Patvardhan 001; Sulabh Bansal; Anand Srivastav (Swarm Evol. Comput., 2016)

Towards the right amount of randomness in quantum-inspired evolutionary algorithms. - Chellapilla Patvardhan; Sulabh Bansal; Anand Srivastav (Soft Comput., 2017)

An Improved Generalized Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem. - Sulabh Bansal; C. Patvardhan 001 (Int. J. Appl. Evol. Comput., 2018)

A Generalized Parallel Quantum Inspired Evolutionary Algorithm Framework for Hard Subset Selection Problems: A GPQIEA for Subset Selection. - Sulabh Bansal; C. Patvardhan 001 (Int. J. Appl. Evol. Comput., 2019)

Red deer algorithm to detect the secret key of the monoalphabetic cryptosystem. - Ashish Jain; Sulabh Bansal; Nripendra Narayan Das; Shyam Sunder Gupta (Soft Comput., 2024)