Journals

  1. Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs.
    with Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram and I. Vinod Reddy
    Algorithmica 2024 (accepted).
  2. A Tight Bound for Conflict-free Coloring in terms of Distance to Cluster.
    with Subrahmanyam Kalyanasundaram.
    Discrete Mathematics 2022.
  3. Conflict-Free Coloring Bounds on Open Neighborhoods.
    with Subrahmanyam Kalyanasundaram and Rogers Mathew.
    Algorithmica 2022.
  4. A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs.
    with Subrahmanyam Kalyanasundaram and Rogers Mathew.
    Journal of Graph Theory 2021.
  5. On the Tractability of (k,i)-coloring.
    with Saurabh Joshi, Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare.
    Discrete Applied Mathematics 2021.

Conferences

  1. On the Parameterized Complexity of Minus Domination.
    with Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan and Saket Saurabh
    SOFSEM 2024.
  2. Difference Determines the Degree: Structural Kernelizations of COC.
    with Satyabrata Jana, Saket Saurabh and Roohani Sharma.
    IPEC 2023.
  3. Parameterized algorithms for Eccentricity Shortest Path Problem.
    with Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh and Shaily Verma.
    IWOCA 2023.
  4. Dynamic Coloring on Restricted Graph Classes.
    with Swati Kumari and I. Vinod Reddy.
    CIAC 2023.
  5. On Structural Parameterizations of Star Coloring.
    with I. Vinod Reddy.
    CALDAM 2023.
  6. On Locally Identifying Coloring of Graphs.
    with Swati Kumari and I. Vinod Reddy.
    CALDAM 2023.
  7. List Homomorphism: Beyond the Known Boundaries.
    with Satyabrata Jana, Fahad Panolan, Saket Saurabh and Shaily Verma.
    LATIN 2022.
  8. Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs.
    with Subrahmanyam Kalyanasundaram and Rogers Mathew.
    MFCS 2022.
  9. Conflict-Free Coloring of Star-Free Graphs on Open Neighborhoods.
    with Subrahmanyam Kalyanasundaram and Rogers Mathew.
  10. Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs.
    with Tim A. Hartmann, Subrahmanyam Kalyanasundaram and I. Vinod Reddy.
    IWOCA 2021.
  11. Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods.
    with Subrahmanyam Kalyanasundaram.
    WG 2020.
  12. On the Tractability of (k,i)-coloring.
    with Saurabh Joshi, Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare.
    CALDAM 2018.
  13. Concom Sorting.
    with Anand Agrawal.
    ICCSNT 2015.