L. Sunil Chandran

175 papers A* 1A 3B 8C 1Misc 11Journal 137Unranked 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Boxicity and cubicity of a subclass of divisor graphs and power graphs of cyclic groups.
Discret. Math.
L. Sunil Chandran, Jinia Ghosh
2026 — conf
Localization: A Framework to Generalize Extremal Graph Problems.
CALDAM
Rajat Adak, L. Sunil Chandran
2026 J jnl
Off-diagonal Rado number for x+y+c=z and x+qy=z.
CoRR
Rajat Adak, Yash Bakshi, L. Sunil Chandran, Saraswati Girish Nanoti
2026 J jnl
On the smallest antichain that generates an ideal of a given size.
J. Comb. Theory, Ser. A
L. Sunil Chandran, Rishikesh Gajjala, Kuldeep S. Meel
2025 J jnl
Boxicity of Zero Divisor Graphs.
CoRR
L. Sunil Chandran, Suraj Kumar Sahoo
2025 J jnl
CNFs and DNFs with Exactly
CoRR
L. Sunil Chandran, Rishikesh Gajjala, Kuldeep S. Meel
2025 A conf
CNFs and DNFs with Exactly k Solutions.
SAT
L. Sunil Chandran, Rishikesh Gajjala, Kuldeep S. Meel
2025 J jnl
List recoloring of planar graphs.
Discret. Appl. Math.
L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan
2025 J jnl
Localized Clique Bounds in Bounded-Degree and Bounded-Path Graphs.
CoRR
Rajat Adak, L. Sunil Chandran
2025 J jnl
Variants of the Gyárfás-Sumner conjecture: Oriented trees and rainbow paths.
J. Graph Theory
Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Karthik Murali
2025 J jnl
Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles.
CoRR
Rajat Adak, L. Sunil Chandran
2025 J jnl
Vertex-Based Localization of Turán's Theorem.
CoRR
Rajat Adak, L. Sunil Chandran
2025 J jnl
Vertex-Based Localization of generalized Turán Problems.
CoRR
Rajat Adak, L. Sunil Chandran
2024 J jnl
Graph-theoretic insights on the constructability of complex entangled states.
Quantum
L. Sunil Chandran, Rishikesh Gajjala
2024 B conf
Krenn-Gu Conjecture for Sparse Graphs.
MFCS
L. Sunil Chandran, Rishikesh Gajjala, Abraham M. Illickan
2024 J jnl
Krenn-Gu conjecture for sparse graphs.
CoRR
L. Sunil Chandran, Rishikesh Gajjala, Abraham M. Illickan
2024 J jnl
New bounds on the anti-Ramsey numbers of star graphs via maximum edge
Discret. Math.
L. Sunil Chandran, Talha Hashim, Dalu Jacob, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh
2024 — conf
Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness.
LATIN (1)
Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob
2024 — conf
Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery Using Drones.
FSTTCS
L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra, Saladi Rahul
2024 J jnl
Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones.
CoRR
L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra, Saladi Rahul
2024 J jnl
Weakening Total Coloring Conjecture: Weak TCC and Hadwiger's Conjecture on Total Graphs.
Electron. J. Comb.
Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Ankur Naskar
2024 J jnl
s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs.
Discret. Appl. Math.
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
2023 J jnl
Graph-theoretic insights on the constructability of complex entangled states.
CoRR
L. Sunil Chandran, Rishikesh Gajjala
2023 J jnl
Template-driven rainbow coloring of proper interval graphs.
Discret. Appl. Math.
L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai
2023 J jnl
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness.
CoRR
Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob
2023 J jnl
χ-binding functions for squares of bipartite graphs and its subclasses.
CoRR
Dibyayan Chakraborty, L. Sunil Chandran, Dalu Jacob, Raji R. Pillai
2022 J jnl
Improved approximation for maximum edge colouring problem.
Discret. Appl. Math.
L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh
2022 J jnl
On graphs whose eternal vertex cover number and vertex cover number coincide.
Discret. Appl. Math.
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
2022 J jnl
Perfect Matchings and Quantum Physics: Progress on Krenn's Conjecture.
CoRR
L. Sunil Chandran, Rishikesh Gajjala
2022 J jnl
Towards a conjecture on the recoloring diameter of planar graphs.
CoRR
L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan
2022 J jnl
Upper bounding rainbow connection number by forest number.
Discret. Math.
L. Sunil Chandran, Davis Issac, Juho Lauri, Erik Jan van Leeuwen
2022 B conf
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs.
WG
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
2022 J jnl
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs.
CoRR
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
2021 C conf
Algorithms and Complexity of s-Club Cluster Vertex Deletion.
IWOCA
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
2021 — conf
Template-Driven Rainbow Coloring of Proper Interval Graphs.
CALDAM
L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai
2021 J jnl
Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths.
CoRR
Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Karthik Murali
2020 A conf
Combinatorial Lower Bounds for 3-Query LDCs.
ITCS
Arnab Bhattacharyya, L. Sunil Chandran, Suprovat Ghoshal
2020 — conf
List Distinguishing Number of p
CALDAM
L. Sunil Chandran, Sajith Padinhatteeri, Karthik Ravi Shankar
2019 J jnl
Combinatorial lower bounds for 3-query LDCs.
CoRR
Arnab Bhattacharyya, L. Sunil Chandran, Suprovat Ghoshal
2019 J jnl
Hadwiger's conjecture for squares of 2-trees.
Eur. J. Comb.
L. Sunil Chandran, Davis Issac, Sanming Zhou
2019 J jnl
Improved Approximation for Maximum Edge Colouring Problem.
CoRR
L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh
2019 — conf
On Graphs with Minimal Eternal Vertex Cover Number.
CALDAM
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
2019 J jnl
On induced colourful paths in triangle-free graphs.
Discret. Appl. Math.
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis
2018 B conf
Algorithms and Bounds for Very Strong Rainbow Coloring.
LATIN
L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
2018 J jnl
Approximation bounds on maximum edge 2-coloring of dense graphs.
CoRR
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh
2018 J jnl
On Eulerian orientations of even-degree hypercubes.
Oper. Res. Lett.
Maxwell Levit, L. Sunil Chandran, Joseph Cheriyan
2018 J jnl
On Graphs with Minimal Eternal Vertex Cover Number.
CoRR
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
2018 A* conf
Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition.
ICALP
L. Sunil Chandran, Yun Kuen Cheung, Davis Issac
2018 J jnl
Spanning Tree Congestion and Computation of Generalized Győri-Lov{á}sz Partition.
CoRR
L. Sunil Chandran, Yun Kuen Cheung, Davis Issac
2018 J jnl
Sublinear approximation algorithms for boxicity and related problems.
Discret. Appl. Math.
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
2017 J jnl
Algorithms and Bounds for Very Strong Rainbow Coloring.
CoRR
L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
2017 J jnl
On Induced Colourful Paths in Triangle-free Graphs.
Electron. Notes Discret. Math.
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis
2017 J jnl
Rainbow colouring of split graphs.
Discret. Appl. Math.
L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar
2016 J jnl
An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs.
CoRR
L. Sunil Chandran, Davis Issac, Sanming Zhou
2016 Misc conf
Hadwiger's Conjecture and Squares of Chordal Graphs.
COCOON
L. Sunil Chandran, Davis Issac, Sanming Zhou
2016 B conf
On the Parameterized Complexity of Biclique Cover and Partition.
IPEC
L. Sunil Chandran, Davis Issac, Andreas Karrenbauer
2016 J jnl
Separation Dimension of Graphs and Hypergraphs.
Algorithmica
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
2016 J jnl
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number.
Discret. Math.
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
2015 J jnl
Boxicity and cubicity of product graphs.
Eur. J. Comb.
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad
2015 J jnl
Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs.
Eur. J. Comb.
Jasine Babu, L. Sunil Chandran, Deepak Rajendraprasad
2015 J jnl
Rainbow matchings in strongly edge-colored graphs.
Discret. Math.
Jasine Babu, L. Sunil Chandran, Krishna Vaidyanathan
2015 J jnl
Separation Dimension of Bounded Degree Graphs.
SIAM J. Discret. Math.
Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
2015 J jnl
Sublinear Approximation Algorithms for Boxicity and Related Problems.
CoRR
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
2014 J jnl
2-Connecting outerplanar graphs without blowing up the pathwidth.
Theor. Comput. Sci.
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad
2014 J jnl
A constant factor approximation algorithm for boxicity of circular arc graphs.
Discret. Appl. Math.
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
2014 J jnl
Approximating the Cubicity of Trees.
CoRR
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Naveen Sivadasan
2014 B conf
Boxicity and Separation Dimension.
WG
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
2014 J jnl
Boxicity and separation dimension.
CoRR
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
2014 J jnl
Cubicity, degeneracy, and crossing number.
Eur. J. Comb.
Abhijin Adiga, L. Sunil Chandran, Rogers Mathew
2014 J jnl
Lower bounds for boxicity.
Comb.
Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan
2014 J jnl
On Additive Combinatorics of Permutations of ℤ
Discret. Math. Theor. Comput. Sci.
L. Sunil Chandran, Deepak Rajendraprasad, Nitin Singh
2014 J jnl
Rainbow Colouring of Split Graphs.
CoRR
L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar
2014 J jnl
Rainbow Connection Number and Radius.
Graphs Comb.
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy
2014 J jnl
Rainbow Connection Number of Graph Power and Graph Products.
Graphs Comb.
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy
2014 J jnl
Representing a Cubic Graph as the Intersection Graph of Axis-Parallel Boxes in Three Dimensions.
SIAM J. Discret. Math.
Abhijin Adiga, L. Sunil Chandran
2014 J jnl
Separation dimension of bounded degree graphs.
CoRR
Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
2014 J jnl
Separation dimension of sparse graphs.
CoRR
Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
2013 Misc conf
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth.
COCOON
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad
2013 J jnl
Bipartite Powers of k-chordal Graphs.
Discret. Math. Theor. Comput. Sci.
L. Sunil Chandran, Rogers Mathew
2013 J jnl
Boxicity and Cubicity of Product Graphs
CoRR
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad
2013 J jnl
Cubicity and Bandwidth.
Graphs Comb.
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2013 — conf
Inapproximability of Rainbow Colouring.
FSTTCS
L. Sunil Chandran, Deepak Rajendraprasad
2013 J jnl
On the SIG-Dimension of Trees Under the L ∞-Metric.
Graphs Comb.
L. Sunil Chandran, Rajesh Hemant Chitnis, Ramanjit Kumar
2013 J jnl
Product Dimension of Forests and Bounded Treewidth Graphs.
Electron. J. Comb.
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma
2012 J jnl
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth
CoRR
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad
2012 J jnl
Acyclic Edge Coloring of Triangle-Free Planar Graphs.
J. Graph Theory
Manu Basavaraju, L. Sunil Chandran
2012 J jnl
Acyclic edge coloring of 2-degenerate graphs.
J. Graph Theory
Manu Basavaraju, L. Sunil Chandran
2012 J jnl
Maximum weight independent sets in hole- and dart-free graphs.
Discret. Appl. Math.
Manu Basavaraju, L. Sunil Chandran, T. Karthick
2012 J jnl
Parameterized and Approximation Algorithms for Boxicity
CoRR
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
2012 B conf
Polynomial Time and Parameterized Approximation Algorithms for Boxicity.
IPEC
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
2012 J jnl
Product Dimension of Forests and Bounded Treewidth Graphs
CoRR
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma
2012 J jnl
Rainbow Colouring of Split and Threshold Graphs
CoRR
L. Sunil Chandran, Deepak Rajendraprasad
2012 Misc conf
Rainbow Colouring of Split and Threshold Graphs.
COCOON
L. Sunil Chandran, Deepak Rajendraprasad
2012 J jnl
Rainbow Connection Number and Connectivity.
Electron. J. Comb.
Xueliang Li, Sujuan Liu, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
2012 J jnl
Rainbow connection number and connected dominating sets.
J. Graph Theory
L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma
2012 — conf
Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions.
SCG
Abhijin Adiga, L. Sunil Chandran
2011 J jnl
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs
CoRR
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
2011 B conf
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs.
WADS
Abhijin Adiga, Jasine Babu, L. Sunil Chandran
2011 J jnl
Acyclic Edge-Coloring of Planar Graphs.
SIAM J. Discret. Math.
Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller
2011 J jnl
Boxicity and Poset Dimension.
SIAM J. Discret. Math.
Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran
2011 J jnl
Boxicity of Circular Arc Graphs.
Graphs Comb.
Diptendu Bhowmick, L. Sunil Chandran
2011 J jnl
Boxicity of Leaf Powers.
Graphs Comb.
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
2011 J jnl
Boxicity of line graphs.
Discret. Math.
L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan
2011 J jnl
Chordal Bipartite Graphs with High Boxicity.
Graphs Comb.
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
2011 J jnl
Cubicity, Degeneracy, and Crossing Number
CoRR
Abhijin Adiga, L. Sunil Chandran, Rogers Mathew
2011 — conf
Cubicity, Degeneracy, and Crossing Number.
FSTTCS
Abhijin Adiga, L. Sunil Chandran, Rogers Mathew
2011 J jnl
Rainbow Connection Number and Connected Dominating Sets.
Electron. Notes Discret. Math.
L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma
2011 J jnl
Rainbow Connection Number of Graph Power and Graph Products.
CoRR
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy
2010 J jnl
Acyclic Edge Coloring of Triangle Free Planar Graphs
CoRR
Manu Basavaraju, L. Sunil Chandran
2010 Misc conf
Boxicity and Poset Dimension.
COCOON
Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran
2010 J jnl
Boxicity and cubicity of asteroidal triple free graphs.
Discret. Math.
Diptendu Bhowmick, L. Sunil Chandran
2010 J jnl
Boxicity of Line Graphs
CoRR
L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan
2010 J jnl
Cubicity of interval graphs and the claw number.
J. Graph Theory
Abhijin Adiga, L. Sunil Chandran
2010 J jnl
Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes.
Algorithmica
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2010 J jnl
Rainbow Connection Number and Connected Dominating Sets.
CoRR
L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma
2010 J jnl
Rainbow Connection Number and Radius
CoRR
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy
2010 J jnl
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph.
Discret. Appl. Math.
Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran
2009 J jnl
A note on acyclic edge coloring of complete bipartite graphs.
Discret. Math.
Manu Basavaraju, L. Sunil Chandran
2009 J jnl
Acyclic Edge coloring of Planar Graphs
CoRR
Manu Basavaraju, L. Sunil Chandran
2009 J jnl
Acyclic edge coloring of graphs with maximum degree 4.
J. Graph Theory
Manu Basavaraju, L. Sunil Chandran
2009 J jnl
An upper bound for Cubicity in terms of Boxicity.
Discret. Math.
L. Sunil Chandran, K. Ashik Mathew
2009 J jnl
Bounds on isoperimetric values of trees.
Discret. Math.
B. V. Subramanya Bharadwaj, L. Sunil Chandran
2009 J jnl
Boxicity of Halin graphs.
Discret. Math.
L. Sunil Chandran, Mathew C. Francis, Santhosh Suresh
2009 J jnl
Cubicity of Interval Graphs and the Claw Number.
Electron. Notes Discret. Math.
Abhijin Adiga, L. Sunil Chandran
2009 J jnl
Cubicity, boxicity, and vertex cover.
Discret. Math.
L. Sunil Chandran, Anita Das, Chintan D. Shah
2009 J jnl
Hadwiger's conjecture for proper circular arc graphs.
Eur. J. Comb.
Naveen Belkale, L. Sunil Chandran
2009 J jnl
On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts.
Ars Comb.
L. Sunil Chandran, N. S. Narayanaswamy
2009 — conf
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs.
Graph Theory, Computational Intelligence and Thought
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2009 J jnl
On the Cubicity of Interval Graphs.
Graphs Comb.
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2009 J jnl
On the SIG dimension of trees under $L_{\infty}$ metric.
CoRR
L. Sunil Chandran, Rajesh Chitnis, Ramanjit Kumar
2009 J jnl
On the Structure of Contractible Edges in
Graphs Comb.
N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran
2009 J jnl
On the cubicity of bipartite graphs.
Inf. Process. Lett.
L. Sunil Chandran, Anita Das, Naveen Sivadasan
2008 J jnl
Acyclic edge coloring of subcubic graphs.
Discret. Math.
Manu Basavaraju, L. Sunil Chandran
2008 J jnl
Boxicity and maximum degree.
J. Comb. Theory B
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2008 — conf
Finding a Box Representation for a Graph in O(n
ICIT
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
2008 J jnl
Hadwiger Number and the Cartesian Product of Graphs.
Graphs Comb.
L. Sunil Chandran, Alexandr V. Kostochka, J. Krishnam Raju
2008 Misc conf
Isoperimetric Problem and Meta-Fibonacci Sequences.
COCOON
B. V. Subramanya Bharadwaj, L. Sunil Chandran, Anita Das
2008 J jnl
On the cubicity of AT-free graphs and circular-arc graphs
CoRR
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2008 J jnl
On the cubicity of bipartite graphs
CoRR
L. Sunil Chandran, Anita Das, Naveen Sivadasan
2008 J jnl
The cubicity of hypercube graphs.
Discret. Math.
L. Sunil Chandran, Naveen Sivadasan
2007 B conf
A Combinatorial Family of Near Regular LDPC Codes.
ISIT
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
2007 J jnl
A note on the Hadwiger number of circular arc graphs.
Inf. Process. Lett.
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chandran, Naveen Sivadasan
2007 J jnl
Boxicity and treewidth.
J. Comb. Theory B
L. Sunil Chandran, Naveen Sivadasan
2007 J jnl
On the Cubicity of Interval Graphs.
Electron. Notes Discret. Math.
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2007 J jnl
On the Hadwiger's conjecture for graph products.
Discret. Math.
L. Sunil Chandran, Naveen Sivadasan
2007 J jnl
On the relationship between ATSP and the cycle cover problem.
Theor. Comput. Sci.
L. Sunil Chandran, L. Shankar Ram
2007 J jnl
The stable set problem and the thinness of a graph.
Oper. Res. Lett.
Carlo Mannino, Gianpaolo Oriolo, Federico Ricci-Tersenghi, L. Sunil Chandran
2006 J jnl
A Combinatorial Family of Near Regular LDPC Codes
CoRR
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
2006 J jnl
A linear time algorithm to list the minimal separators of chordal graphs.
Discret. Math.
L. Sunil Chandran, Fabrizio Grandoni
2006 J jnl
Boxicity of series-parallel graphs.
Discret. Math.
Ankur Bohra, L. Sunil Chandran, J. Krishnam Raju
2006 Misc conf
Geometric Representation of Graphs in Low Dimension.
COCOON
L. Sunil Chandran, Naveen Sivadasan
2006 J jnl
Geometric representation of graphs in low dimension
CoRR
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2006 — conf
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs.
FSTTCS
K. Murali Krishnan, L. Sunil Chandran
2006 J jnl
Representing graphs as the intersection of axis-parallel cubes
CoRR
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2006 J jnl
The carvingwidth of hypercubes.
Discret. Math.
L. Sunil Chandran, Telikepalli Kavitha
2006 J jnl
The treewidth and pathwidth of hypercubes.
Discret. Math.
L. Sunil Chandran, Telikepalli Kavitha
2005 J jnl
Girth and treewidth.
J. Comb. Theory B
L. Sunil Chandran, C. R. Subramanian
2005 J jnl
Graphs of low chordality.
Discret. Math. Theor. Comput. Sci.
L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian
2005 J jnl
On the Hadwiger number of hypercubes and its generalizations.
Electron. Notes Discret. Math.
L. Sunil Chandran, Naveen Sivadasan
2005 J jnl
On the cubicity of certain graphs.
Inf. Process. Lett.
L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo
2005 J jnl
Refined memorization for vertex cover.
Inf. Process. Lett.
L. Sunil Chandran, Fabrizio Grandoni
2004 J jnl
Minimum cuts, girth and a spectral threshold.
Inf. Process. Lett.
L. Sunil Chandran
2004 Misc conf
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts.
COCOON
L. Sunil Chandran, N. S. Narayanaswamy
2004 J jnl
On the Number of Minimum Cuts in a Graph.
SIAM J. Discret. Math.
L. Sunil Chandran, L. Shankar Ram
2004 — conf
Refined Memorisation for Vertex Cover.
IWPEC
L. Sunil Chandran, Fabrizio Grandoni
2003 J jnl
A High Girth Graph Construction.
SIAM J. Discret. Math.
L. Sunil Chandran
2003 J jnl
A lower bound for the hitting set size for combinatorial rectangles and an application.
Inf. Process. Lett.
L. Sunil Chandran
2003 J jnl
A spectral lower bound for the treewidth of a graph and its consequences.
Inf. Process. Lett.
L. Sunil Chandran, C. R. Subramanian
2003 J jnl
Generating and characterizing the perfect elimination orderings of a chordal graph.
Theor. Comput. Sci.
L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada
2003 Misc conf
Isoperimetric Inequalities and the Width Parameters of Graphs.
COCOON
L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian
2002 A conf
Approximations for ATSP with Parametrized Triangle Inequality.
STACS
L. Sunil Chandran, L. Shankar Ram
2002 Misc conf
On the Number of Minimum Cuts in a Graph.
COCOON
L. Sunil Chandran, L. Shankar Ram
2001 Misc conf
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph.
COCOON
L. Sunil Chandran
2001 Misc conf
Edge Connectivity vs Vertex Connectivity in Chordal Graphs.
COCOON
L. Sunil Chandran
1999 — conf
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles.
FSTTCS
L. Sunil Chandran