Browse by IISc Authors

Chakraborty, D and Chandran, LS and Padinhatteeri, S and Pillai, RR (2024) s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. In: Discrete Applied Mathematics, 345 (345). pp. 170-189.

Chandran, LS and Hashim, T and Jacob, D and Mathew, R and Rajendraprasad, D and Singh, N (2024) New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring. In: Discrete Mathematics, 347 (4).

Antony, D and Chandran, LS and Gayen, A and Gosavi, S and Jacob, S (2024) Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness. In: 16th Latin American Symposium on Theoretical Informatics, LATIN 2042, 18 March 2024through 22 March 2024, Puerto Varas, pp. 97-113.

Chakraborty, D and Chandran, LS and Padinhatteeri, S and Pillai, RR (2021) Algorithms and Complexity of s-Club Cluster Vertex Deletion. In: 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021, 5-7 Jul 2021, pp. 152-164.

Chandran, LS and Lahiri, A and Singh, N (2021) Improved approximation for maximum edge colouring problem. In: Discrete Applied Mathematics .

Babu, J and Chandran, LS and Francis, M and Prabhakaran, V and Rajendraprasad, D and Warrier, NJ (2021) On graphs whose eternal vertex cover number and vertex cover number coincide. In: Discrete Applied Mathematics .

Chandran, LS and Das, SK and Hell, P and Padinhatteeri, S and Pillai, RR (2021) Template-Driven Rainbow Coloring of Proper Interval Graphs. In: 7th International Conference on Algorithms and Discrete Applied Mathematics, 11-13 Feb 2021, Rupnagar, pp. 452-470.

Chandran, LS and Padinhatteeri, S and Ravi Shankar, K (2020) List Distinguishing Number of pth Power of Hypercube and Cartesian Powers of a Graph. In: 6th International Conference on Algorithms and Discrete Applied Mathematics, 13-15 FEB 2020, Hyderabad, pp. 235-247.

Babu, J and Chandran, LS and Francis, M and Prabhakaran, V and Rajendraprasad, D and Warrier, JN (2019) On graphs with minimal eternal vertex cover number. In: 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2019, 14 - 16 February 2019, Kharagpur, pp. 263-273.

Basavaraju, M and Chandran, LS and Karthick, T (2012) Maximum weight independent sets in hole- and dart-free graphs. In: Discrete Applied Mathematics, 160 (16-17). pp. 2364-2369.