| Rainbow connection number and connected dominating sets L Sunil Chandran, A Das, D Rajendraprasad, NM Varma Journal of Graph Theory 71 (2), 206-218, 2012 | 106 | 2012 |
| Boxicity and treewidth LS Chandran, N Sivadasan Journal of Combinatorial Theory, Series B 97 (5), 733-744, 2007 | 85 | 2007 |
| Refined memorization for vertex cover LS Chandran, F Grandoni Information Processing Letters 93 (3), 125-131, 2005 | 68 | 2005 |
| Rainbow connection number and radius M Basavaraju, LS Chandran, D Rajendraprasad, A Ramaswamy Graphs and Combinatorics 30, 275-285, 2014 | 66 | 2014 |
| The stable set problem and the thinness of a graph C Mannino, G Oriolo, F Ricci, S Chandran Operations Research Letters 35 (1), 1-9, 2007 | 56 | 2007 |
| The treewidth and pathwidth of hypercubes LS Chandran, T Kavitha Discrete Mathematics 306 (3), 359-365, 2006 | 56 | 2006 |
| Girth and treewidth LS Chandran, CR Subramanian Journal of combinatorial theory, Series B 93 (1), 23-32, 2005 | 53 | 2005 |
| Generating and characterizing the perfect elimination orderings of a chordal graph LS Chandran, L Ibarra, F Ruskey, J Sawada Theoretical Computer Science 307 (2), 303-317, 2003 | 53 | 2003 |
| Boxicity and maximum degree LS Chandran, MC Francis, N Sivadasan Journal of Combinatorial Theory, Series B 98 (2), 443-445, 2008 | 52 | 2008 |
| Acyclic edge coloring of graphs with maximum degree 4 M Basavaraju, LS Chandran Journal of Graph Theory 61 (3), 192-209, 2009 | 51 | 2009 |
| Acyclic edge coloring of subcubic graphs M Basavaraju, LS Chandran Discrete Mathematics 308 (24), 6650-6653, 2008 | 50 | 2008 |
| Acyclic edge-coloring of planar graphs M Basavaraju, LS Chandran, N Cohen, F Havet, T Müller SIAM Journal on Discrete Mathematics 25 (2), 463-478, 2011 | 49 | 2011 |
| A high girth graph construction LS Chandran SIAM journal on Discrete Mathematics 16 (3), 366-370, 2003 | 44 | 2003 |
| On the parameterized complexity of biclique cover and partition S Chandran, D Issac, A Karrenbauer 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017 | 40 | 2017 |
| Boxicity and poset dimension A Adiga, D Bhowmick, LS Chandran SIAM Journal on Discrete Mathematics 25 (4), 1687-1698, 2011 | 39 | 2011 |
| Rainbow connection number of graph power and graph products M Basavaraju, LS Chandran, D Rajendraprasad, A Ramaswamy Graphs and Combinatorics 30, 1363-1382, 2014 | 36 | 2014 |
| Geometric representation of graphs in low dimension using axis parallel boxes LS Chandran, MC Francis, N Sivadasan Algorithmica 56, 129-140, 2010 | 33 | 2010 |
| Rainbow connection number and connectivity X Li, S Liu, LS Chandran, R Mathew, D Rajendraprasad the electronic journal of combinatorics, P20-P20, 2012 | 32 | 2012 |
| A spectral lower bound for the treewidth of a graph and its consequences LS Chandran, CR Subramanian Information Processing Letters 87 (4), 195-200, 2003 | 31 | 2003 |
| Cubicity, boxicity, and vertex cover LS Chandran, A Das, CD Shah Discrete Mathematics 309 (8), 2488-2496, 2009 | 29 | 2009 |
Deepak RajendraprasadIndian Institute of Technology PalakkadDirección de correo verificada de iitpkd.ac.in
