L. Sunil Chandran
Orcid: 0000-0001-5451-6975
According to our database1,
L. Sunil Chandran
authored at least 125 papers
between 1999 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
2025
0
5
10
15
2
3
4
5
2
4
1
3
4
10
4
6
6
5
12
4
6
6
5
2
4
3
1
2
1
2
2
1
1
2
1
2
1
2
1
1
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
J. Graph Theory, January, 2025
2024
New bounds on the anti-Ramsey numbers of star graphs via maximum edge <i>q</i>-coloring.
Discret. Math., April, 2024
Discret. Appl. Math., March, 2024
Weakening Total Coloring Conjecture: Weak TCC and Hadwiger's Conjecture on Total Graphs.
Electron. J. Comb., 2024
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024
Proceedings of the LATIN 2024: Theoretical Informatics, 2024
Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024
2023
Discret. Appl. Math., March, 2023
CoRR, 2023
CoRR, 2023
2022
Discret. Appl. Math., 2022
Discret. Appl. Math., 2022
2021
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 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
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019
2018
Discret. Appl. Math., 2018
CoRR, 2018
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
2016
Discret. Math., 2016
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016
2015
Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs.
Eur. J. Comb., 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
Discret. Math. Theor. Comput. Sci., 2014
Discret. Appl. Math., 2014
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
2013
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013
2012
Discret. Appl. Math., 2012
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
2011
2010
J. Graph Theory, 2010
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph.
Discret. Appl. Math., 2010
Algorithmica, 2010
2009
Graphs Comb., 2009
On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts.
Ars Comb., 2009
Proceedings of the Graph Theory, 2009
2008
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
Proceedings of the 2008 International Conference on Information Technology, 2008
2007
Theor. Comput. Sci., 2007
Proceedings of the IEEE International Symposium on Information Theory, 2007
2006
Discret. Math., 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
Electron. Notes Discret. Math., 2005
2004
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004
2003
Theor. Comput. Sci., 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