Journals

  1. Further parameterized results on weak Grundy coloring. Theoretical Computer Science 2025.
    with D Karthika, R Muthucumaraswamy, Satyabrata Jana, Saket Saurabh
  2. Dynamic Coloring on Restricted Graph Classes. Theoretical Computer Science 2025.
    with Swati Kumari and I. Vinod Reddy
  3. Extremal Results on Conflict-free Coloring. Journal of Graph Theory 2025.
    with Shiwali Gupta, Subrahmanyam Kalyanasundaram and Rogers Mathew
  4. Conflict-free Coloring on Subclasses of Perfect graphs and Bipartite graphs. Theoretical Computer Science 2025.
    with Subrahmanyam Kalyanasundaram and Rogers Mathew
  5. On Locally Identifying Coloring of Cartesian product and Tensor product of Graphs. Discrete Applied Mathematics 2024.
    with Swati Kumari and I. Vinod Reddy
  6. Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. Algorithmica 2024.
    with Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram and I. Vinod Reddy
  7. A Tight Bound for Conflict-free Coloring in terms of Distance to Cluster. Discrete Mathematics 2022.
    with Subrahmanyam Kalyanasundaram.
  8. Conflict-Free Coloring Bounds on Open Neighborhoods.Algorithmica 2022.
    with Subrahmanyam Kalyanasundaram and Rogers Mathew.
  9. A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs.Journal of Graph Theory 2021.
    with Subrahmanyam Kalyanasundaram and Rogers Mathew.
  10. On the Tractability of (k,i)-coloring. Discrete Applied Mathematics 2021.
    with Saurabh Joshi, Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare.

Conferences

  1. Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components. MFCS 2025.
    with Pritesh Kumar, Madhumita Kundu, Shivesh K. Roy, Sahiba, and Saket Saurabh.
  2. Parameterized Algorithms for Power Edge Set and Zero Forcing Set. IWOCA 2025.
    with Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov and Saket Saurabh.
  3. Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT. WG 2025.
    with Shashanka Kulamarva, Pritesh Kumar, Shivesh K. Roy and Saket Saurabh.
  4. Chromatic Index under Parameterized Settings. WG 2025.
    with Soumen Mandal, Ashutosh Rai, Saket Saurabh and Shaily Verma.
  5. On the Structural Parameterized Complexity of Defective Coloring. SOFSEM 2025.
    with Pankaj Kumar and Saket Saurabh.
  6. On the Complexity of Minimum Membership Dominating Set. SOFSEM 2025.
    with Karthika Dhayanchand, Muthucumaraswamy Rajamanickam, Saket Saurabh, Sanjay Seetharaman and Matthias Bentert.
  7. Polynomial time algorithms for Hop domination. CALDAM 2025.
    with Karthika D, Muthucumaraswamy R and Pritesh Kumar.
  8. On the parameterized Complexity of Odd Coloring. CALDAM 2025.
    with Vinod Reddy and Swati Kumari.
  9. On the Parameterized Complexity of Minus Domination. SOFSEM 2024.
    with Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan and Saket Saurabh
  10. Difference Determines the Degree: Structural Kernelizations of COC. IPEC 2023.
    with Satyabrata Jana, Saket Saurabh and Roohani Sharma.
  11. Parameterized algorithms for Eccentricity Shortest Path Problem. IWOCA 2023.
    with Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh and Shaily Verma.
  12. Dynamic Coloring on Restricted Graph Classes. CIAC 2023.
    with Swati Kumari and I. Vinod Reddy.
  13. On Structural Parameterizations of Star Coloring. CALDAM 2023.
    with I. Vinod Reddy.
  14. On Locally Identifying Coloring of Graphs.CALDAM 2023.
    with Swati Kumari and I. Vinod Reddy.
  15. List Homomorphism: Beyond the Known Boundaries. LATIN 2022.
    with Satyabrata Jana, Fahad Panolan, Saket Saurabh and Shaily Verma.
  16. Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. MFCS 2022.
    with Subrahmanyam Kalyanasundaram and Rogers Mathew.
  17. Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. IWOCA 2021.
    with Tim A. Hartmann, Subrahmanyam Kalyanasundaram and I. Vinod Reddy.
  18. Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods. WG 2020.
    with Subrahmanyam Kalyanasundaram.
  19. On the Tractability of (k,i)-coloring. CALDAM 2018.
    with Saurabh Joshi, Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare.
  20. Concom Sorting. ICCSNT 2015.
    with Anand Agrawal.