# L. Sunil Chandran

According to our database

Collaborative distances:

^{1}, L. Sunil Chandran authored at least 112 papers between 1999 and 2022.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2022

CoRR, 2022

2021

CoRR, 2021

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

List Distinguishing Number of p<sup> th</sup> Power of Hypercube and Cartesian Powers of a Graph.

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Eur. J. Comb., 2019

CoRR, 2019

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Oper. Res. Lett., 2018

Discret. Appl. Math., 2018

CoRR, 2018

CoRR, 2018

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Electron. Notes Discret. Math., 2017

Discret. Appl. Math., 2017

2016

Discret. Math., 2016

CoRR, 2016

Algorithmica, 2016

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

SIAM J. Discret. Math., 2015

Eur. J. Comb., 2015

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs.

Eur. J. Comb., 2015

Discret. Math., 2015

2014

Theor. Comput. Sci., 2014

Representing a Cubic Graph as the Intersection Graph of Axis-Parallel Boxes in Three Dimensions.

SIAM J. Discret. Math., 2014

Graphs Comb., 2014

Graphs Comb., 2014

Eur. J. Comb., 2014

Discret. Math. Theor. Comput. Sci., 2014

Discret. Appl. Math., 2014

CoRR, 2014

CoRR, 2014

Comb., 2014

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013

Graphs Comb., 2013

Graphs Comb., 2013

Discret. Math. Theor. Comput. Sci., 2013

Electron. J. Comb., 2013

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

J. Graph Theory, 2012

J. Graph Theory, 2012

Discret. Appl. Math., 2012

CoRR, 2012

Electron. J. Comb., 2012

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

SIAM J. Discret. Math., 2011

SIAM J. Discret. Math., 2011

Graphs Comb., 2011

Graphs Comb., 2011

Graphs Comb., 2011

Electron. Notes Discret. Math., 2011

Discret. Math., 2011

2010

J. Graph Theory, 2010

Discret. Math., 2010

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph.

Discret. Appl. Math., 2010

Algorithmica, 2010

2009

J. Graph Theory, 2009

Inf. Process. Lett., 2009

On the Structure of Contractible Edges in <i>k</i>-connected Partial <i>k</i>-trees.

Graphs Comb., 2009

Electron. Notes Discret. Math., 2009

Eur. J. Comb., 2009

Discret. Math., 2009

Discret. Math., 2009

Discret. Math., 2009

Discret. Math., 2009

Discret. Math., 2009

CoRR, 2009

CoRR, 2009

On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts.

Ars Comb., 2009

Proceedings of the Graph Theory, 2009

2008

J. Comb. Theory, Ser. B, 2008

Graphs Comb., 2008

Discret. Math., 2008

Discret. Math., 2008

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Finding a Box Representation for a Graph in O(n<sup>2</sup>Δ<sup>2</sup>lnn) Time.

Proceedings of the 2008 International Conference on Information Technology, 2008

2007

Theor. Comput. Sci., 2007

Oper. Res. Lett., 2007

J. Comb. Theory, Ser. B, 2007

Inf. Process. Lett., 2007

Electron. Notes Discret. Math., 2007

Discret. Math., 2007

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Discret. Math., 2006

Discret. Math., 2006

Discret. Math., 2006

Discret. Math., 2006

CoRR, 2006

CoRR, 2006

Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs.

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

J. Comb. Theory, Ser. B, 2005

Inf. Process. Lett., 2005

Inf. Process. Lett., 2005

Electron. Notes Discret. Math., 2005

Discret. Math. Theor. Comput. Sci., 2005

2004

SIAM J. Discret. Math., 2004

Inf. Process. Lett., 2004

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003

Generating and characterizing the perfect elimination orderings of a chordal graph.

Theor. Comput. Sci., 2003

SIAM J. Discret. Math., 2003

Inf. Process. Lett., 2003

A lower bound for the hitting set size for combinatorial rectangles and an application.

Inf. Process. Lett., 2003

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

2001

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph.

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

1999

A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles.

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999