L. Sunil Chandran
L. Sunil Chandran
Professor of Computer Science and Automation, Indian Institute of Science, Bangalore, India.
Verified email at iisc.ac.in - Homepage
Title
Cited by
Cited by
Year
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
862012
Boxicity and treewidth
LS Chandran, N Sivadasan
Journal of Combinatorial Theory, Series B 97 (5), 733-744, 2007
692007
Rainbow connection number and radius
M Basavaraju, LS Chandran, D Rajendraprasad, A Ramaswamy
Graphs and Combinatorics 30 (2), 275-285, 2014
592014
Refined memorization for vertex cover
LS Chandran, F Grandoni
Information Processing Letters 93 (3), 125-131, 2005
592005
Acyclic edge coloring of graphs with maximum degree 4
M Basavaraju, LS Chandran
Journal of Graph Theory 61 (3), 192-209, 2009
462009
Boxicity and maximum degree
LS Chandran, MC Francis, N Sivadasan
Journal of Combinatorial Theory, Series B 98 (2), 443-445, 2008
432008
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
432003
Acyclic edge coloring of subcubic graphs
M Basavaraju, LS Chandran
Discrete Mathematics 308 (24), 6650-6653, 2008
422008
The treewidth and pathwidth of hypercubes
LS Chandran, T Kavitha
Discrete Mathematics 306 (3), 359-365, 2006
382006
A high girth graph construction
LS Chandran
SIAM journal on Discrete Mathematics 16 (3), 366-370, 2003
382003
Girth and treewidth
LS Chandran, CR Subramanian
Journal of combinatorial theory, Series B 93 (1), 23-32, 2005
372005
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
362011
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
292007
Boxicity and poset dimension
A Adiga, D Bhowmick, LS Chandran
SIAM Journal on Discrete Mathematics 25 (4), 1687-1698, 2011
282011
Rainbow connection number of graph power and graph products
M Basavaraju, LS Chandran, D Rajendraprasad, A Ramaswamy
Graphs and Combinatorics 30 (6), 1363-1382, 2014
272014
Cubicity, boxicity, and vertex cover
LS Chandran, A Das, CD Shah
Discrete Mathematics 309 (8), 2488-2496, 2009
272009
Rainbow connection number and connectivity
X Li, S Liu, LS Chandran, R Mathew, D Rajendraprasad
the electronic journal of combinatorics, P20-P20, 2012
252012
Approximations for ATSP with parametrized triangle inequality
LS Chandran, LS Ram
Annual Symposium on Theoretical Aspects of Computer Science, 227-237, 2002
252002
On the relationship between ATSP and the cycle cover problem
LS Chandran, LS Ram
Theoretical Computer Science 370 (1-3), 218-228, 2007
242007
Geometric representation of graphs in low dimension using axis parallel boxes
LS Chandran, MC Francis, N Sivadasan
Algorithmica 56 (2), 129, 2010
232010
The system can't perform the operation now. Try again later.
Articles 1–20