Get started
Author

L. Sunil Chandran

Observed names: Chandran, L Sunil, Chandran, L. Sunil, Chandran, Sunil, L. S. Chandran, L. Sunil Ch, L.S. Chandran, L.Sunil Chandran
Observed institutions: Max Planck Society, Nankai University, Birla Institute of Technology and Science - Hyderabad Campus, Max Planck Institute for Informatics, Indian Institute of Science Bangalore, Birla Institute of Technology and Science, Pilani
ORCID: 0000-0001-5451-6975
Observed ORCID: 0000-0001-5451-6975
OpenAlex ID: A5024359075
Rainbow connection number and connected dominating sets
2011 · L. Sunil Chandran, Anita Das, et al. · Journal of Graph Theory · 103
PDF
Boxicity and treewidth
2007 · L. Sunil Chandran, Naveen Sivadasan · Journal of Combinatorial Theory Series B · 74
PDF
Refined memorization for vertex cover
2004 · L. Sunil Chandran, Fabrizio Grandoni · Information Processing Letters · 63
Boxicity and maximum degree
2007 · L. Sunil Chandran, Mathew C. Francis, et al. · Journal of Combinatorial Theory Series B · 51
PDF
Acyclic Edge-Coloring of Planar Graphs
2011 · Manu Basavaraju, L. Sunil Chandran, et al. · SIAM Journal on Discrete Mathematics · 50
PDF
Rainbow Connection Number and Radius
2012 · Manu Basavaraju, L. Sunil Chandran, et al. · Graphs and Combinatorics · 45
Acyclic edge coloring of subcubic graphs
2008 · Manu Basavaraju, L. Sunil Chandran · Discrete Mathematics · 44
Boxicity and Poset Dimension
2011 · Abhijin Adiga, Diptendu Bhowmick, et al. · SIAM Journal on Discrete Mathematics · 40
The treewidth and pathwidth of hypercubes
2006 · L. Sunil Chandran, T. Kavitha · Discrete Mathematics · 40
PDF
Acyclic edge coloring of graphs with maximum degree 4
2009 · Manu Basavaraju, L. Sunil Chandran · Journal of Graph Theory · 39
PDF
Rainbow Connection Number and Connectivity
2012 · Xueliang Li, Sujuan Liu, et al. · The Electronic Journal of Combinatorics · 35
PDF
Girth and treewidth
2005 · L.Sunil Chandran, C.R. Subramanian · Journal of Combinatorial Theory Series B · 33
Generating and characterizing the perfect elimination orderings of a chordal graph
2003 · L.S. Chandran, L. Ibarra, et al. · Theoretical Computer Science · 32
PDF
A High Girth Graph Construction
2003 · L. Sunil Chandran · SIAM Journal on Discrete Mathematics · 29
On the relationship between ATSP and the cycle cover problem
2006 · L. Sunil Chandran, L. Shankar Ram · Theoretical Computer Science · 28
PDF
On the Parameterized Complexity of Biclique Cover and Partition
2017 · Chandran, Sunil, Issac, Davis, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 26
PDF
Rainbow Connection Number of Graph Power and Graph Products
2013 · Manu Basavaraju, L. Sunil Chandran, et al. · Graphs and Combinatorics · 26
Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes
2008 · L. Sunil Chandran, Mathew C. Francis, et al. · Algorithmica · 26
Acyclic edge coloring of 2‐degenerate graphs
2010 · Manu Basavaraju, L. Sunil Chandran · Journal of Graph Theory · 25
Cubicity, boxicity, and vertex cover
2008 · L. Sunil Chandran, Anita Das, et al. · Discrete Mathematics · 25
PDF
Rainbow Colouring of Split and Threshold Graphs
2012 · L. Sunil Ch, Deepak Rajendraprasad · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · 23
A spectral lower bound for the treewidth of a graph and its consequences
2003 · L.Sunil Chandran, C.R. Subramanian · Information Processing Letters · 23
Boxicity of line graphs
2011 · L. Sunil Chandran, Rogers Mathew, et al. · Discrete Mathematics · 20
PDF
Chordal Bipartite Graphs with High Boxicity
2011 · L. Sunil Chandran, Mathew C. Francis, et al. · Graphs and Combinatorics · 18
PDF
An upper bound for Cubicity in terms of Boxicity
2008 · L. Sunil Chandran, K. Ashik Mathew · Discrete Mathematics · 18
PDF
Works count: 194
Citation count: 1,559
H-index: 22
I10-index: 51
Year
Topic
Type