Browse by Author

Conference Proceedings

Bharadwaj, BVS and Chandran, LS and Das, Anita (2008) Isoperimetric Problem and Meta-fibonacci Sequences. In: 14th Annual International Conference on Computing and Combinatorics (COCOON 2008), JUN 27-29, 2008, Dalian.

Conference Paper

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 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.

Chandran, LS (2001) Edge connectivity vs vertex connectivity in chordal graphs. In: of 7th Annual International Computing and Combinatorics Conference (COCOON'01), 20-23 Aug. 2001, Guilin, China, pp. 384-389.

Chandran, LS (2001) A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph. In: 7th Annual International Computing and Combinatorics Conference,COCOON'01 (Lecture Notes in Computer Science), 20-23 Aug 2001, Guilin, China, pp. 308-317.

Journal Article

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).

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 .

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.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Mathew, KA (2009) An upper bound for Cubicity in terms of Boxicity. In: Discrete Mathematics, 309 (8). pp. 2571-2574.

Chandran, LS and Das, Anita and Shah, CD (2009) Cubicity, boxicity, and vertex cover. In: Discrete Mathematics, 309 (8). pp. 2488-2496.

Narayanaswamy, NS and Belkale, N and Chandran, LS and Sivadasan, N (2007) A note on the Hadwiger number of circular arc graphs. In: Information Processing Letters, 104 (1). pp. 10-13.

Chandran, LS and Sivadasan, N (2007) Boxicity and treewidth. In: Journal of Combinatorial Theory, Series B, 97 (5). pp. 733-744.

Chandran, LS and Ibarra, L and Ruskey, F and Sawada, J (2003) Generating and characterizing the perfect elimination orderings of a chordal graph. In: Theoretical Computer Science, 307 (2). pp. 303-317.