 | 2009 |
|---|
| 43 |       | 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 |
| 42 | | Manu Basavaraju,
L. Sunil Chandran:
Acyclic Edge coloring of Planar Graphs
CoRR abs/0908.2237: (2009) |
| 41 | | L. Sunil Chandran,
Anita Das,
Naveen Sivadasan:
On the cubicity of bipartite graphs.
Inf. Process. Lett. 109(9): 432-435 (2009) |
| 2008 |
|---|
| 40 | | B. V. S. Bharadwaj,
L. Sunil Chandran,
Anita Das:
Isoperimetric Problem and Meta-Fibonacci Sequences.
COCOON 2008: 22-30 |
| 39 | | L. Sunil Chandran,
Mathew C. Francis,
Naveen Sivadasan:
On the cubicity of AT-free graphs and circular-arc graphs
CoRR abs/0803.3670: (2008) |
| 38 | | L. Sunil Chandran,
Anita Das,
Naveen Sivadasan:
On the cubicity of bipartite graphs
CoRR abs/0810.2697: (2008) |
| 37 | | L. Sunil Chandran,
Naveen Sivadasan:
The cubicity of hypercube graphs.
Discrete Mathematics 308(23): 5795-5800 (2008) |
| 36 | | Manu Basavaraju,
L. Sunil Chandran:
Acyclic edge coloring of subcubic graphs.
Discrete Mathematics 308(24): 6650-6653 (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,
N. 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 |
