L. Sunil Chandran

	2012
76		Abhijin Adiga, Jasine Babu, L. Sunil Chandran: Parameterized and Approximation Algorithms for Boxicity CoRR abs/1201.5958: (2012)
75		Manu Basavaraju, L. Sunil Chandran: Acyclic edge coloring of 2-degenerate graphs. Journal of Graph Theory 69(1): 1-27 (2012)
	2011
74		Abhijin Adiga, L. Sunil Chandran, Rogers Mathew: Cubicity, Degeneracy, and Crossing Number. FSTTCS 2011: 176-190
73		Abhijin Adiga, Jasine Babu, L. Sunil Chandran: A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. WADS 2011: 13-24
72		Abhijin Adiga, Jasine Babu, L. Sunil Chandran: A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs CoRR abs/1102.1544: (2011)
71		Abhijin Adiga, L. Sunil Chandran, Rogers Mathew: Cubicity, Degeneracy, and Crossing Number CoRR abs/1105.5225: (2011)
70		L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan: Boxicity of line graphs. Discrete Mathematics 311(21): 2359-2367 (2011)
69		L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma: Rainbow Connection Number and Connected Dominating Sets. Electronic Notes in Discrete Mathematics 38: 239-244 (2011)
68		L. Sunil Chandran, Mathew C. Francis, Rogers Mathew: Boxicity of Leaf Powers. Graphs and Combinatorics 27(1): 61-72 (2011)
67		L. Sunil Chandran, Mathew C. Francis, Rogers Mathew: Chordal Bipartite Graphs with High Boxicity. Graphs and Combinatorics 27(3): 353-362 (2011)
66		Diptendu Bhowmick, L. Sunil Chandran: Boxicity of Circular Arc Graphs. Graphs and Combinatorics 27(6): 769-783 (2011)
65		Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller: Acyclic Edge-Coloring of Planar Graphs. SIAM J. Discrete Math. 25(2): 463-478 (2011)
64		Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran: Boxicity and Poset Dimension. SIAM J. Discrete Math. 25(4): 1687-1698 (2011)
	2010
63		Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran: Boxicity and Poset Dimension. COCOON 2010: 3-12
62		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)
61		Manu Basavaraju, L. Sunil Chandran: Acyclic Edge Coloring of Triangle Free Planar Graphs CoRR abs/1007.2282: (2010)
60		L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan: Boxicity of Line Graphs CoRR abs/1009.4471: (2010)
59		Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy: Rainbow Connection Number and Radius CoRR abs/1011.0620: (2010)
58		Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran: The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. Discrete Applied Mathematics 158(16): 1719-1726 (2010)
57		Diptendu Bhowmick, L. Sunil Chandran: Boxicity and cubicity of asteroidal triple free graphs. Discrete Mathematics 310(10-11): 1536-1543 (2010)
56		Manu Basavaraju, L. Sunil Chandran, Manoj Kummini: d-Regular graphs of acyclic chromatic index at least d+2. Journal of Graph Theory 63(3): 226-230 (2010)
55		Abhijin Adiga, L. Sunil Chandran: Cubicity of interval graphs and the claw number. Journal of Graph Theory 65(4): 323-333 (2010)
	2009
54		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
53		Manu Basavaraju, L. Sunil Chandran: Acyclic Edge coloring of Planar Graphs CoRR abs/0908.2237: (2009)
52		L. Sunil Chandran, Mathew C. Francis, Santhosh Suresh: Boxicity of Halin graphs. Discrete Mathematics 309(10): 3233-3237 (2009)
51		Manu Basavaraju, L. Sunil Chandran: A note on acyclic edge coloring of complete bipartite graphs. Discrete Mathematics 309(13): 4646-4648 (2009)
50		B. V. Subramanya Bharadwaj, L. Sunil Chandran: Bounds on isoperimetric values of trees. Discrete Mathematics 309(4): 834-842 (2009)
49		L. Sunil Chandran, Anita Das, Chintan D. Shah: Cubicity, boxicity, and vertex cover. Discrete Mathematics 309(8): 2488-2496 (2009)
48		L. Sunil Chandran, K. Ashik Mathew: An upper bound for Cubicity in terms of Boxicity. Discrete Mathematics 309(8): 2571-2574 (2009)
47		Abhijin Adiga, L. Sunil Chandran: Cubicity of Interval Graphs and the Claw Number. Electronic Notes in Discrete Mathematics 34: 471-475 (2009)
46		Naveen Belkale, L. Sunil Chandran: Hadwiger's conjecture for proper circular arc graphs. Eur. J. Comb. 30(4): 946-956 (2009)
45		L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: On the Cubicity of Interval Graphs. Graphs and Combinatorics 25(2): 169-179 (2009)
44		N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran: On the Structure of Contractible Edges in k-connected Partial k-trees. Graphs and Combinatorics 25(4): 557-569 (2009)
43		L. Sunil Chandran, Anita Das, Naveen Sivadasan: On the cubicity of bipartite graphs. Inf. Process. Lett. 109(9): 432-435 (2009)
42		Manu Basavaraju, L. Sunil Chandran: Acyclic edge coloring of graphs with maximum degree 4. Journal of Graph Theory 61(3): 192-209 (2009)
	2008
41		B. V. Subramanya Bharadwaj, L. Sunil Chandran, Anita Das: Isoperimetric Problem and Meta-Fibonacci Sequences. COCOON 2008: 22-30
40		L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: On the cubicity of AT-free graphs and circular-arc graphs CoRR abs/0803.3670: (2008)
39		L. Sunil Chandran, Anita Das, Naveen Sivadasan: On the cubicity of bipartite graphs CoRR abs/0810.2697: (2008)
38		L. Sunil Chandran, Naveen Sivadasan: The cubicity of hypercube graphs. Discrete Mathematics 308(23): 5795-5800 (2008)
37		Manu Basavaraju, L. Sunil Chandran: Acyclic edge coloring of subcubic graphs. Discrete Mathematics 308(24): 6650-6653 (2008)
36		L. Sunil Chandran, Alexandr V. Kostochka, J. Krishnam Raju: Hadwiger Number and the Cartesian Product of Graphs. Graphs and Combinatorics 24(4): 291-301 (2008)
35		L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Boxicity and maximum degree. J. Comb. Theory, Ser. B 98(2): 443-445 (2008)
	2007
34		L. Sunil Chandran, Naveen Sivadasan: On the Hadwiger's conjecture for graph products. Discrete Mathematics 307(2): 266-273 (2007)
33		L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: On the Cubicity of Interval Graphs. Electronic Notes in Discrete Mathematics 29: 315-319 (2007)
32		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)
31		L. Sunil Chandran, Naveen Sivadasan: Boxicity and treewidth. J. Comb. Theory, Ser. B 97(5): 733-744 (2007)
30		Carlo Mannino, Gianpaolo Oriolo, Federico Ricci, L. Sunil Chandran: The stable set problem and the thinness of a graph. Oper. Res. Lett. 35(1): 1-9 (2007)
29		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)
	2006
28		L. Sunil Chandran, Naveen Sivadasan: Geometric Representation of Graphs in Low Dimension. COCOON 2006: 398-407
27		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
26		L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Geometric representation of graphs in low dimension CoRR abs/cs/0605013: (2006)
25		L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Representing graphs as the intersection of axis-parallel cubes CoRR abs/cs/0607092: (2006)
24		K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar: A Combinatorial Family of Near Regular LDPC Codes CoRR abs/cs/0609146: (2006)
23		Ankur Bohra, L. Sunil Chandran, J. Krishnam Raju: Boxicity of series-parallel graphs. Discrete Mathematics 306(18): 2219-2221 (2006)
22		L. Sunil Chandran, Telikepalli Kavitha: The carvingwidth of hypercubes. Discrete Mathematics 306(18): 2270-2274 (2006)
21		L. Sunil Chandran, Fabrizio Grandoni: A linear time algorithm to list the minimal separators of chordal graphs. Discrete Mathematics 306(3): 351-358 (2006)
20		L. Sunil Chandran, Telikepalli Kavitha: The treewidth and pathwidth of hypercubes. Discrete Mathematics 306(3): 359-365 (2006)
	2005
19		L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian: Graphs of low chordality. Discrete Mathematics & Theoretical Computer Science 7(1): 25-36 (2005)
18		L. Sunil Chandran, Naveen Sivadasan: On the Hadwiger number of hypercubes and its generalizations. Electronic Notes in Discrete Mathematics 19: 155-161 (2005)
17		L. Sunil Chandran, Fabrizio Grandoni: Refined memorization for vertex cover. Inf. Process. Lett. 93(3): 123-131 (2005)
16		L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo: On the cubicity of certain graphs. Inf. Process. Lett. 94(3): 113-118 (2005)
15		L. Sunil Chandran, C. R. Subramanian: Girth and treewidth. J. Comb. Theory, Ser. B 93(1): 23-32 (2005)
	2004
14		L. Sunil Chandran, N. S. Narayanaswamy: On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. COCOON 2004: 151-160
13		L. Sunil Chandran, Fabrizio Grandoni: Refined Memorisation for Vertex Cover. IWPEC 2004: 61-70
12		L. Sunil Chandran: Minimum cuts, girth and a spectral threshold. Inf. Process. Lett. 89(3): 105-110 (2004)
11		L. Sunil Chandran, L. Shankar Ram: On the Number of Minimum Cuts in a Graph. SIAM J. Discrete Math. 18(1): 177-194 (2004)
	2003
10		L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian: Isoperimetric Inequalities and the Width Parameters of Graphs. COCOON 2003: 385-393
9		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)
8		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)
7		L. Sunil Chandran: A High Girth Graph Construction. SIAM J. Discrete Math. 16(3): 366-370 (2003)
6		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)
	2002
5		L. Sunil Chandran, L. Shankar Ram: On the Number of Minimum Cuts in a Graph. COCOON 2002: 220-229
4		L. Sunil Chandran, L. Shankar Ram: Approximations for ATSP with Parametrized Triangle Inequality. STACS 2002: 227-237
	2001
3		L. Sunil Chandran: A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph. COCOON 2001: 308-317
2		L. Sunil Chandran: Edge Connectivity vs Vertex Connectivity in Chordal Graphs. COCOON 2001: 384-389
	1999
1		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

1	Abhijin Adiga	[47] [55] [58] [63] [64] [71] [72] [73] [74] [76]
2	Jasine Babu	[72] [73] [76]
3	Manu Basavaraju	[37] [42] [51] [53] [56] [59] [61] [65] [75]
4	Naveen Belkale	[32] [46]
5	B. V. Subramanya Bharadwaj	[41] [50]
6	Diptendu Bhowmick	[57] [58] [63] [64] [66]
7	Ankur Bohra	[23]
8	Nathann Cohen	[65]
9	Anita Das	[39] [41] [43] [49] [69]
10	Mathew C. Francis	[25] [26] [33] [35] [40] [45] [52] [54] [62] [67] [68]
11	Fabrizio Grandoni	[13] [17] [21]
12	Frédéric Havet	[65]
13	Louis Ibarra	[6]
14	Telikepalli Kavitha	[10] [20] [22]
15	Alexandr V. Kostochka	[36]
16	K. Murali Krishnan	[24] [27]
17	Manoj Kummini	[56]
18	Vadim V. Lozin	[19]
19	Carlo Mannino	[16] [30]
20	K. Ashik Mathew	[48]
21	Rogers Mathew	[60] [67] [68] [70] [71] [74]
22	Tobias Müller	[65]
23	N. S. Narayanaswamy	[14] [32] [44]
24	Gianpaolo Oriolo	[16] [30]
25	Deepak Rajendraprasad	[59] [69]
26	J. Krishnam Raju	[23] [36]
27	L. Shankar Ram	[4] [5] [11] [29]
28	Arunselvan Ramaswamy	[59]
29	Federico Ricci	[30]
30	Frank Ruskey	[6]
31	N. Sadagopan	[44]
32	Joe Sawada	[6]
33	Chintan D. Shah	[49]
34	Priti Shankar	[24]
35	Rajdeep Singh	[24]
36	Naveen Sivadasan	[18] [25] [26] [28] [31] [32] [33] [34] [35] [38] [39] [40] [43] [45] [54] [60] [62] [70]
37	C. R. Subramanian	[8] [10] [15] [19]
38	Santhosh Suresh	[52]
39	Nithin M. Varma	[69]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page