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

Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph. - Maumita Chakraborty; Sumon Chowdhury; Rajat Kumar Pal (IEEE Access, 2018)

Generation of Simple, Connected, Non-isomorphic Random Graphs. - Maumita Chakraborty; Sumon Chowdhury; 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)

Generation of all rooted trees up to a given height. - Sumit Chakraborty; Maumita Chakraborty; Rajat Kumar Pal (Innov. Syst. Softw. Eng., 2024)