Home | Publications | Students | Teaching | Awards and Recognitions | Post docs

  • Journal papers
  • Conference papers
  • Preprint

Journal papers

  1. List Recoloring of Planar Graphs L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan. Discrete Applied Mathematics, Vol. 363, pages 71-87, 15 March 2025 DOI: https://doi.org/10.1016/j.dam.2024.11.031

  2. Variants of the Gyárfás-Sumner Conjecture: Oriented Trees and Rainbow Paths M. Basavaraju, L. Sunil Chandran, Mathew C Francis, Karthik Murali. Journal of Graph Theory, 2024 DOI: https://doi.org/10.1002/jgt.23171

  3. Graph-theoretic insights on the constructability of complex entangled states. L. Sunil Chandran, Rishikesh Gajjala. Quantum vol. 8: 1396, 2024

  4. Weak TCC and Hadwiger’s Conjecture on Total Graphs. Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Ankur Naskar. Electronic Journal of Combinatorics , vol 31, no.1, 2024

  5. s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graph. Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai. Discrete Applied Mathematics , vol 345, Pages 170-189, 2024

  6. New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring. L. Sunil Chandran, Talha Hashim, Dalu Jacob, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh. Discrete Mathematics vol 347 no. 4, 2024

  7. Template-driven rainbow coloring of proper interval graph. L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai. Discrete Applied Mathematics vol 328, Pages 97-107, 2023

  8. Improved approximation for maximum edge colouring problem. L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh. Discrete Applied Mathematics vol 319, Pages 42-52, 2022

  9. On graphs whose eternal vertex cover number and vertex cover number coincide. Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier. Discrete Applied Mathematics vol 319, Pages 171-182, 2022

  10. Upper bounding rainbow connection number by forest number. L. Sunil Chandran, Davis Issac, Juho Lauri, Erik Jan van Leeuwen. Discrete Mathematics vol 345, no. 7, 2022

  11. On induced colourful paths in triangle-free graphs. Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis. Discrete Applied Mathematics vol 255, Pages 109-116, 2019

  12. Hadwiger’s conjecture for squares of 2-trees. L. Sunil Chandran, Davis Issac, Sanming Zhou. European Journal of Combinatorics vol 76, Pages 159-174, 2019

  13. Sublinear approximation algorithms for boxicity and related problems. Abhijin Adiga, Jasine Babu, L. Sunil Chandran. Discrete Applied Mathematics vol 236, Pages 7-22, 2018

  14. On Eulerian orientations of even-degree hypercubes. Maxwell Levit, L. Sunil Chandran, Joseph Cheriyan. Operations Research Letters vol 46, no.5 Pages 553-556 2018

  15. Rainbow coloring of split graphs. L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar. Discrete Applied Mathematics vol 216, Pages 98-113, 2017

  16. Separation Dimension of Graphs and Hypergraphs. Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad. Algorithmica vol 75, no.1, Pages 187-204, 2016

  17. Separation Dimension of Graphs and Hypergraphs. Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad. Discrete Mathematics vol 339, no.2, Pages 443-446, 2016

  18. Rainbow matchings in strongly edgecolored graphs. Jasine Babu, L. Sunil Chandran, Krishna Vaidyanathan. Discrete Mathematics vol 338, no.7, Pages 1191-1196, 2015

  19. Boxicity and cubicity of product graphs. L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad. European Journal of Combinatorics vol 48, Pages 100-109, 2015

  20. Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs. Jasine Babu, L. Sunil Chandran, Deepak Rajendraprasad. European Journal of Combinatorics vol 48, Pages 110-126, 2015

  21. Separation Dimension of Bounded Degree Graphs. Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad. SIAM Journal of Discrete Mathematics vol 29, no. 1, Pages 59-64, 2015

  22. Lower bounds for boxicity. Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan. Combinatorica vol 34, no. 6, Pages 631-655, 2014

  23. A constant factor approximation algorithm for boxicity of circular arc graphs. Abhijin Adiga, Jasine Babu, L. Sunil Chandran. Discrete Applied Mathematics vol 178, Pages 1-18, 2014

  24. On Additive Combinatorics of Permutations of Zn. L. Sunil Chandran, Deepak Rajendraprasad, Nitin Singh. Discrete Mathematics and Theoretical Computer Science vol 16, Pages 35-40, 2014

  25. Cubicity, degeneracy, and crossing number. Abhijin Adiga, L. Sunil Chandran, Rogers Mathew. European Journal of Combinatorics vol 35, Pages 2-12, 2014

  26. Rainbow Connection Number and Radius. Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy. Graphs and Combinatorics vol 30, no. 2, Pages 275-285, 2014

  27. Rainbow Connection Number of Graph Power and Graph Products. Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy. Graphs and Combinatorics vol 30, no. 6 Pages 1363-1382, 2014

  28. Representing a Cubic Graph as the Intersection Graph of Axis-Parallel Boxes in Three Dimensions. Abhijin Adiga, L. Sunil Chandran. SIAM Journal of Discrete Mathematics vol 28 no. 3, Pages 1515-1539, 2014

  29. 2-Connecting outerplanar graphs without blowing up the pathwidth. Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad. Theoretical Computer Science vol 554, Pages 119-134, 2014

  30. Product Dimension of Forests and Bounded Treewidth Graphs. L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma. Electronic Journal of Combinatorics vol 42, 2013

  31. Bipartite Powers of k-chordal Graphs. L. Sunil Chandran, Rogers Mathew. Discrete Mathematics and Theoretical Computer Science vol 15, no. 2, Pages 49-58 2013

  32. Cubicity and Bandwidth. L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan. Graphs and Combinatorics vol 29, no. 1, Pages 45-69 2013

  33. On the SIG-Dimension of Trees Under the L α-Metric. L. Sunil Chandran, Rajesh Hemant Chitnis, Ramanjit Kumar. Graphs and Combinatorics vol 29, no. 4, Pages 773-794 2013

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

  35. Maximum weight independent sets in hole- and dart-free graphs. Manu Basavaraju, L. Sunil Chandran, T. Karthick. Discrete Applied Mathematics vol 160, Pages 2364-2369, 2012

  36. Acyclic edge coloring of 2-degenerate graphs. Manu Basavaraju, L. Sunil Chandran. Journal of Graph Theory vol 69, no 1, Pages 1-27, 2012

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

  38. Acyclic Edge Coloring of Triangle-Free Planar Graphs. Manu Basavaraju, L. Sunil Chandran. Journal of Graph Theory vol 71, no. 41, Pages 365-385, 2012

  39. Boxicity of line graphs. L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan. Journal of Graph Theory vol 311, no 21, Pages 2359-2367, 2011

  40. Boxicity of Leaf Powers. L. Sunil Chandran, Mathew C. Francis, Rogers Mathew. Graphs and Combinatorics vol 27, no 1, Pages 61-72, 2011

  41. Chordal Bipartite Graphs with High Boxicity. L. Sunil Chandran, Mathew C. Francis, Rogers Mathew. Graphs and Combinatorics vol 27, no 3, Pages 353-362, 2011

  42. Boxicity of Circular Arc Graphs. Diptendu Bhowmick, L. Sunil Chandran. Graphs and Combinatorics vol 27, no 6, Pages 769-783, 2011

  43. Acyclic Edge-Coloring of Planar Graphs. Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frederic Havet, Tobias Muller. SIAM Journal of Discrete Mathematics vol 25, no 2, Pages 463-478, 2011

  44. Boxicity and Poset Dimension. Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran. SIAM Journal of Discrete Mathematics vol 25, no 4, Pages 1687-1698, 2011

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

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

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

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

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

  50. On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts. L. Sunil Chandran, N. S. Narayanaswamy. Ars Combinatoria vol 92, 2009

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

  52. Cubicity, boxicity, and vertex cover. L. Sunil Chandran, Anita Das, Chintan D. Shah. Discrete Mathematics vol 309(4): 834-842, 2009

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

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

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

  56. Hadwiger’s conjecture for proper circular arc graphs. Naveen Belkale, L. Sunil Chandran. European Journal of Combinatorics vol 30(4): 946-956, 2009

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

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

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

  60. On the cubicity of bipartite graphs. L. Sunil Chandran, Anita Das, Naveen Sivadasan. Information Processing Letters vol 109(9): 432-435, 2009

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

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

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

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

  65. Boxicity and maximum degree. L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan. Journal of Combinatorial Theory B vol 98(2): 443-445, 2008

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

  67. 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(1): 10-13, 2007

  68. Boxicity and treewidth. L. Sunil Chandran, Naveen Sivadasan. Journal of Combinatorial Theory B vol. 97(5): 733-744, 2007

  69. The stable set problem and the thinness of a graph. Carlo Mannino, Gianpaolo Oriolo, Federico Ricci-Tersenghi, L. Sunil Chandran. Operations Research Letters vol. . 35(1): 1-9, 2007

  70. On the relationship between ATSP and the cycle cover problem. Carlo Mannino, Gianpaolo Oriolo, Federico Ricci-Tersenghi, L. Sunil Chandran. Theoretical Computer Science vol. 370(1-3): 218-228, 2007

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

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

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

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

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

  76. Refined memorization for vertex cover. L. Sunil Chandran, Fabrizio Grandoni. Information Processing Letters vol. 93(3): 123-131, 2005

  77. On the cubicity of certain graphs. L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo. Information Processing Letters vol. 94(3): 113-118, 2005

  78. Girth and treewidth. L. Sunil Chandran, C. R. Subramanian. Journal of Combinatorial Theory B vol. 93(1): 23-32, 2005

  79. Minimum cuts, girth and a spectral threshold. L. Sunil Chandran. Information Processing Letters vol. 89(3): 105-110, 2004

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

  81. A lower bound for the hitting set size for combinatorial rectangles and an application. L. Sunil Chandran. Information Processing Letters vol. 86(2): 75-78, 2003

  82. A spectral lower bound for the treewidth of a graph and its consequences. L. Sunil Chandran. Information Processing Letters vol. 87(4): 195-200, 2003

  83. A High Girth Graph Construction. L. Sunil Chandran. SIAM Journal of Discrete Mathematics vol. 16(3): 366-370, 2003

  84. Generating and characterizing the perfect elimination orderings of a chordal graph. L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada. Theoretical Computer Science vol. 307(2): 303-317, 2003

Conference Papers

  1. Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra, Rahul Saladi FSTTCS 2024

  2. Krenn-Gu Conjecture for Sparse Graphs. L. Sunil Chandran, Rishikesh Gajjala, Abraham Mathew Illickan. MFCS 2024

  3. Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness. Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob. Latin 2024

  4. s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai. WG 2022

  5. Algorithms and Complexity of s-Club Cluster Vertex Deletion. D. Chakraborty, L. S. Chandran, Sajith Sajith Padinhatteeri, Raji. R. Pillaii. IWOCA 2021

  6. List Distinguishing Number of pth Power of Hypercubes and Cartisian Power of a Graph. L. S. Chandran, Sajith Padinhatteeri, Karthik Ravishankari. CALDAM 2020

  7. Combinatorial Lower Bounds for 3-Query LDCs. A. Bhattacharrya, L. S. Chandran, S. Ghoshal. ITCS 2020

  8. Spanning Tree Congestion and Computation of Generalized Gy¨ori Lovasz Partition. L. S. Chandran, Y. K. Cheung, D. Issac. ICALP 2018

  9. On the Parametrized Complexity of Bi-clique Cover Problem. L. Sunil Chandran, Davis Issac, A. Karrenbauer. IPEC 2016

  10. An Approach to Hadwiger’s Conjecture through Squares of Chordal Graphs L. Sunil Chandran, Davis Issac, Sanming Zhou. COCOON 2016

  11. Boxicity and Separation Dimension. Manu Basavaraju, L. Sunil Chandran, M. C. Golumbic, Rogers Mathew, Deepak Rajendraprasad. WG 2014

  12. Rainbow Colouring of Split Graphs. L. Sunil Chandran, Marek Tesar, Deepak Rajendraprasad. ICGT 2014

  13. Separation Dimension of Sparse Graphs. L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad. ICGT 2014

  14. Inapproximability of Rainbow Colouring. L. Sunil Chandran, Deepak Rajendraprasad. FSTTCS 2013

  15. 2-Connecting Outer Planar Graphs without Blowing up the Pathwidth. Manu Basavaraju, Jasine Babu, L. Sunil Chandran, Deepak Rajendraprasad. COCOON 2013

  16. Polynomial Time and Parameterized Approximation Algorithms for Boxicity. Abhijin Adiga, Jasine Babu, L. Sunil Chandran. IPEC 2012

  17. Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions. Abhijin Adiga, L. Sunil Chandran. SoCG 2012

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

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

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

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

  22. Boxicity and Poset Dimension. Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran. COCOON 2010

  23. The cubicity of Interval graphs and the claw number. Abhijin Adiga, L. Sunil Chandran. EUROCOMB 2009

  24. Chordal Bipartite Graphs of High Boxicity. L. Sunil Chandran, Mathew C. Francis, Rogers Mathew. Japan Conference on Computation Geometry and Graphs 2009

  25. Finding a Box Representation for a Graph in O(n2∆2 ln n) time. L. Sunil Chandran, Mathew C. Francis, Rogers Mathew. ICIT 2008

  26. On the Cubicity of AT-free 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, 2008

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

  28. Isoperimetric problem and Meta-Fibonacci Sequences. B. V. Subramanian Bharadwaj, L. Sunil Chandran, Anita Das. COCOON 2008

  29. A combinatorial Family of Near regular LDPC Codes. K. Murali Krishnan, Rajdeep Singh, Priti Shankar, L. Sunil Chandran. ISIT 2007

  30. On the Cubicity of Interval graphs. L. Sunil Chandran, Mathew Francis, Naveen Sivadasan. FSTTCS 2007

  31. Hardness of Approximation results for the problem of finding the Stopping Distance in Tanner Graphs. K Murali Krishnan, L. Sunil Chandran. FSTTCS 2006

  32. Geometric representations of graphs in low dimension. L. Sunil Chandran, Naveen Sivadasan. COCOON 2006

  33. On the Hadwiger Number of Hypercubes and its generalizations. L. Sunil Chandran, Naveen Sivadasan. GRACO 2005

  34. Refined memorization for vertex cover. L. Sunil Chandran, F. Grandoni. IWPEC 2004

  35. On the arrangement of cliques in chordal graphs with respect to the cuts. L. Sunil Chandran, N. S. Narayanaswamy. COCOON 2004

  36. Isoperimetric Inequalities and the Width parameters of graphs. L.Sunil Chandran, T. Kavitha, C. R. Subramanian. COCOON 2003

  37. On the number of min-cuts in a graph. L. Sunil Chandran, L. Shankar Ram. COCOON 2002

  38. Approximations for ATSP with Parametrized Triangle Inequality. L. Sunil Chandran, L. Shankar Ram. STACS 2002

  39. Edge Connectivity vs Vertex Connectivity in Chordal Graphs. L. Sunil Chandran. COCOON 2001

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

  41. A High Girth Graph Construction and a Lower Bound for the Hitting Set Size for Combinatorial Rectangles. L. Sunil Chandran. FSTTCS 2001