A Cost-Optimal Algorithm for Guard Zone Problem. - Ranjan Mehera; Rajat Kumar Pal (ICDCN, 2009)

A 2D Guard Zone Computation Algorithm for Reassignment of Subcircuits to Minimize the Overall Chip Area. - Ranjan Mehera; Arpan Chakrabarty; Piyali Datta; Rajat Kumar Pal (ACSS (2), 2014)

An Algorithm to Solve 3D Guard Zone Computation Problem. - Ranjan Mehera; Piyali Datta; Arpan Chakraborty; Rajat Kumar Pal (ACSS (1), 2015)

A cost-optimal algorithm for guard zone computation including detection and exclusion of overlapping. - Ranjan Mehera; Arpan Chakraborty; Piyali Datta; Rajat Kumar Pal (VDAT, 2015)

A Divide-and-Conquer Algorithm for All Spanning Tree Generation. - Maumita Chakraborty; Ranjan Mehera; Rajat Kumar Pal (ACSS (1), 2016)

Bottleneck Crosstalk Minimization in Three-Layer Channel Routing. - Tarak Nath Mandal; Kaushik Dey; Ankita Dutta Banik; Ranjan Mehera; Rajat Kumar Pal (ACSS (1), 2019)

Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph. - Maumita Chakraborty; Ranjan Mehera; Rajat Kumar Pal (Theor. Comput. Sci., 2022)

Brain Tumour Segmentation Using S-Net and SA-Net. - Sunita Roy; Rikan Saha; Suvarthi Sarkar; Ranjan Mehera; Rajat Kumar Pal; Samir Kumar Bandyopadhyay (IEEE Access, 2023)

Bottleneck Crosstalk Minimization in Two- and Three-Layer Manhattan Channel Routing. - Tarak Nath Mandal; Suvarthi Sarkar; Deborupa Roy; Abhinandan Khan; Ranjan Mehera; Alak Kumar Datta; Rajat Kumar Pal (IEEE Access, 2024)