13 citations · 52 across the 53 of their papers we have counts for
5 papers · 1 filter
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen +2
Domination and coloring are two classic problems in graph theory. The major focus of this paper is the CD-COLORING problem which combines the flavours of domination and colouring.…
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri +1
In this paper, we study the computational complexity of \textsc{-Club Cluster Vertex Deletion}. Given a graph, \textsc{-Club Cluster Vertex Deletion (-CVD)} aims to delete…
Spanning Tree Congestion and Computation of Generalized Győri-Lovász Partition
L. Sunil Chandran, Yun Kuen Cheung, Davis Issac
We study a natural problem in graph sparsification, the Spanning Tree Congestion (\STC) problem. Informally, the \STC problem seeks a spanning tree with no tree-edge \emph{routing}…
Algorithms and Bounds for Very Strong Rainbow Coloring
L. Sunil Chandran, Anita Das, Davis Issac +1
A well-studied coloring problem is to assign colors to the edges of a graph so that, for every pair of vertices, all edges of at least one shortest path between them receive di…
Parameterized and Approximation Algorithms for Boxicity
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Boxicity of a graph , denoted by , is the minimum integer such that can be represented as the intersection graph of axis parallel boxes in …