A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles. - L. Sunil Chandran (FSTTCS, 1999)

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

Edge Connectivity vs Vertex Connectivity in Chordal Graphs. - L. Sunil Chandran (COCOON, 2001)

Approximations for ATSP with Parametrized Triangle Inequality. - L. Sunil Chandran; L. Shankar Ram (STACS, 2002)

Isoperimetric Inequalities and the Width Parameters of Graphs. - L. Sunil Chandran; Telikepalli Kavitha; C. R. Subramanian 001 (COCOON, 2003)

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

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

A High Girth Graph Construction. - L. Sunil Chandran (SIAM J. Discret. Math., 2003)

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

Refined Memorisation for Vertex Cover. - L. Sunil Chandran; Fabrizio Grandoni 001 (IWPEC, 2004)

Minimum cuts, girth and a spectral threshold. - L. Sunil Chandran (Inf. Process. Lett., 2004)

On the Number of Minimum Cuts in a Graph. - L. Sunil Chandran; L. Shankar Ram (SIAM J. Discret. Math., 2004)

Graphs of low chordality. - L. Sunil Chandran; Vadim V. Lozin; C. R. Subramanian 001 (Discret. Math. Theor. Comput. Sci., 2005)

On the Hadwiger number of hypercubes and its generalizations. - L. Sunil Chandran; Naveen Sivadasan (Electron. Notes Discret. Math., 2005)

Refined memorization for vertex cover. - L. Sunil Chandran; Fabrizio Grandoni 001 (Inf. Process. Lett., 2005)

On the cubicity of certain graphs. - L. Sunil Chandran; Carlo Mannino; Gianpaolo Oriolo (Inf. Process. Lett., 2005)

Girth and treewidth. - L. Sunil Chandran; C. R. Subramanian 001 (J. Comb. Theory B, 2005)

Geometric Representation of Graphs in Low Dimension. - L. Sunil Chandran; Naveen Sivadasan (COCOON, 2006)

Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. - K. Murali Krishnan 001; L. Sunil Chandran (FSTTCS, 2006)

Geometric representation of graphs in low dimension - L. Sunil Chandran; Mathew C. Francis; Naveen Sivadasan (CoRR, 2006)

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

Boxicity of series-parallel graphs. - Ankur Bohra; L. Sunil Chandran; J. Krishnam Raju (Discret. Math., 2006)

A linear time algorithm to list the minimal separators of chordal graphs. - L. Sunil Chandran; Fabrizio Grandoni 001 (Discret. Math., 2006)

The treewidth and pathwidth of hypercubes. - L. Sunil Chandran; Telikepalli Kavitha (Discret. Math., 2006)

The carvingwidth of hypercubes. - L. Sunil Chandran; Telikepalli Kavitha (Discret. Math., 2006)

A Combinatorial Family of Near Regular LDPC Codes. - K. Murali Krishnan 001; Rajdeep Singh; L. Sunil Chandran; Priti Shankar (ISIT, 2007)

On the Hadwiger's conjecture for graph products. - L. Sunil Chandran; Naveen Sivadasan (Discret. Math., 2007)

On the Cubicity of Interval Graphs. - L. Sunil Chandran; Mathew C. Francis; Naveen Sivadasan (Electron. Notes Discret. Math., 2007)

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

Boxicity and treewidth. - L. Sunil Chandran; Naveen Sivadasan (J. Comb. Theory B, 2007)

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

On the relationship between ATSP and the cycle cover problem. - L. Sunil Chandran; L. Shankar Ram (Theor. Comput. Sci., 2007)

Finding a Box Representation for a Graph in O(n2Δ2lnn) Time. - L. Sunil Chandran; Mathew C. Francis; Rogers Mathew (ICIT, 2008)

Isoperimetric Problem and Meta-Fibonacci Sequences. - B. V. Subramanya Bharadwaj; L. Sunil Chandran; Anita Das 001 (COCOON, 2008)

Acyclic edge coloring of subcubic graphs. - Manu Basavaraju; L. Sunil Chandran (Discret. Math., 2008)

The cubicity of hypercube graphs. - L. Sunil Chandran; Naveen Sivadasan (Discret. Math., 2008)

Hadwiger Number and the Cartesian Product of Graphs. - L. Sunil Chandran; Alexandr V. Kostochka; J. Krishnam Raju (Graphs Comb., 2008)

Boxicity and maximum degree. - L. Sunil Chandran; Mathew C. Francis; Naveen Sivadasan (J. Comb. Theory B, 2008)

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, 2009)

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

On the SIG dimension of trees under $L_{ infty}$ metric. - L. Sunil Chandran; Rajesh Chitnis; Ramanjit Kumar (CoRR, 2009)

Acyclic Edge coloring of Planar Graphs - Manu Basavaraju; L. Sunil Chandran (CoRR, 2009)

A note on acyclic edge coloring of complete bipartite graphs. - Manu Basavaraju; L. Sunil Chandran (Discret. Math., 2009)

Bounds on isoperimetric values of trees. - B. V. Subramanya Bharadwaj; L. Sunil Chandran (Discret. Math., 2009)

Cubicity, boxicity, and vertex cover. - L. Sunil Chandran; Anita Das 001; Chintan D. Shah (Discret. Math., 2009)

Boxicity of Halin graphs. - L. Sunil Chandran; Mathew C. Francis; Santhosh Suresh (Discret. Math., 2009)

An upper bound for Cubicity in terms of Boxicity. - L. Sunil Chandran; K. Ashik Mathew (Discret. Math., 2009)

Hadwiger's conjecture for proper circular arc graphs. - Naveen Belkale; L. Sunil Chandran (Eur. J. Comb., 2009)

On the Structure of Contractible Edges in k-connected Partial k-trees. - N. S. Narayanaswamy; N. Sadagopan; L. Sunil Chandran (Graphs Comb., 2009)

On the cubicity of bipartite graphs. - L. Sunil Chandran; Anita Das 001; Naveen Sivadasan (Inf. Process. Lett., 2009)

Acyclic edge coloring of graphs with maximum degree 4. - Manu Basavaraju; L. Sunil Chandran (J. Graph Theory, 2009)

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

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. - Abhijin Adiga; Diptendu Bhowmick; L. Sunil Chandran (Discret. Appl. Math., 2010)

Boxicity and cubicity of asteroidal triple free graphs. - Diptendu Bhowmick; L. Sunil Chandran (Discret. Math., 2010)

Cubicity of interval graphs and the claw number. - Abhijin Adiga; L. Sunil Chandran (J. Graph Theory, 2010)

d-Regular graphs of acyclic chromatic index at least d+2. - Manu Basavaraju; L. Sunil Chandran; Manoj Kummini (J. Graph Theory, 2010)

Boxicity of line graphs. - L. Sunil Chandran; Rogers Mathew; Naveen Sivadasan (Discret. Math., 2011)

Boxicity of Circular Arc Graphs. - Diptendu Bhowmick; L. Sunil Chandran (Graphs Comb., 2011)

Boxicity of Leaf Powers. - L. Sunil Chandran; Mathew C. Francis; Rogers Mathew (Graphs Comb., 2011)

Chordal Bipartite Graphs with High Boxicity. - L. Sunil Chandran; Mathew C. Francis; Rogers Mathew (Graphs Comb., 2011)

Boxicity and Poset Dimension. - Abhijin Adiga; Diptendu Bhowmick; L. Sunil Chandran (SIAM J. Discret. Math., 2011)

Acyclic Edge-Coloring of Planar Graphs. - Manu Basavaraju; L. Sunil Chandran; Nathann Cohen; Frédéric Havet; Tobias Müller (SIAM J. Discret. Math., 2011)

Rainbow Colouring of Split and Threshold Graphs. - L. Sunil Chandran; Deepak Rajendraprasad (COCOON, 2012)

Polynomial Time and Parameterized Approximation Algorithms for Boxicity. - Abhijin Adiga; Jasine Babu; L. Sunil Chandran (IPEC, 2012)

Rainbow Connection Number and Connectivity. - Xueliang Li 001; Sujuan Liu; L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad (Electron. J. Comb., 2012)

Parameterized and Approximation Algorithms for Boxicity - Abhijin Adiga; Jasine Babu; L. Sunil Chandran (CoRR, 2012)

Maximum weight independent sets in hole- and dart-free graphs. - Manu Basavaraju; L. Sunil Chandran; T. Karthick (Discret. Appl. Math., 2012)

Acyclic edge coloring of 2-degenerate graphs. - Manu Basavaraju; L. Sunil Chandran (J. Graph Theory, 2012)

Acyclic Edge Coloring of Triangle-Free Planar Graphs. - Manu Basavaraju; L. Sunil Chandran (J. Graph Theory, 2012)

Rainbow connection number and connected dominating sets. - L. Sunil Chandran; Anita Das 001; Deepak Rajendraprasad; Nithin M. Varma (J. Graph Theory, 2012)

Inapproximability of Rainbow Colouring. - L. Sunil Chandran; Deepak Rajendraprasad (FSTTCS, 2013)

Product Dimension of Forests and Bounded Treewidth Graphs. - L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad; Roohani Sharma (Electron. J. Comb., 2013)

Bipartite Powers of k-chordal Graphs. - L. Sunil Chandran; Rogers Mathew (Discret. Math. Theor. Comput. Sci., 2013)

On the SIG-Dimension of Trees Under the L ∞-Metric. - L. Sunil Chandran; Rajesh Hemant Chitnis; Ramanjit Kumar (Graphs Comb., 2013)

Cubicity and Bandwidth. - L. Sunil Chandran; Mathew C. Francis; Naveen Sivadasan (Graphs Comb., 2013)

Boxicity and Separation Dimension. - Manu Basavaraju; L. Sunil Chandran; Martin Charles Golumbic; Rogers Mathew; Deepak Rajendraprasad (WG, 2014)

Lower bounds for boxicity. - Abhijin Adiga; L. Sunil Chandran; Naveen Sivadasan (Comb., 2014)

Approximating the Cubicity of Trees. - Jasine Babu; Manu Basavaraju; L. Sunil Chandran; Deepak Rajendraprasad; Naveen Sivadasan (CoRR, 2014)

Separation dimension of sparse graphs. - Manu Basavaraju; L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad (CoRR, 2014)

A constant factor approximation algorithm for boxicity of circular arc graphs. - Abhijin Adiga; Jasine Babu; L. Sunil Chandran (Discret. Appl. Math., 2014)

On Additive Combinatorics of Permutations of ℤn. - L. Sunil Chandran; Deepak Rajendraprasad; Nitin Singh (Discret. Math. Theor. Comput. Sci., 2014)

Cubicity, degeneracy, and crossing number. - Abhijin Adiga; L. Sunil Chandran; Rogers Mathew (Eur. J. Comb., 2014)

Rainbow Connection Number and Radius. - Manu Basavaraju; L. Sunil Chandran; Deepak Rajendraprasad; Arunselvan Ramaswamy (Graphs Comb., 2014)

Rainbow Connection Number of Graph Power and Graph Products. - Manu Basavaraju; L. Sunil Chandran; Deepak Rajendraprasad; Arunselvan Ramaswamy (Graphs Comb., 2014)

Representing a Cubic Graph as the Intersection Graph of Axis-Parallel Boxes in Three Dimensions. - Abhijin Adiga; L. Sunil Chandran (SIAM J. Discret. Math., 2014)

2-Connecting outerplanar graphs without blowing up the pathwidth. - Jasine Babu; Manu Basavaraju; L. Sunil Chandran; Deepak Rajendraprasad (Theor. Comput. Sci., 2014)

Rainbow matchings in strongly edge-colored graphs. - Jasine Babu; L. Sunil Chandran; Krishna Vaidyanathan (Discret. Math., 2015)

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs. - Jasine Babu; L. Sunil Chandran; Deepak Rajendraprasad (Eur. J. Comb., 2015)

Boxicity and cubicity of product graphs. - L. Sunil Chandran; Wilfried Imrich; Rogers Mathew; Deepak Rajendraprasad (Eur. J. Comb., 2015)

Separation Dimension of Bounded Degree Graphs. - Noga Alon; Manu Basavaraju; L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad (SIAM J. Discret. Math., 2015)

Hadwiger's Conjecture and Squares of Chordal Graphs. - L. Sunil Chandran; Davis Issac; Sanming Zhou (COCOON, 2016)

On the Parameterized Complexity of Biclique Cover and Partition. - L. Sunil Chandran; Davis Issac; Andreas Karrenbauer (IPEC, 2016)

Separation Dimension of Graphs and Hypergraphs. - Manu Basavaraju; L. Sunil Chandran; Martin Charles Golumbic; Rogers Mathew; Deepak Rajendraprasad (Algorithmica, 2016)

An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs. - L. Sunil Chandran; Davis Issac; Sanming Zhou (CoRR, 2016)

Upper bound on cubicity in terms of boxicity for graphs of low chromatic number. - L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad (Discret. Math., 2016)

Rainbow colouring of split graphs. - L. Sunil Chandran; Deepak Rajendraprasad; Marek Tesar 001 (Discret. Appl. Math., 2017)

Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition. - L. Sunil Chandran; Yun Kuen Cheung; Davis Issac (ICALP, 2018)

Algorithms and Bounds for Very Strong Rainbow Coloring. - L. Sunil Chandran; Anita Das 001; Davis Issac; Erik Jan van Leeuwen (LATIN, 2018)

Spanning Tree Congestion and Computation of Generalized Győri-Lov{á}sz Partition. - L. Sunil Chandran; Yun Kuen Cheung; Davis Issac (CoRR, 2018)

Approximation bounds on maximum edge 2-coloring of dense graphs. - L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad; Nitin Singh (CoRR, 2018)

Sublinear approximation algorithms for boxicity and related problems. - Abhijin Adiga; Jasine Babu; L. Sunil Chandran (Discret. Appl. Math., 2018)

On Eulerian orientations of even-degree hypercubes. - Maxwell Levit; L. Sunil Chandran; Joseph Cheriyan (Oper. Res. Lett., 2018)

On Graphs with Minimal Eternal Vertex Cover Number. - Jasine Babu; L. Sunil Chandran; Mathew C. Francis; Veena Prabhakaran; Deepak Rajendraprasad; J. Nandini Warrier (CALDAM, 2019)

On induced colourful paths in triangle-free graphs. - Jasine Babu; Manu Basavaraju; L. Sunil Chandran; Mathew C. Francis (Discret. Appl. Math., 2019)

Hadwiger's conjecture for squares of 2-trees. - L. Sunil Chandran; Davis Issac; Sanming Zhou (Eur. J. Comb., 2019)

List Distinguishing Number of p th Power of Hypercube and Cartesian Powers of a Graph. - L. Sunil Chandran; Sajith Padinhatteeri; Karthik Ravi Shankar (CALDAM, 2020)

Combinatorial Lower Bounds for 3-Query LDCs. - Arnab Bhattacharyya 001; L. Sunil Chandran; Suprovat Ghoshal (ITCS, 2020)

Algorithms and Complexity of s-Club Cluster Vertex Deletion. - Dibyayan Chakraborty; L. Sunil Chandran; Sajith Padinhatteeri; Raji R. Pillai (IWOCA, 2021)

Perfect Matchings and Quantum Physics: Progress on Krenn's Conjecture. - L. Sunil Chandran; Rishikesh Gajjala (CoRR, 2022)

Towards a conjecture on the recoloring diameter of planar graphs. - L. Sunil Chandran; Uttam K. Gupta; Dinabandhu Pradhan (CoRR, 2022)

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 (Discret. Appl. Math., 2022)

Improved approximation for maximum edge colouring problem. - L. Sunil Chandran; Abhiruk Lahiri; Nitin Singh (Discret. Appl. Math., 2022)

Upper bounding rainbow connection number by forest number. - L. Sunil Chandran; Davis Issac; Juho Lauri; Erik Jan van Leeuwen (Discret. Math., 2022)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness. - Dhanyamol Antony; L. Sunil Chandran; Ankit Gayen; Shirish Gosavi; Dalu Jacob (CoRR, 2023)

χ-binding functions for squares of bipartite graphs and its subclasses. - Dibyayan Chakraborty; L. Sunil Chandran; Dalu Jacob; Raji R. Pillai (CoRR, 2023)

Template-driven rainbow coloring of proper interval graphs. - L. Sunil Chandran; Sajal K. Das 001; Pavol Hell; Sajith Padinhatteeri; Raji R. Pillai (Discret. Appl. Math., 2023)

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

Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness. - Dhanyamol Antony; L. Sunil Chandran; Ankit Gayen; Shirish Gosavi; Dalu Jacob (LATIN (1), 2024)

Krenn-Gu Conjecture for Sparse Graphs. - L. Sunil Chandran; Rishikesh Gajjala; Abraham M. Illickan (MFCS, 2024)

Weakening Total Coloring Conjecture: Weak TCC and Hadwiger's Conjecture on Total Graphs. - Manu Basavaraju; L. Sunil Chandran; Mathew C. Francis; Ankur Naskar (Electron. J. Comb., 2024)

Graph-theoretic insights on the constructability of complex entangled states. - L. Sunil Chandran; Rishikesh Gajjala (Quantum, 2024)

s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. - Dibyayan Chakraborty; L. Sunil Chandran; Sajith Padinhatteeri; Raji R. Pillai (Discret. Appl. Math., 2024)

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 (Discret. Math., 2024)

CNFs and DNFs with Exactly k Solutions. - L. Sunil Chandran; Rishikesh Gajjala; Kuldeep S. Meel (SAT, 2025)

List recoloring of planar graphs. - L. Sunil Chandran; Uttam K. Gupta; Dinabandhu Pradhan (Discret. Appl. Math., 2025)

Variants of the Gyárfás-Sumner conjecture: Oriented trees and rainbow paths. - Manu Basavaraju; L. Sunil Chandran; Mathew C. Francis; Karthik Murali 001 (J. Graph Theory, 2025)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles. - Rajat Adak; L. Sunil Chandran (CoRR, 2025)

Vertex-Based Localization of Turán's Theorem. - Rajat Adak; L. Sunil Chandran (CoRR, 2025)

Boxicity of Zero Divisor Graphs. - L. Sunil Chandran; Suraj Kumar Sahoo (CoRR, 2025)

CNFs and DNFs with Exactly k Solutions. - L. Sunil Chandran; Rishikesh Gajjala; Kuldeep S. Meel (CoRR, 2025)