p{margin: 2cm

Journal publications:

Structure and color in triangle-free graphs Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel Electronic Journal of Combinatorics 2021
Intersection dimension and graph invariants C.R.Subramanian Discuss. Math. Graph Theory 2021
Parameterized complexity of happy coloring problems Akanksha Agarwal, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy Theoretical Computer Science 2020
On polynomial kernelization of H-free edge deletion R.B.Sandeep, Naveen Sivadasan Algorithmica 2017
Dichotomy results on the hardness of H-free edge modification problems R.B.Sandeep, Naveen Sivadasan SIAM Journal of Discrete Mathematics 2017
The chromatic discrepancy of graphs Subrahmanyam Kalyanasundaram, R.B.Sandeep, Naveen Sivadasan Discrete Applied Mathematics 2015
Forbidden subgraph colorings and the oriented chromatic number C.R. Subramanian European Journal of Combinatorics 2013
Oriented colouring of some graph products N.Narayanan, C.R.Subramanian Discussiones Mathematicae Graph Theory 2011
Bounding $\chi$ in terms of $\omega$ and $\Delta$ for some classes of graphs T.Karthick, C.R.Subramanian Discrete Mathematics 2011
Bounds on vertex colorings with restrictions on the union of color classes C.R.Subramanian Journal of Graph Theory 2011
Bounds on edge colorings with restrictions on the union of color classes C.R.Subramanian SIAM Journal on Discrete Mathematics 2010

Conference publications:

  1. Planar projections of graphs (with Udit Maniyar), CALDAM 2020
  2. H-free coloring on graphs with bounded treewidth (with Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare), CALDAM 2020
  3. Linear time algorithms for happy vertex coloring problems for trees (with Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare) , IWOCA 2016, pages 281-292.
  4. On structural parameterizations of the matching cut problem (with Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare), COCOA 2017
  5. Parameterized Lower bounds and dichotomy results for the NP-completeness of H-free edge modification problems (wtih R.B. Sandeep and Naveen Sivadasan), LATIN 2016, pages 82-95.
  6. Parameterized lower bounds and NP-completeness of some H-free edge deletion problems (with R.B. Sandeep and Naveen Sivadasan), COCOA 2015, pages 424-438.
  7. On the Expressive Power of Read-Once Determinants (with Pushkar Joglekar), Foundations of Computation Theory 2015: 95-105
  8. On Polynomial Kernelization of H-free Edge Deletion (with R.B. Sandeep and Naveen Sivadasan), International Symposium on Paramterized and Exact Computation, 2014.
  9. Intersection Dimension and Maximum Degree (with C.R. Subramanian), Proceedings of LAGOS, Electronic Notes in Discrete Mathematics, Vol. 35, 2009
  10. Forbidden subgraph colorings and the oriented chromatic number (with C.R. Subramanian), 4th International Workshop on Combinatorial Algorithms, LNCS, Vol. 4393, 2009.