default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDL. Sunil Chandran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j85]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)- [j84]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: 170-189 (2024) - [j83]L. Sunil Chandran, Talha Hashim, Dalu Jacob, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh:
New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring. Discret. Math. 347(4): 113894 (2024) - [c35]Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob:
Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness. LATIN (1) 2024: 97-113 - [c34]L. Sunil Chandran, Rishikesh Gajjala, Abraham M. Illickan:
Krenn-Gu Conjecture for Sparse Graphs. MFCS 2024: 41:1-41:15 - [i41]L. Sunil Chandran, Rishikesh Gajjala, Abraham M. Illickan:
Krenn-Gu conjecture for sparse graphs. CoRR abs/2407.00303 (2024) - [i40]L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra, Saladi Rahul:
Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones. CoRR abs/2407.16323 (2024) - 2023
- [j82]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: 97-107 (2023) - [i39]L. Sunil Chandran, Rishikesh Gajjala:
Graph-theoretic insights on the constructability of complex entangled states. CoRR abs/2304.06407 (2023) - [i38]Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob:
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness. CoRR abs/2307.12073 (2023) - [i37]Dibyayan Chakraborty, L. Sunil Chandran, Dalu Jacob, Raji R. Pillai:
χ-binding functions for squares of bipartite graphs and its subclasses. CoRR abs/2312.08759 (2023) - 2022
- [j81]L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh:
Improved approximation for maximum edge colouring problem. Discret. Appl. Math. 319: 42-52 (2022) - [j80]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: 171-182 (2022) - [j79]L. Sunil Chandran, Davis Issac, Juho Lauri, Erik Jan van Leeuwen:
Upper bounding rainbow connection number by forest number. Discret. Math. 345(7): 112829 (2022) - [c33]Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai:
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. WG 2022: 129-143 - [i36]L. Sunil Chandran, Rishikesh Gajjala:
Perfect Matchings and Quantum Physics: Progress on Krenn's Conjecture. CoRR abs/2202.05562 (2022) - [i35]L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan:
Towards a conjecture on the recoloring diameter of planar graphs. CoRR abs/2209.05992 (2022) - [i34]Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai:
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. CoRR abs/2210.07699 (2022) - 2021
- [c32]L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai:
Template-Driven Rainbow Coloring of Proper Interval Graphs. CALDAM 2021: 452-470 - [c31]Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai:
Algorithms and Complexity of s-Club Cluster Vertex Deletion. IWOCA 2021: 152-164 - [i33]Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Karthik Murali:
Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths. CoRR abs/2111.13115 (2021) - 2020
- [c30]L. Sunil Chandran, Sajith Padinhatteeri, Karthik Ravi Shankar:
List Distinguishing Number of p th Power of Hypercube and Cartesian Powers of a Graph. CALDAM 2020: 235-247 - [c29]Arnab Bhattacharyya, L. Sunil Chandran, Suprovat Ghoshal:
Combinatorial Lower Bounds for 3-Query LDCs. ITCS 2020: 85:1-85:8
2010 – 2019
- 2019
- [j78]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis:
On induced colourful paths in triangle-free graphs. Discret. Appl. Math. 255: 109-116 (2019) - [j77]L. Sunil Chandran, Davis Issac, Sanming Zhou:
Hadwiger's conjecture for squares of 2-trees. Eur. J. Comb. 76: 159-174 (2019) - [c28]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: 263-273 - [i32]L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh:
Improved Approximation for Maximum Edge Colouring Problem. CoRR abs/1910.11753 (2019) - [i31]Arnab Bhattacharyya, L. Sunil Chandran, Suprovat Ghoshal:
Combinatorial lower bounds for 3-query LDCs. CoRR abs/1911.10698 (2019) - 2018
- [j76]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
Sublinear approximation algorithms for boxicity and related problems. Discret. Appl. Math. 236: 7-22 (2018) - [j75]Maxwell Levit, L. Sunil Chandran, Joseph Cheriyan:
On Eulerian orientations of even-degree hypercubes. Oper. Res. Lett. 46(5): 553-556 (2018) - [c27]L. Sunil Chandran, Yun Kuen Cheung, Davis Issac:
Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition. ICALP 2018: 32:1-32:14 - [c26]L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen:
Algorithms and Bounds for Very Strong Rainbow Coloring. LATIN 2018: 625-639 - [i30]L. Sunil Chandran, Yun Kuen Cheung, Davis Issac:
Spanning Tree Congestion and Computation of Generalized Győri-Lov{á}sz Partition. CoRR abs/1802.07632 (2018) - [i29]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh:
Approximation bounds on maximum edge 2-coloring of dense graphs. CoRR abs/1810.00624 (2018) - [i28]Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier:
On Graphs with Minimal Eternal Vertex Cover Number. CoRR abs/1812.05125 (2018) - 2017
- [j74]L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar:
Rainbow colouring of split graphs. Discret. Appl. Math. 216: 98-113 (2017) - [j73]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis:
On Induced Colourful Paths in Triangle-free Graphs. Electron. Notes Discret. Math. 61: 69-75 (2017) - [i27]L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen:
Algorithms and Bounds for Very Strong Rainbow Coloring. CoRR abs/1703.00236 (2017) - 2016
- [j72]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Separation Dimension of Graphs and Hypergraphs. Algorithmica 75(1): 187-204 (2016) - [j71]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): 443-446 (2016) - [c25]L. Sunil Chandran, Davis Issac, Sanming Zhou:
Hadwiger's Conjecture and Squares of Chordal Graphs. COCOON 2016: 417-428 - [c24]L. Sunil Chandran, Davis Issac, Andreas Karrenbauer:
On the Parameterized Complexity of Biclique Cover and Partition. IPEC 2016: 11:1-11:13 - [i26]L. Sunil Chandran, Davis Issac, Sanming Zhou:
An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs. CoRR abs/1603.03205 (2016) - 2015
- [j70]Jasine Babu, L. Sunil Chandran, Krishna Vaidyanathan:
Rainbow matchings in strongly edge-colored graphs. Discret. Math. 338(7): 1191-1196 (2015) - [j69]L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and cubicity of product graphs. Eur. J. Comb. 48: 100-109 (2015) - [j68]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: 110-126 (2015) - [j67]Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation Dimension of Bounded Degree Graphs. SIAM J. Discret. Math. 29(1): 59-64 (2015) - [i25]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
Sublinear Approximation Algorithms for Boxicity and Related Problems. CoRR abs/1505.04918 (2015) - 2014
- [j66]Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan:
Lower bounds for boxicity. Comb. 34(6): 631-655 (2014) - [j65]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
A constant factor approximation algorithm for boxicity of circular arc graphs. Discret. Appl. Math. 178: 1-18 (2014) - [j64]L. Sunil Chandran, Deepak Rajendraprasad, Nitin Singh:
On Additive Combinatorics of Permutations of ℤn. Discret. Math. Theor. Comput. Sci. 16(2): 35-40 (2014) - [j63]Abhijin Adiga, L. Sunil Chandran, Rogers Mathew:
Cubicity, degeneracy, and crossing number. Eur. J. Comb. 35: 2-12 (2014) - [j62]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number and Radius. Graphs Comb. 30(2): 275-285 (2014) - [j61]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number of Graph Power and Graph Products. Graphs Comb. 30(6): 1363-1382 (2014) - [j60]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): 1515-1539 (2014) - [j59]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-Connecting outerplanar graphs without blowing up the pathwidth. Theor. Comput. Sci. 554: 119-134 (2014) - [c23]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and Separation Dimension. WG 2014: 81-92 - [i24]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Naveen Sivadasan:
Approximating the Cubicity of Trees. CoRR abs/1402.6310 (2014) - [i23]L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar:
Rainbow Colouring of Split Graphs. CoRR abs/1404.4478 (2014) - [i22]Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation dimension of sparse graphs. CoRR abs/1404.4484 (2014) - [i21]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and separation dimension. CoRR abs/1404.4486 (2014) - [i20]Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation dimension of bounded degree graphs. CoRR abs/1407.5075 (2014) - 2013
- [j58]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma:
Product Dimension of Forests and Bounded Treewidth Graphs. Electron. J. Comb. 20(3): 42 (2013) - [j57]L. Sunil Chandran, Rogers Mathew:
Bipartite Powers of k-chordal Graphs. Discret. Math. Theor. Comput. Sci. 15(2): 49-58 (2013) - [j56]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Cubicity and Bandwidth. Graphs Comb. 29(1): 45-69 (2013) - [j55]L. Sunil Chandran, Rajesh Hemant Chitnis, Ramanjit Kumar:
On the SIG-Dimension of Trees Under the L ∞-Metric. Graphs Comb. 29(4): 773-794 (2013) - [c22]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. COCOON 2013: 626-637 - [c21]L. Sunil Chandran, Deepak Rajendraprasad:
Inapproximability of Rainbow Colouring. FSTTCS 2013: 153-162 - [i19]L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and Cubicity of Product Graphs. CoRR abs/1305.5233 (2013) - 2012
- [j54]Xueliang Li, Sujuan Liu, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Rainbow Connection Number and Connectivity. Electron. J. Comb. 19(1): 20 (2012) - [j53]Manu Basavaraju, L. Sunil Chandran, T. Karthick:
Maximum weight independent sets in hole- and dart-free graphs. Discret. Appl. Math. 160(16-17): 2364-2369 (2012) - [j52]Manu Basavaraju, L. Sunil Chandran:
Acyclic edge coloring of 2-degenerate graphs. J. Graph Theory 69(1): 1-27 (2012) - [j51]L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow connection number and connected dominating sets. J. Graph Theory 71(2): 206-218 (2012) - [j50]Manu Basavaraju, L. Sunil Chandran:
Acyclic Edge Coloring of Triangle-Free Planar Graphs. J. Graph Theory 71(4): 365-385 (2012) - [c20]L. Sunil Chandran, Deepak Rajendraprasad:
Rainbow Colouring of Split and Threshold Graphs. COCOON 2012: 181-192 - [c19]Abhijin Adiga, L. Sunil Chandran:
Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions. SCG 2012: 387-396 - [c18]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
Polynomial Time and Parameterized Approximation Algorithms for Boxicity. IPEC 2012: 135-146 - [i18]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
Parameterized and Approximation Algorithms for Boxicity. CoRR abs/1201.5958 (2012) - [i17]L. Sunil Chandran, Deepak Rajendraprasad:
Rainbow Colouring of Split and Threshold Graphs. CoRR abs/1205.1670 (2012) - [i16]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma:
Product Dimension of Forests and Bounded Treewidth Graphs. CoRR abs/1209.2218 (2012) - [i15]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. CoRR abs/1212.6382 (2012) - 2011
- [j49]L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan:
Boxicity of line graphs. Discret. Math. 311(21): 2359-2367 (2011) - [j48]L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow Connection Number and Connected Dominating Sets. Electron. Notes Discret. Math. 38: 239-244 (2011) - [j47]L. Sunil Chandran, Mathew C. Francis, Rogers Mathew:
Boxicity of Leaf Powers. Graphs Comb. 27(1): 61-72 (2011) - [j46]L. Sunil Chandran, Mathew C. Francis, Rogers Mathew:
Chordal Bipartite Graphs with High Boxicity. Graphs Comb. 27(3): 353-362 (2011) - [j45]Diptendu Bhowmick, L. Sunil Chandran:
Boxicity of Circular Arc Graphs. Graphs Comb. 27(6): 769-783 (2011) - [j44]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): 463-478 (2011) - [j43]Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran:
Boxicity and Poset Dimension. SIAM J. Discret. Math. 25(4): 1687-1698 (2011) - [c17]Abhijin Adiga, L. Sunil Chandran, Rogers Mathew:
Cubicity, Degeneracy, and Crossing Number. FSTTCS 2011: 176-190 - [c16]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. WADS 2011: 13-24 - [i14]Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. CoRR abs/1102.1544 (2011) - [i13]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number of Graph Power and Graph Products. CoRR abs/1104.4190 (2011) - [i12]Abhijin Adiga, L. Sunil Chandran, Rogers Mathew:
Cubicity, Degeneracy, and Crossing Number. CoRR abs/1105.5225 (2011) - 2010
- [j42]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) - [j41]Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran:
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. Discret. Appl. Math. 158(16): 1719-1726 (2010) - [j40]Diptendu Bhowmick, L. Sunil Chandran:
Boxicity and cubicity of asteroidal triple free graphs. Discret. Math. 310(10-11): 1536-1543 (2010) - [j39]Manu Basavaraju, L. Sunil Chandran, Manoj Kummini:
d-Regular graphs of acyclic chromatic index at least d+2. J. Graph Theory 63(3): 226-230 (2010) - [j38]Abhijin Adiga, L. Sunil Chandran:
Cubicity of interval graphs and the claw number. J. Graph Theory 65(4): 323-333 (2010) - [c15]Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran:
Boxicity and Poset Dimension. COCOON 2010: 3-12 - [i11]Manu Basavaraju, L. Sunil Chandran:
Acyclic Edge Coloring of Triangle Free Planar Graphs. CoRR abs/1007.2282 (2010) - [i10]L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan:
Boxicity of Line Graphs. CoRR abs/1009.4471 (2010) - [i9]L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow Connection Number and Connected Dominating Sets. CoRR abs/1010.2296 (2010) - [i8]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number and Radius. CoRR abs/1011.0620 (2010)
2000 – 2009
- 2009
- [j37]L. Sunil Chandran, N. S. Narayanaswamy:
On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts. Ars Comb. 92 (2009) - [j36]B. V. Subramanya Bharadwaj, L. Sunil Chandran:
Bounds on isoperimetric values of trees. Discret. Math. 309(4): 834-842 (2009) - [j35]L. Sunil Chandran, Anita Das, Chintan D. Shah:
Cubicity, boxicity, and vertex cover. Discret. Math. 309(8): 2488-2496 (2009) - [j34]L. Sunil Chandran, K. Ashik Mathew:
An upper bound for Cubicity in terms of Boxicity. Discret. Math. 309(8): 2571-2574 (2009) - [j33]L. Sunil Chandran, Mathew C. Francis, Santhosh Suresh:
Boxicity of Halin graphs. Discret. Math. 309(10): 3233-3237 (2009) - [j32]Manu Basavaraju, L. Sunil Chandran:
A note on acyclic edge coloring of complete bipartite graphs. Discret. Math. 309(13): 4646-4648 (2009) - [j31]Naveen Belkale, L. Sunil Chandran:
Hadwiger's conjecture for proper circular arc graphs. Eur. J. Comb. 30(4): 946-956 (2009) - [j30]Abhijin Adiga, L. Sunil Chandran:
Cubicity of Interval Graphs and the Claw Number. Electron. Notes Discret. Math. 34: 471-475 (2009) - [j29]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
On the Cubicity of Interval Graphs. Graphs Comb. 25(2): 169-179 (2009) - [j28]N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran:
On the Structure of Contractible Edges in k-connected Partial k-trees. Graphs Comb. 25(4): 557-569 (2009) - [j27]L. Sunil Chandran, Anita Das, Naveen Sivadasan:
On the cubicity of bipartite graphs. Inf. Process. Lett. 109(9): 432-435 (2009) - [j26]Manu Basavaraju, L. Sunil Chandran:
Acyclic edge coloring of graphs with maximum degree 4. J. Graph Theory 61(3): 192-209 (2009) - [c14]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 - [i7]Manu Basavaraju, L. Sunil Chandran:
Acyclic Edge coloring of Planar Graphs. CoRR abs/0908.2237 (2009) - [i6]L. Sunil Chandran, Rajesh Chitnis, Ramanjit Kumar:
On the SIG dimension of trees under $L_{\infty}$ metric. CoRR abs/0910.5380 (2009) - 2008
- [j25]L. Sunil Chandran, Naveen Sivadasan:
The cubicity of hypercube graphs. Discret. Math. 308(23): 5795-5800 (2008) - [j24]Manu Basavaraju, L. Sunil Chandran:
Acyclic edge coloring of subcubic graphs. Discret. Math. 308(24): 6650-6653 (2008) - [j23]L. Sunil Chandran, Alexandr V. Kostochka, J. Krishnam Raju:
Hadwiger Number and the Cartesian Product of Graphs. Graphs Comb. 24(4): 291-301 (2008) - [j22]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Boxicity and maximum degree. J. Comb. Theory B 98(2): 443-445 (2008) - [c13]L. Sunil Chandran, Mathew C. Francis, Rogers Mathew:
Finding a Box Representation for a Graph in O(n2Δ2lnn) Time. ICIT 2008: 3-8 - [c12]B. V. Subramanya Bharadwaj, L. Sunil Chandran, Anita Das:
Isoperimetric Problem and Meta-Fibonacci Sequences. COCOON 2008: 22-30 - [i5]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
On the cubicity of AT-free graphs and circular-arc graphs. CoRR abs/0803.3670 (2008) - [i4]L. Sunil Chandran, Anita Das, Naveen Sivadasan:
On the cubicity of bipartite graphs. CoRR abs/0810.2697 (2008) - 2007
- [j21]L. Sunil Chandran, Naveen Sivadasan:
On the Hadwiger's conjecture for graph products. Discret. Math. 307(2): 266-273 (2007) - [j20]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
On the Cubicity of Interval Graphs. Electron. Notes Discret. Math. 29: 315-319 (2007) - [j19]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) - [j18]L. Sunil Chandran, Naveen Sivadasan:
Boxicity and treewidth. J. Comb. Theory B 97(5): 733-744 (2007) - [j17]Carlo Mannino, Gianpaolo Oriolo, Federico Ricci-Tersenghi, L. Sunil Chandran:
The stable set problem and the thinness of a graph. Oper. Res. Lett. 35(1): 1-9 (2007) - [j16]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) - [c11]K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar:
A Combinatorial Family of Near Regular LDPC Codes. ISIT 2007: 761-765 - 2006
- [j15]L. Sunil Chandran, Fabrizio Grandoni:
A linear time algorithm to list the minimal separators of chordal graphs. Discret. Math. 306(3): 351-358 (2006) - [j14]L. Sunil Chandran, Telikepalli Kavitha:
The treewidth and pathwidth of hypercubes. Discret. Math. 306(3): 359-365 (2006) - [j13]Ankur Bohra, L. Sunil Chandran, J. Krishnam Raju:
Boxicity of series-parallel graphs. Discret. Math. 306(18): 2219-2221 (2006) - [j12]L. Sunil Chandran, Telikepalli Kavitha:
The carvingwidth of hypercubes. Discret. Math. 306(18): 2270-2274 (2006) - [c10]L. Sunil Chandran, Naveen Sivadasan:
Geometric Representation of Graphs in Low Dimension. COCOON 2006: 398-407 - [c9]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 - [i3]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Geometric representation of graphs in low dimension. CoRR abs/cs/0605013 (2006) - [i2]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Representing graphs as the intersection of axis-parallel cubes. CoRR abs/cs/0607092 (2006) - [i1]K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar:
A Combinatorial Family of Near Regular LDPC Codes. CoRR abs/cs/0609146 (2006) - 2005
- [j11]L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian:
Graphs of low chordality. Discret. Math. Theor. Comput. Sci. 7(1): 25-36 (2005) - [j10]L. Sunil Chandran, Naveen Sivadasan:
On the Hadwiger number of hypercubes and its generalizations. Electron. Notes Discret. Math. 19: 155-161 (2005) - [j9]L. Sunil Chandran, Fabrizio Grandoni:
Refined memorization for vertex cover. Inf. Process. Lett. 93(3): 123-131 (2005) - [j8]L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo:
On the cubicity of certain graphs. Inf. Process. Lett. 94(3): 113-118 (2005) - [j7]L. Sunil Chandran, C. R. Subramanian:
Girth and treewidth. J. Comb. Theory B 93(1): 23-32 (2005) - 2004
- [j6]L. Sunil Chandran:
Minimum cuts, girth and a spectral threshold. Inf. Process. Lett. 89(3): 105-110 (2004) - [j5]L. Sunil Chandran, L. Shankar Ram:
On the Number of Minimum Cuts in a Graph. SIAM J. Discret. Math. 18(1): 177-194 (2004) - [c8]L. Sunil Chandran, N. S. Narayanaswamy:
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. COCOON 2004: 151-160 - [c7]L. Sunil Chandran, Fabrizio Grandoni:
Refined Memorisation for Vertex Cover. IWPEC 2004: 61-70 - 2003
- [j4]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) - [j3]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) - [j2]L. Sunil Chandran:
A High Girth Graph Construction. SIAM J. Discret. Math. 16(3): 366-370 (2003) - [j1]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) - [c6]L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian:
Isoperimetric Inequalities and the Width Parameters of Graphs. COCOON 2003: 385-393 - 2002
- [c5]L. Sunil Chandran, L. Shankar Ram:
On the Number of Minimum Cuts in a Graph. COCOON 2002: 220-229 - [c4]L. Sunil Chandran, L. Shankar Ram:
Approximations for ATSP with Parametrized Triangle Inequality. STACS 2002: 227-237 - 2001
- [c3]L. Sunil Chandran:
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph. COCOON 2001: 308-317 - [c2]L. Sunil Chandran:
Edge Connectivity vs Vertex Connectivity in Chordal Graphs. COCOON 2001: 384-389
1990 – 1999
- 1999
- [c1]L. Sunil Chandran:
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles. FSTTCS 1999: 283-290
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
