Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs. - B. S. Panda 001; Shaily Verma (ICTCSDM, 2016)

On partial Grundy coloring of bipartite graphs and chordal graphs. - B. S. Panda 001; Shaily Verma (Discret. Appl. Math., 2019)

On the total and AVD-total coloring of graphs. - B. S. Panda 001; Shaily Verma; Yash Keerti (AKCE Int. J. Graphs Comb., 2020)

Grundy coloring in some subclasses of bipartite graphs and their complements. - Shaily Verma; B. S. Panda 001 (Inf. Process. Lett., 2020)

A Polynomial Kernel for Bipartite Permutation Vertex Deletion. - Lawqueen Kanesh; Jayakrishnan Madathil; Abhishek Sahu; Saket Saurabh 001; Shaily Verma (IPEC, 2021)

List Homomorphism: Beyond the Known Boundaries. - Sriram Bhyravarapu; Satyabrata Jana; Fahad Panolan; Saket Saurabh 001; Shaily Verma (LATIN, 2022)

An Exact Algorithm for Knot-Free Vertex Deletion. - M. S. Ramanujan 001; Abhishek Sahu; Saket Saurabh 001; Shaily Verma (MFCS, 2022)

A Polynomial Kernel for Bipartite Permutation Vertex Deletion. - Jan Derbisz; Lawqueen Kanesh; Jayakrishnan Madathil; Abhishek Sahu; Saket Saurabh 001; Shaily Verma (Algorithmica, 2022)

Adjacent vertex distinguishing total coloring in split graphs. - Shaily Verma; Hung-Lin Fu; B. S. Panda 001 (Discret. Math., 2022)

Parameterized Algorithms for Eccentricity Shortest Path Problem. - Sriram Bhyravarapu; Satyabrata Jana; Lawqueen Kanesh; Saket Saurabh 001; Shaily Verma (IWOCA, 2023)

Vertex-edge domination in interval and bipartite permutation graphs. - Subhabrata Paul; Dinabandhu Pradhan; Shaily Verma (Discuss. Math. Graph Theory, 2023)

Parameterized Complexity of Paired Domination. - Nikita Andreev; Ivan Bliznets; Madhumita Kundu; Saket Saurabh 001; Vikash Tripathi; Shaily Verma (IWOCA, 2024)

Adjacent vertex distinguishing total coloring of the corona product of graphs. - Shaily Verma; Bhawani Sankar Panda (Discuss. Math. Graph Theory, 2024)

Partitioning subclasses of chordal graphs with few deletions. - Satyabrata Jana; Souvik Saha 002; Abhishek Sahu; Saket Saurabh 001; Shaily Verma (Theor. Comput. Sci., 2024)

Parameterized Saga of First-Fit and Last-Fit Coloring. - Akanksha Agrawal 001; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Shaily Verma (STACS, 2025)

Burn and win. - Pradeesha Ashok; Sayani Das; Lawqueen Kanesh; Saket Saurabh 001; Avi Tomar; Shaily Verma (Theor. Comput. Sci., 2025)

A Parameterized Study of Secluded Structures in Directed Graphs. - Nadym Mallek; Jonas Schmidt 002; Shaily Verma (CoRR, 2025)

Connected Partitions via Connected Dominating Sets. - Aikaterini Niklanovits; Kirill Simonov; Shaily Verma; Ziena Zeif (CoRR, 2025)