L. Sunil Chandran

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

Manu Basavaraju, L. Sunil Chandran, T. Karthick: Maximum weight independent sets in hole- and dart-free graphs. Discrete Applied Mathematics 160(16-17): 2364-2369 (2012)

Manu Basavaraju, L. Sunil Chandran: Acyclic edge coloring of 2-degenerate graphs. Journal of Graph Theory 69(1): 1-27 (2012)

L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma: Rainbow connection number and connected dominating sets. Journal of Graph Theory 71(2): 206-218 (2012)

Manu Basavaraju, L. Sunil Chandran: Acyclic Edge Coloring of Triangle-Free Planar Graphs. Journal of Graph Theory 71(4): 365-385 (2012)

L. Sunil Chandran, Deepak Rajendraprasad: Rainbow Colouring of Split and Threshold Graphs. COCOON 2012: 181-192

Abhijin Adiga, L. Sunil Chandran: Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions. Symposium on Computational Geometry 2012: 387-396

Abhijin Adiga, Jasine Babu, L. Sunil Chandran: Polynomial Time and Parameterized Approximation Algorithms for Boxicity. IPEC 2012: 135-146

Abhijin Adiga, Jasine Babu, L. Sunil Chandran: Parameterized and Approximation Algorithms for Boxicity. CoRR abs/1201.5958 (2012)

L. Sunil Chandran, Deepak Rajendraprasad: Rainbow Colouring of Split and Threshold Graphs. CoRR abs/1205.1670 (2012)

L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma: Product Dimension of Forests and Bounded Treewidth Graphs. CoRR abs/1209.2218 (2012)

Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad: 2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. CoRR abs/1212.6382 (2012)

L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan: Boxicity of line graphs. Discrete Mathematics 311(21): 2359-2367 (2011)

L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma: Rainbow Connection Number and Connected Dominating Sets. Electronic Notes in Discrete Mathematics 38: 239-244 (2011)

L. Sunil Chandran, Mathew C. Francis, Rogers Mathew: Boxicity of Leaf Powers. Graphs and Combinatorics 27(1): 61-72 (2011)

L. Sunil Chandran, Mathew C. Francis, Rogers Mathew: Chordal Bipartite Graphs with High Boxicity. Graphs and Combinatorics 27(3): 353-362 (2011)

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

Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller: Acyclic Edge-Coloring of Planar Graphs. SIAM J. Discrete Math. 25(2): 463-478 (2011)

Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran: Boxicity and Poset Dimension. SIAM J. Discrete Math. 25(4): 1687-1698 (2011)

Abhijin Adiga, L. Sunil Chandran, Rogers Mathew: Cubicity, Degeneracy, and Crossing Number. FSTTCS 2011: 176-190

Abhijin Adiga, Jasine Babu, L. Sunil Chandran: A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. WADS 2011: 13-24

Abhijin Adiga, Jasine Babu, L. Sunil Chandran: A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. CoRR abs/1102.1544 (2011)

Abhijin Adiga, L. Sunil Chandran, Rogers Mathew: Cubicity, Degeneracy, and Crossing Number. CoRR abs/1105.5225 (2011)

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes. Algorithmica 56(2): 129-140 (2010)

Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran: The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. Discrete Applied Mathematics 158(16): 1719-1726 (2010)

Diptendu Bhowmick, L. Sunil Chandran: Boxicity and cubicity of asteroidal triple free graphs. Discrete Mathematics 310(10-11): 1536-1543 (2010)

Manu Basavaraju, L. Sunil Chandran, Manoj Kummini: d-Regular graphs of acyclic chromatic index at least d+2. Journal of Graph Theory 63(3): 226-230 (2010)

Abhijin Adiga, L. Sunil Chandran: Cubicity of interval graphs and the claw number. Journal of Graph Theory 65(4): 323-333 (2010)

Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran: Boxicity and Poset Dimension. COCOON 2010: 3-12

Manu Basavaraju, L. Sunil Chandran: Acyclic Edge Coloring of Triangle Free Planar Graphs. CoRR abs/1007.2282 (2010)

L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan: Boxicity of Line Graphs. CoRR abs/1009.4471 (2010)

Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy: Rainbow Connection Number and Radius. CoRR abs/1011.0620 (2010)

L. Sunil Chandran, N. S. Narayanaswamy: On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts. Ars Comb. 92 (2009)

B. V. Subramanya Bharadwaj, L. Sunil Chandran: Bounds on isoperimetric values of trees. Discrete Mathematics 309(4): 834-842 (2009)

L. Sunil Chandran, Anita Das, Chintan D. Shah: Cubicity, boxicity, and vertex cover. Discrete Mathematics 309(8): 2488-2496 (2009)

L. Sunil Chandran, K. Ashik Mathew: An upper bound for Cubicity in terms of Boxicity. Discrete Mathematics 309(8): 2571-2574 (2009)

L. Sunil Chandran, Mathew C. Francis, Santhosh Suresh: Boxicity of Halin graphs. Discrete Mathematics 309(10): 3233-3237 (2009)

Manu Basavaraju, L. Sunil Chandran: A note on acyclic edge coloring of complete bipartite graphs. Discrete Mathematics 309(13): 4646-4648 (2009)

Naveen Belkale, L. Sunil Chandran: Hadwiger's conjecture for proper circular arc graphs. Eur. J. Comb. 30(4): 946-956 (2009)

Abhijin Adiga, L. Sunil Chandran: Cubicity of Interval Graphs and the Claw Number. Electronic Notes in Discrete Mathematics 34: 471-475 (2009)

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: On the Cubicity of Interval Graphs. Graphs and Combinatorics 25(2): 169-179 (2009)

N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran: On the Structure of Contractible Edges in k-connected Partial k-trees. Graphs and Combinatorics 25(4): 557-569 (2009)

L. Sunil Chandran, Anita Das, Naveen Sivadasan: On the cubicity of bipartite graphs. Inf. Process. Lett. 109(9): 432-435 (2009)

Manu Basavaraju, L. Sunil Chandran: Acyclic edge coloring of graphs with maximum degree 4. Journal of Graph Theory 61(3): 192-209 (2009)

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: On the Cubicity of AT-Free Graphs and Circular-Arc Graphs. Graph Theory, Computational Intelligence and Thought 2009: 148-157

Manu Basavaraju, L. Sunil Chandran: Acyclic Edge coloring of Planar Graphs. CoRR abs/0908.2237 (2009)

L. Sunil Chandran, Naveen Sivadasan: The cubicity of hypercube graphs. Discrete Mathematics 308(23): 5795-5800 (2008)

Manu Basavaraju, L. Sunil Chandran: Acyclic edge coloring of subcubic graphs. Discrete Mathematics 308(24): 6650-6653 (2008)

L. Sunil Chandran, Alexandr V. Kostochka, J. Krishnam Raju: Hadwiger Number and the Cartesian Product of Graphs. Graphs and Combinatorics 24(4): 291-301 (2008)

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Boxicity and maximum degree. J. Comb. Theory, Ser. B 98(2): 443-445 (2008)

B. V. Subramanya Bharadwaj, L. Sunil Chandran, Anita Das: Isoperimetric Problem and Meta-Fibonacci Sequences. COCOON 2008: 22-30

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: On the cubicity of AT-free graphs and circular-arc graphs. CoRR abs/0803.3670 (2008)

L. Sunil Chandran, Anita Das, Naveen Sivadasan: On the cubicity of bipartite graphs. CoRR abs/0810.2697 (2008)

L. Sunil Chandran, Naveen Sivadasan: On the Hadwiger's conjecture for graph products. Discrete Mathematics 307(2): 266-273 (2007)

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: On the Cubicity of Interval Graphs. Electronic Notes in Discrete Mathematics 29: 315-319 (2007)

N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chandran, Naveen Sivadasan: A note on the Hadwiger number of circular arc graphs. Inf. Process. Lett. 104(1): 10-13 (2007)

L. Sunil Chandran, Naveen Sivadasan: Boxicity and treewidth. J. Comb. Theory, Ser. B 97(5): 733-744 (2007)

Carlo Mannino, Gianpaolo Oriolo, Federico Ricci, L. Sunil Chandran: The stable set problem and the thinness of a graph. Oper. Res. Lett. 35(1): 1-9 (2007)

L. Sunil Chandran, L. Shankar Ram: On the relationship between ATSP and the cycle cover problem. Theor. Comput. Sci. 370(1-3): 218-228 (2007)

L. Sunil Chandran, Fabrizio Grandoni: A linear time algorithm to list the minimal separators of chordal graphs. Discrete Mathematics 306(3): 351-358 (2006)

L. Sunil Chandran, Telikepalli Kavitha: The treewidth and pathwidth of hypercubes. Discrete Mathematics 306(3): 359-365 (2006)

Ankur Bohra, L. Sunil Chandran, J. Krishnam Raju: Boxicity of series-parallel graphs. Discrete Mathematics 306(18): 2219-2221 (2006)

L. Sunil Chandran, Telikepalli Kavitha: The carvingwidth of hypercubes. Discrete Mathematics 306(18): 2270-2274 (2006)

L. Sunil Chandran, Naveen Sivadasan: Geometric Representation of Graphs in Low Dimension. COCOON 2006: 398-407

K. Murali Krishnan, L. Sunil Chandran: Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. FSTTCS 2006: 69-80

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Geometric representation of graphs in low dimension. CoRR abs/cs/0605013 (2006)

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Representing graphs as the intersection of axis-parallel cubes. CoRR abs/cs/0607092 (2006)

K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar: A Combinatorial Family of Near Regular LDPC Codes. CoRR abs/cs/0609146 (2006)

L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian: Graphs of low chordality. Discrete Mathematics & Theoretical Computer Science 7(1): 25-36 (2005)

L. Sunil Chandran, Naveen Sivadasan: On the Hadwiger number of hypercubes and its generalizations. Electronic Notes in Discrete Mathematics 19: 155-161 (2005)

L. Sunil Chandran, Fabrizio Grandoni: Refined memorization for vertex cover. Inf. Process. Lett. 93(3): 123-131 (2005)

L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo: On the cubicity of certain graphs. Inf. Process. Lett. 94(3): 113-118 (2005)

L. Sunil Chandran, C. R. Subramanian: Girth and treewidth. J. Comb. Theory, Ser. B 93(1): 23-32 (2005)

L. Sunil Chandran: Minimum cuts, girth and a spectral threshold. Inf. Process. Lett. 89(3): 105-110 (2004)

L. Sunil Chandran, L. Shankar Ram: On the Number of Minimum Cuts in a Graph. SIAM J. Discrete Math. 18(1): 177-194 (2004)

L. Sunil Chandran, N. S. Narayanaswamy: On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. COCOON 2004: 151-160

L. Sunil Chandran, Fabrizio Grandoni: Refined Memorisation for Vertex Cover. IWPEC 2004: 61-70

L. Sunil Chandran: A lower bound for the hitting set size for combinatorial rectangles and an application. Inf. Process. Lett. 86(2): 75-78 (2003)

L. Sunil Chandran, C. R. Subramanian: A spectral lower bound for the treewidth of a graph and its consequences. Inf. Process. Lett. 87(4): 195-200 (2003)

L. Sunil Chandran: A High Girth Graph Construction. SIAM J. Discrete Math. 16(3): 366-370 (2003)

L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada: Generating and characterizing the perfect elimination orderings of a chordal graph. Theor. Comput. Sci. 307(2): 303-317 (2003)

L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian: Isoperimetric Inequalities and the Width Parameters of Graphs. COCOON 2003: 385-393

L. Sunil Chandran, L. Shankar Ram: On the Number of Minimum Cuts in a Graph. COCOON 2002: 220-229

L. Sunil Chandran, L. Shankar Ram: Approximations for ATSP with Parametrized Triangle Inequality. STACS 2002: 227-237

L. Sunil Chandran: A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph. COCOON 2001: 308-317

L. Sunil Chandran: Edge Connectivity vs Vertex Connectivity in Chordal Graphs. COCOON 2001: 384-389

L. Sunil Chandran: A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles. FSTTCS 1999: 283-290