L. Sunil Chandran

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 48

Top Venues

Publications

L. Sunil Chandran, Talha Hashim, Dalu Jacob, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh
-coloring. Discret. Math. 347 (4) (2024)
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. Discret. Appl. Math. 345 (2024)
Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Ankur Naskar
Weakening Total Coloring Conjecture: Weak TCC and Hadwiger's Conjecture on Total Graphs. Electron. J. Comb. 31 (1) (2024)
L. Sunil Chandran, Rishikesh Gajjala, Abraham M. Illickan
Krenn-Gu Conjecture for Sparse Graphs. MFCS (2024)
L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra, Saladi Rahul
Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones. CoRR (2024)
Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob
Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness. LATIN (1) (2024)
L. Sunil Chandran, Rishikesh Gajjala, Abraham M. Illickan
Krenn-Gu conjecture for sparse graphs. CoRR (2024)
Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness. CoRR (2023)
Dibyayan Chakraborty, L. Sunil Chandran, Dalu Jacob, Raji R. Pillai
χ-binding functions for squares of bipartite graphs and its subclasses. CoRR (2023)
L. Sunil Chandran, Rishikesh Gajjala
Perfect matchings and Quantum physics: Bounding the dimension of GHZ states. CoRR (2023)
L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai
Template-driven rainbow coloring of proper interval graphs. Discret. Appl. Math. 328 (2023)
L. Sunil Chandran, Rishikesh Gajjala
Perfect Matchings and Quantum Physics: Progress on Krenn's Conjecture. CoRR (2022)
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. CoRR (2022)
L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan
Towards a conjecture on the recoloring diameter of planar graphs. CoRR (2022)
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
On graphs whose eternal vertex cover number and vertex cover number coincide. Discret. Appl. Math. 319 (2022)
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. WG (2022)
L. Sunil Chandran, Davis Issac, Juho Lauri, Erik Jan van Leeuwen
Upper bounding rainbow connection number by forest number. Discret. Math. 345 (7) (2022)
L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh
Improved approximation for maximum edge colouring problem. Discret. Appl. Math. 319 (2022)
Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Karthik M
Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths. CoRR (2021)
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
Algorithms and Complexity of s-Club Cluster Vertex Deletion. IWOCA (2021)
L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai
Template-Driven Rainbow Coloring of Proper Interval Graphs. CALDAM (2021)
Arnab Bhattacharyya, L. Sunil Chandran, Suprovat Ghoshal
Combinatorial Lower Bounds for 3-Query LDCs. ITCS (2020)
L. Sunil Chandran, Sajith Padinhatteeri, Karthik Ravi Shankar
Power of Hypercube and Cartesian Powers of a Graph. CALDAM (2020)
L. Sunil Chandran, Davis Issac, Sanming Zhou
Hadwiger's conjecture for squares of 2-trees. Eur. J. Comb. 76 (2019)
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
On Graphs with Minimal Eternal Vertex Cover Number. CALDAM (2019)
Arnab Bhattacharyya, L. Sunil Chandran, Suprovat Ghoshal
Combinatorial lower bounds for 3-query LDCs. CoRR (2019)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis
On induced colourful paths in triangle-free graphs. Discret. Appl. Math. 255 (2019)
L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh
Improved Approximation for Maximum Edge Colouring Problem. CoRR (2019)
L. Sunil Chandran, Yun Kuen Cheung, Davis Issac
Spanning Tree Congestion and Computation of Generalized Győri-Lov{á}sz Partition. CoRR (2018)
L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
Algorithms and Bounds for Very Strong Rainbow Coloring. LATIN (2018)
L. Sunil Chandran, Yun Kuen Cheung, Davis Issac
Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition. ICALP (2018)
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh
Approximation bounds on maximum edge 2-coloring of dense graphs. CoRR (2018)
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
On Graphs with Minimal Eternal Vertex Cover Number. CoRR (2018)
Maxwell Levit, L. Sunil Chandran, Joseph Cheriyan
On Eulerian orientations of even-degree hypercubes. Oper. Res. Lett. 46 (5) (2018)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Sublinear approximation algorithms for boxicity and related problems. Discret. Appl. Math. 236 (2018)
L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar
Rainbow colouring of split graphs. Discret. Appl. Math. 216 (2017)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis
On Induced Colourful Paths in Triangle-free Graphs. Electron. Notes Discret. Math. 61 (2017)
L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
Algorithms and Bounds for Very Strong Rainbow Coloring. CoRR (2017)
L. Sunil Chandran, Davis Issac, Sanming Zhou
Hadwiger's Conjecture and Squares of Chordal Graphs. COCOON (2016)
L. Sunil Chandran, Davis Issac, Andreas Karrenbauer
On the Parameterized Complexity of Biclique Cover and Partition. IPEC (2016)
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number. Discret. Math. 339 (2) (2016)
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
Separation Dimension of Graphs and Hypergraphs. Algorithmica 75 (1) (2016)
L. Sunil Chandran, Davis Issac, Sanming Zhou
An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs. CoRR (2016)
Jasine Babu, L. Sunil Chandran, Deepak Rajendraprasad
Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs. Eur. J. Comb. 48 (2015)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Sublinear Approximation Algorithms for Boxicity and Related Problems. CoRR (2015)
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad
Boxicity and cubicity of product graphs. Eur. J. Comb. 48 (2015)
Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
Separation Dimension of Bounded Degree Graphs. SIAM J. Discret. Math. 29 (1) (2015)
Jasine Babu, L. Sunil Chandran, Krishna Vaidyanathan
Rainbow matchings in strongly edge-colored graphs. Discret. Math. 338 (7) (2015)
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy
Rainbow Connection Number of Graph Power and Graph Products. Graphs Comb. 30 (6) (2014)
L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar
Rainbow Colouring of Split Graphs. CoRR (2014)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Naveen Sivadasan
Approximating the Cubicity of Trees. CoRR (2014)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad
2-Connecting outerplanar graphs without blowing up the pathwidth. Theor. Comput. Sci. 554 (2014)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
A constant factor approximation algorithm for boxicity of circular arc graphs. Discret. Appl. Math. 178 (2014)
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy
Rainbow Connection Number and Radius. Graphs Comb. 30 (2) (2014)
L. Sunil Chandran, Deepak Rajendraprasad, Nitin Singh
. Discret. Math. Theor. Comput. Sci. 16 (2) (2014)
Abhijin Adiga, L. Sunil Chandran, Rogers Mathew
Cubicity, degeneracy, and crossing number. Eur. J. Comb. 35 (2014)
Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
Separation dimension of bounded degree graphs. CoRR (2014)
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
Boxicity and separation dimension. CoRR (2014)
Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan
Lower bounds for boxicity. Comb. 34 (6) (2014)
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
Boxicity and Separation Dimension. WG (2014)
Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
Separation dimension of sparse graphs. CoRR (2014)
Abhijin Adiga, L. Sunil Chandran
Representing a Cubic Graph as the Intersection Graph of Axis-Parallel Boxes in Three Dimensions. SIAM J. Discret. Math. 28 (3) (2014)
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
Cubicity and Bandwidth. Graphs Comb. 29 (1) (2013)
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma
Product Dimension of Forests and Bounded Treewidth Graphs. Electron. J. Comb. 20 (3) (2013)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. COCOON (2013)
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad
Boxicity and Cubicity of Product Graphs CoRR (2013)
L. Sunil Chandran, Rajesh Hemant Chitnis, Ramanjit Kumar
On the SIG-Dimension of Trees Under the L ∞-Metric. Graphs Comb. 29 (4) (2013)
L. Sunil Chandran, Deepak Rajendraprasad
Inapproximability of Rainbow Colouring. FSTTCS (2013)
L. Sunil Chandran, Rogers Mathew
Bipartite Powers of k-chordal Graphs. Discret. Math. Theor. Comput. Sci. 15 (2) (2013)
Manu Basavaraju, L. Sunil Chandran, T. Karthick
Maximum weight independent sets in hole- and dart-free graphs. Discret. Appl. Math. 160 (16-17) (2012)
L. Sunil Chandran, Deepak Rajendraprasad
Rainbow Colouring of Split and Threshold Graphs CoRR (2012)
Manu Basavaraju, L. Sunil Chandran
Acyclic edge coloring of 2-degenerate graphs. J. Graph Theory 69 (1) (2012)
L. Sunil Chandran, Deepak Rajendraprasad
Rainbow Colouring of Split and Threshold Graphs. COCOON (2012)
Xueliang Li, Sujuan Liu, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
Rainbow Connection Number and Connectivity. Electron. J. Comb. 19 (1) (2012)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Polynomial Time and Parameterized Approximation Algorithms for Boxicity. IPEC (2012)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
Parameterized and Approximation Algorithms for Boxicity CoRR (2012)
Abhijin Adiga, L. Sunil Chandran
Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions. SCG (2012)
Manu Basavaraju, L. Sunil Chandran
Acyclic Edge Coloring of Triangle-Free Planar Graphs. J. Graph Theory 71 (4) (2012)
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma
Product Dimension of Forests and Bounded Treewidth Graphs CoRR (2012)
L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma
Rainbow connection number and connected dominating sets. J. Graph Theory 71 (2) (2012)
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth CoRR (2012)
Abhijin Adiga, L. Sunil Chandran, Rogers Mathew
Cubicity, Degeneracy, and Crossing Number. FSTTCS (2011)
L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma
Rainbow Connection Number and Connected Dominating Sets. Electron. Notes Discret. Math. 38 (2011)
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
Boxicity of Leaf Powers. Graphs Comb. 27 (1) (2011)
Abhijin Adiga, L. Sunil Chandran, Rogers Mathew
Cubicity, Degeneracy, and Crossing Number CoRR (2011)
Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller
Acyclic Edge-Coloring of Planar Graphs. SIAM J. Discret. Math. 25 (2) (2011)
Diptendu Bhowmick, L. Sunil Chandran
Boxicity of Circular Arc Graphs. Graphs Comb. 27 (6) (2011)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs CoRR (2011)
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
Chordal Bipartite Graphs with High Boxicity. Graphs Comb. 27 (3) (2011)
L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan
Boxicity of line graphs. Discret. Math. 311 (21) (2011)
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy
Rainbow Connection Number of Graph Power and Graph Products. CoRR (2011)
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. WADS (2011)
Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran
Boxicity and Poset Dimension. SIAM J. Discret. Math. 25 (4) (2011)
Diptendu Bhowmick, L. Sunil Chandran
Boxicity and cubicity of asteroidal triple free graphs. Discret. Math. 310 (10-11) (2010)
L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma
Rainbow Connection Number and Connected Dominating Sets. CoRR (2010)
Abhijin Adiga, L. Sunil Chandran
Cubicity of interval graphs and the claw number. J. Graph Theory 65 (4) (2010)
Manu Basavaraju, L. Sunil Chandran, Manoj Kummini
+2. J. Graph Theory 63 (3) (2010)
Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran
Boxicity and Poset Dimension. COCOON (2010)
L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan
Boxicity of Line Graphs CoRR (2010)
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy
Rainbow Connection Number and Radius CoRR (2010)

L. Sunil Chandran.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

L. Sunil Chandran