FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding. - Akanksha Agrawal 001; Pradeesha Ashok; Meghana M. Reddy; Saket Saurabh 001; Dolly Yadav (CoRR, 2019)

Minimum Conflict Free Colouring Parameterized by Treewidth. - Pradeesha Ashok; Rathin Bhargava; Naman Gupta; Mohammad Khalid; Dolly Yadav (CALDAM, 2020)

Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring. - Abidha V. P; Pradeesha Ashok; Avi Tomar; Dolly Yadav (CSR, 2022)

Structural parameterization for minimum conflict-free colouring. - Pradeesha Ashok; Rathin Bhargava; Naman Gupta; Mohammad Khalid; Dolly Yadav (Discret. Appl. Math., 2022)

Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring. - V. P. Abidha; Pradeesha Ashok; Avi Tomar; Dolly Yadav (CoRR, 2023)

Colouring a dominating set without conflicts: q-Subset Square Colouring. - V. P. Abidha; Pradeesha Ashok; Avi Tomar; Dolly Yadav (Theor. Comput. Sci., 2023)