
Journal papers

A High Girth Graph Construction.
L. Sunil Chandran.
SIAM Journal on Discrete Mathematics, vol 16, no.3, 2003, page 366370.

Generating and Characterizing the perfect elimination orderings of a chordal
graph. L. Sunil Chandran, L. Ibarra, F. Ruskey, J. Sawada.
Theoretical Computer Science, vol 307, no.2, 2003, page 303317.

A lower bound for the hitting set size for combinatorial rectangles and an
application.
L. Sunil Chandran,
Information Processing Letters, vol 86, no. 2, April 2003, page 7578.

A spectral lower bound for the treewidth of a graph and its consequences.
L. Sunil Chandran, C. R. Subramanian,
Information Processing Letters, vol 87, no. 4, August 2003, page 195200.

Minimum cuts, girth and a spectral threshold .
L. Sunil Chandran,
Information processing Letters, vol 89, no. 3, February 2004, page 105110.

On the number of minimum cuts in a graph.
L. Sunil Chandran, L. Shankar Ram.
SIAM Journal on Discrete mathematics, vol 18, no. 1, 2004, page 177194.

Girth and Treewidth.
L. Sunil Chandran, C. R. Subramanian
Journal of Combinatorial Theory, Series.B,
vol 93, no. 1, 2004, page 2332.

Refined Memorization for Vertex Cover.
L. Sunil Chandran, F. Grandoni.
Information Processing Letters, vol 93, no. 3, 2005, pages 123131.

A linear time algorithm to list the minimal separators of chordal graphs.
L. Sunil Chandran, F. Grandoni,
Discrete Mathematics, vol 306 , no. 3 , February 2006 ,pages 351358.

The treewidth and pathwidth of hypercubes.
L. Sunil Chandran, T. Kavitha,
Discrete Mathematics, vol 306, no. 3 , February 2006, pages 359365.

On the cubicity of certain graphs.
L. Sunil Chandran, C. Mannino, G. Oriolo,
Information Processing Letters, vol 94, no. 3, 2005, pages 113118.

Graphs of Low chordality.
L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian,
Discrete Mathematics and Theoretical Computer Science,
vol 7, no. 1,
2005, pages 2536.

The carving width of hypercubes.
L. Sunil Chandran, T. Kavitha,
Discrete Mathematics, vol. 306, no.18, 2006 pages: 22702274.

On the Hadwiger's conjecture for graph products.
L. Sunil Chandran, Naveen Sivadasan,
Discrete mathematics, 307(2), 2007, pages 266273.

The independent set problem and the thinness of a graph.
C. Mannino, G. Oriolo, F. Ricci, L. Sunil Chandran,
Operations research
letters,
vol. 35, no.1, 2007, pages: 19.

The Boxicity of Series Parallel graphs.
Ankur Bohra, L. Sunil Chandran, J. Krishnam Raju,
Discrete Mathematics, vol. 306, no.18, 2006, pages: 22192221.

Boxicity and Treewidth.
L. Sunil Chandran, Naveen Sivadasan,
Journal of Combinatorial Theory Series B,
vol.97, no.5, 2007, pages: 733744.

On the relationship between ATSP and the cycle cover problem.
L. Sunil Chandran, L. Shankar Ram,
Theoretical Computer Science, 370(13), 2007, pages 218228.

A Note on the Hadwiger Number of Circular Arc Graphs.
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chandran, Naveen Sivadasan,
Information Processing Letters,
vol. 104, no.1, 2007: pages 1013.

Boxicity and Maximum degree.
L. Sunil Chandran, Mathew Francis, Naveen Sivadasan,
Journal of Combinatorial Theory, Series B, vol 98, no 2, 2008, pages 443445.

On the arrangement of cliques in chordal graph with respect to
its cuts.
L. Sunil Chandran, N. S. Narayanaswamy,
Ars Combinatorica, Volume 92, 2009, Pages: 1119

The Cubicity of Hypercube graphs.
L. Sunil Chandran, Naveen Sivadasan,
Discrete Mathematics,
Volume 308, Issue 23, 6 December 2008,
Pages 57955800.

Acyclic edge coloring of subcubic graphs.
Manu Basavaraju, L. Sunil Chandran,
Discrete Mathematics, Volume 308, Issue 24, 28 December 2008, Pages 66506653.

Bounds on isoperimetric values of trees.
B.V. Subramanya Bharadwaj and L. Sunil Chandran,
Discrete Mathematics, Volume 309, Issue 4, pages 834842, March 2009.

An Upper Bound for Cubicity in terms of Boxicity.
L. Sunil Chandran, Ashik Mathew,
Discrete Mathematics, Volume 309, Issue 8, pages 25712574, April 2009.

Geometric representation of graphs in low dimension
using axis parallel boxes.
L. Sunil Chandran, Mathew C. Francis,
Naveen Sivadasan,
Algorithmica, Volume 56, Issue 2 (2010), Page 129140.

Hadwiger number and the cartesian product operation on graphs.
L. Sunil Chandran, Alexandr Kostochka, J. Krishnam Raju,
Graphs and Combinatorics, Volume 24 , Issue 4 (September 2008),
pages 291301.

Hadwiger's conjecture for proper circular arc graphs.
Naveen Belkale, L. Sunil Chandran,
European Journal of Combinatorics, 30 (4) pages: 946956, 2009.

Boxicity of Halin Graphs.
L. Sunil Chandran, Mathew C Francis, Santhosh Suresh,
Discrete Mathematics, 309 (10), pages 32333237, 2009.

Cubicity, Boxicity and Vertex Cover.
L. Sunil Chandran, Anita Das, Chintan Shah,
Discrete Mathematics, 309 (8) pages: 24882496, 2009.

Acyclic Edge Coloring of Graphs with Maximum Degree 4.
Manu Basavaraju, L. Sunil Chandran,
Journal of Graph Theory, Vol. 61, Issue. 3, pages: 192–209, 2009.

On the Cubicity of Interval Graphs.
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan,
Graphs and Combinatorics, vol. 25, pages 169179, 2009.

On the Structure of Contractible Edges in kconnected Partial ktrees.
N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran,
Graphs and Combinatorics. 25(4): 557569 (2009).

On the cubicity of bipartite graphs.
L. Sunil Chandran, Anita Das, Naveen Sivadasan,
Information Processing Letters, Volume 109, Issue 9, pages 432435, April 2009.

A Note on the Acyclic Edge Coloring of Complete
Bipartite Graphs.
Manu Basavaraju, L. Sunil Chandran,
Discrete Mathematics, 309 (13), pages 46464648,2009.

$d$Regular graphs of acyclic chromatic index at least $d+2$.
Manu Basavaraju, L. Sunil Chandran, Manoj Kummini,
Journal of Graph Theory, DOI: 10.1002/jgt.20559,
available online from 16 Dec 2010.

The cubicity of Interval graphs and the claw number.
Abhijin Adiga, L. Sunil Chandran,
Journal of Graph TheoryVol. 65, Issue 4, pages: 323–333, 2010.

Boxicity and Cubicity of ATfree graphs
Diptendu Bhowmick, L. Sunil Chandran,
Discrete Mathematics Volume 310, Issues 1011, 2010, Pages
15361543.

Hardness of approximating the threshold dimension,
boxicity, cubicity of a graph.
Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran.
Discrete Applied Mathematics, Volume 158, Issue 16, 28 August 2010, Pages 17191726.

Boxicity of Leaf Powers.
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew.
Graphs and Combinatorics, Volume 27, Issue 1 (2011), Page 61.

Boxicity of Chordal Bipartite Graphs
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew,
Graphs and Combinatorics, 27(3): 353362 (2011).

Acyclic Edge Colorings of 2degenerate Graphs.
Manu Basavaraju, L. Sunil Chandran.
Journal of Graph Theory, 69(1): 127 (2012)

Boxicity of Circular Arc Graphs.
Diptendu Bhowmick, L. Sunil Chandran.
Graphs and Combinatorics, 27(6): 769783 (2011)

Boxicity of Line Graphs
L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan.
Discrete Mathematics, 311(21): 23592367 (2011)

Acyclic EdgeColouring of Planar Graphs
Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Fr\'ed\'eric Havet, Tobias M\"uller,
SIAM Journal on Discrete Mathematics 25(2): 463478 (2011)
(The result of this paper was achieved indenpendly by two different teams,
first consisting of the first two authors, and the second consisting of the
remaining 3 authors and was combined later based on the advice of the editors.)

Boxicity and Poset Dimension
Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran.
SIAM Journal on Discrete Mathematics Available online, DOI: 10.1137/100786290

Rainbow Connection Number and Connected Dominating Sets
L. Sunil Chandran, Anita Das, Deepak Rajendraprasad and Nithin M.
Varma, Journal of Graph Theory, available online
DOI: 10.1002/jgt.20643

Acyclic Edge Coloring of Triangle Free Planar Graphs
Manu Basavaraju, L. Sunil Chandran.
Journal of Graph Theory , available online: DOI: 10.1002/jgt.20651

Cubicity and Bandwidth
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan.
Graphs and Combinatorics, 29(1): 4569 (2013)

Rainbow Connection Number and Connectivity
Xueliang Li, Sujuan Liu, L. Sunil Chandran, Rogers Mathew,
Deepak Rajendraprasad.
Electronic Journal of Combinatorics , volume 19, 2012.

On the SIGdimension of trees under $L_\infty$ metric
L. Sunil Chandran, Rajesh Chitnis, Ramanjit Kumar.
Graphs and Combinatorics

Maximum Weight Independent Sets in Hole and DartFree Graphs
Manu Basavaraju, L. Sunil Chandran, Thiagarajan Karthick.
To appear in Discrete Applied Mathematics

Rainbow Connection Number and Radius
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy.
To appear in Graphs and Combinatorics

Rainbow Connection Number of Graph Power and Graph Products
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendra Prasad,
Arunselvan Ramaswamy.
Accepted in Graphs and Combinatorics.

Bipartite Powers of kchordal Graphs
L. Sunil Chandran, Rogers Mathew. Discrete Mathematics and Theoretical
Computer Science, Vol 15, No. 2, (2013).

Cubicity, Degeneracy and Crossing Number
Abhijin Adiga, L. Sunil Chandran, Rogers Mathew, To appear in European Journal of
Combinatorics (available online https://dx.doi.org/10.1016/j.ejc.2013.06.021)

Lower Bounds for Boxicity.
Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan Accepted in Combinatorica

Product Dimension of Forests and Bounded Treewidth Graphs
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma Accepted in Electronic Journal of
Combinatorics n

2connecting Outerplanar Graphs without blowing up their treewidth
Manu Basavaraju, Jasine Babu, L. Sunil Chandran, Deepak Rajendraprasad Accepted
in Theoretical Computer Science.

Additive Combinatorics of Permutations
L. Sunil Chandran, Deepak Rajendraprasad, Nitin Singh Accepted
in Discrete Mathematics and Theoretical Computer Science.

A constant factor approximation algorithm for the boxicity of circular arc graphs
Abhijin Adiga, Jasine Babu, L. Sunil Chandran Accepted
in Discrete Applied Mathematics (pending minor revision).

Representing a cubic graph as the intersection graph of axisparallel boxes
in three dimensions
Abhijin Adiga, L. Sunil Chandran, Accepted in SIAM Journal on Discrete
Mathematics (pending minor revision).

Boxicity and Cubicity of Product Graphs
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad Accepted
in European Journal of Combinatorics.

Heterochromatic Paths in Edge Colored Graphs without Small Cycles and
Heterochromatictrianglefree Graphs
Jasine Babu, L. Sunil Chandran, Deepak Rajendraprasad Accepted
in European Journal of Combinatorics.

Separation Dimension of Bounded Degree Graphs
Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
Accepted
in SIAM Journal on Discrete Mathematics.

Rainbow Matchings in Strongly EdgeColored Graphs
Jasine Babu, L. Sunil Chandran, Krishna Vaidyanathan
Accepted
in Discrete Mathematics.

Upper Bound for Cubicity in terms of Boxicity for Graphs of Low Chromatic Number
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad,
Accepted
in Discrete Mathematics.

Separation Dimension and Boxicity
Manu Basavaraju, L. Sunil Chandran, Martin C. Golumbic, Rogers Mathew, Deepak Rajendraprasad,
Accepted
in Algorithmica.

Rainbow Coloring of Split Graphs
L. Sunil Chandran, Marek Tesar, Deepak Rajendraprasad,
Accepted
in Discrete Applied Mathematics.

Oriented and Colorful Variants of GyarfasSumner Conjecture
Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Karthik. M.
Submitted.

A High Girth Graph Construction and a Lower Bound for the Hitting Set Size
for Combinatorial Rectangles.
L. Sunil Chandran,
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 1999. LNCS 1738, pp. 283290.

A Linear Time Algorithm for Enumerating All the Minimum
and Minimal Separators of a Chordal Graph.
L. Sunil Chandran,
Proceedings of the 7th International
Computing and Combinatorics Conference,
Guilin, China, 2001. LNCS 2108, pp. 308317.

Edge Connectivity vs Vertex Connectivity in Chordal
Graphs.
L. Sunil Chandran, Proceedings of the 7th International Computing and Combinatorics
Conference, Guilin, China, 2001. LNCS 2108, pp. 384389.

Approximations for ATSP with Parametrized
Triangle Inequality. L. Sunil Chandran, L. Shankar Ram,
Proceedings of the 19th Annual Symposium On Theoretical Aspects of Computer Science, Antibes JuanlesPins, France, 2002. LNCS 2285, pp. 227237.

On the number of mincuts in a graph.
L. Sunil Chandran, L. Shankar Ram, Proceeding of the 8th International
Computing and Combinatorics Conference, Singapore, 2002. LNCS 2387, pp. 220230.

Isoperimetric Inequalities and the Width parameters of graphs.
L.Sunil Chandran, T. Kavitha, C. R. Subramanian,
Proceedings of the 9th International Computing and Combinatorics
Conference, Montana, USA, 2003. LNCS 2697, pp. 385395.

On the arrangement of cliques in chordal graphs with respect to the cuts.
L. Sunil Chandran, N. S. Narayanaswamy,
Proceedings of the 10th International Computing and Combinatorics
Conference, Jeju Island, South Korea, 2004. pages 151160.

Refined memorization for vertex cover.
L. Sunil Chandran, F. Grandoni, Proceedings of the International Workshop on Parametrized and Exact
Computation, 2004. pages. 6170.

On the Hadwiger Number of Hypercubes and its generalizations.
L. Sunil Chandran, Naveen Sivadasan, GRACO2005, Brazil. (Proceedings: Electronic Notes in Discrete Mathematics, 2005).

Geometric representations of graphs in low dimension.
L. Sunil Chandran, Naveen Sivadasan,
In the proceedings of 12th Annual International Conference on Computing and Combinatorics (COCOON2006), Taipei, Taiwan, August 2006, pages 398407.

Hardness of Approximation results for the problem of finding the Stopping Distance in Tanner Graphs.
Murali Krishnan, L. Sunil Chandran,
In the Proceedings of Foundations of Software Technology and
Theoretical Computer Science (FSTTCS2006), held in Kolkota, December 2006,
pages 6980.

On the Cubicity of Interval graphs.
L. Sunil Chandran, Mathew Francis, Naveen Sivadasan,
Eurocomb 2007, held in Seville, Spain.

A combinatorial Family of Near regular LDPC Codes
.
K. Murali Krishnan, Rajdeep Singh, Priti Shankar, L. Sunil Chandran,
IEEE International Symposium of Information Theory , 2007.

On the cubicity of bipartite graphs.
L. Sunil Chandran, Anita Das, Naveen Sivadasan,
ROGICS, 2008.

Isoperimetric problem and MetaFibonacci Sequences.
B. V. Subramanian Bharadwaj, L. Sunil Chandran, Anita Das,
In the proceedings of 14th Internation Combinatorics and Computing
Conference, (COCOON), Dalian, China, 2008.

Representing graphs as the intersection of axisparallel cubes.
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
MCDES (Managing Complexity in Distributed World) , 2008, IISc Centenary Conference.

Finding a Box Representation for a Graph in $O(n^2\Delta^2\ln n)$ time.
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew,
In ICIT 2008, held in Bhubaneswar.

On the Cubicity of ATfree graphs and circular arc graphs.
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan,
Graph Theory, Computational Intelligence and Thought: A conference
celebrating M.C. Golumbic's 60th birthday, Held in Israel, September 2008.

The cubicity of Interval graphs and the claw number.
Abhijin Adiga, L. Sunil Chandran,
To appear in the proceedings of
Eurocomb2009.

Boxicity of Chordal Bipartite Graphs
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew,
In the proceedings of
Japan Conference on Computation Geometry and Graphsto be held in Kanazawa, November 2009

Boxicity and Poset Dimension
Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran.
To appear in the proceedings of
Computing and Combinatorics Conference (COCOON), to be held in Vietnam, July 2010

A constant factor approximation algorithm for the boxicity of circular arc graphs
Abhijin Adiga, Jasine Babu, L. Sunil Chandran.
Accepted in WADS 2011.

Rainbow Connection Number and Connected Dominating Sets
L. Sunil Chandran, Anita Das, Deepak Rajendraprasad and Nithin M.
Varma, In EUROCOMB 2011

Cubicity, Degeneracy and Crossing Number
Abhijin Adiga, L. Sunil Chandran, Rogers Mathew, Accepted in FSTTCS 2011

Representing a cubic graph as the intersection graph of axisparallel boxes
in three dimensions
Abhijin Adiga, L. Sunil Chandran, Accepted in SoCG 2012

Rainbow Colouring of Split and Threshold Graphs
L. Sunil Chandran, Deepak Rajendraprasad Accepted in COCOON 2012

Parametrized and Approximation Algorithms for Boxicity
Abhijin Adiga, Jasine Babu, L. Sunil Chandran. Accepted
in IPEC2012.

2connecting Outerplanar Graphs without blowing up their treewidth
Manu Basavaraju, Jasine Babu, L. Sunil Chandran, Deepak Rajendraprasad Accepted
in COCOON2013.

Boxicity and Cubicity of Product Graphs
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad Accepted
in Eurocomb 2013.

Separation Dimension and Boxicity
Manu Basavaraju, L. Sunil Chandran, M. C. Golumbic, Rogers Mathew, Deepak Rajendraprasad. Accepted
in WG2014.

Rainbow Colouring of Split Graphs
L. Sunil Chandran, Marek Tesar, Deepak Rajendraprasad. Accepted
in ICGT2014.

Separation Dimension of Sparse Graphs
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad. Accepted
in ICGT2014.