Search the dblp DataBase
L. Sunil Chandran: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- L. Sunil Chandran
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph. [Citation Graph (0, 0)][DBLP]
COCOON, 2001, pp:308-317 [Conf] - L. Sunil Chandran
Edge Connectivity vs Vertex Connectivity in Chordal Graphs. [Citation Graph (0, 0)][DBLP]
COCOON, 2001, pp:384-389 [Conf] - L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian
Isoperimetric Inequalities and the Width Parameters of Graphs. [Citation Graph (0, 0)][DBLP]
COCOON, 2003, pp:385-393 [Conf] - L. Sunil Chandran, N. S. Narayanaswamy
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. [Citation Graph (0, 0)][DBLP]
COCOON, 2004, pp:151-160 [Conf] - L. Sunil Chandran, L. Shankar Ram
On the Number of Minimum Cuts in a Graph. [Citation Graph (0, 0)][DBLP]
COCOON, 2002, pp:220-229 [Conf] - L. Sunil Chandran, Naveen Sivadasan
Geometric Representation of Graphs in Low Dimension. [Citation Graph (0, 0)][DBLP]
COCOON, 2006, pp:398-407 [Conf] - L. Sunil Chandran
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles. [Citation Graph (0, 0)][DBLP]
FSTTCS, 1999, pp:283-290 [Conf] - K. Murali Krishnan, L. Sunil Chandran
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2006, pp:69-80 [Conf] - L. Sunil Chandran, Fabrizio Grandoni
Refined Memorisation for Vertex Cover. [Citation Graph (0, 0)][DBLP]
IWPEC, 2004, pp:61-70 [Conf] - L. Sunil Chandran, L. Shankar Ram
Approximations for ATSP with Parametrized Triangle Inequality. [Citation Graph (0, 0)][DBLP]
STACS, 2002, pp:227-237 [Conf] - L. Sunil Chandran, Fabrizio Grandoni
A linear time algorithm to list the minimal separators of chordal graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2006, v:306, n:3, pp:351-358 [Journal] - L. Sunil Chandran, Telikepalli Kavitha
The treewidth and pathwidth of hypercubes. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2006, v:306, n:3, pp:359-365 [Journal] - Ankur Bohra, L. Sunil Chandran, J. Krishnam Raju
Boxicity of series-parallel graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2006, v:306, n:18, pp:2219-2221 [Journal] - L. Sunil Chandran, Telikepalli Kavitha
The carvingwidth of hypercubes. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2006, v:306, n:18, pp:2270-2274 [Journal] - L. Sunil Chandran, Naveen Sivadasan
On the Hadwiger's conjecture for graph products. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2007, v:307, n:2, pp:266-273 [Journal] - L. Sunil Chandran
A lower bound for the hitting set size for combinatorial rectangles and an application. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2003, v:86, n:2, pp:75-78 [Journal] - L. Sunil Chandran
Minimum cuts, girth and a spectral threshold. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2004, v:89, n:3, pp:105-110 [Journal] - L. Sunil Chandran, Fabrizio Grandoni
Refined memorization for vertex cover. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2005, v:93, n:3, pp:123-131 [Journal] - L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo
On the cubicity of certain graphs. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2005, v:94, n:3, pp:113-118 [Journal] - L. Sunil Chandran, C. R. Subramanian
A spectral lower bound for the treewidth of a graph and its consequences. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2003, v:87, n:4, pp:195-200 [Journal] - L. Sunil Chandran, C. R. Subramanian
Girth and treewidth. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 2005, v:93, n:1, pp:23-32 [Journal] - L. Sunil Chandran
A High Girth Graph Construction. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2003, v:16, n:3, pp:366-370 [Journal] - L. Sunil Chandran, L. Shankar Ram
On the Number of Minimum Cuts in a Graph. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2004, v:18, n:1, pp:177-194 [Journal] - L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada
Generating and characterizing the perfect elimination orderings of a chordal graph. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:307, n:2, pp:303-317 [Journal] - L. Sunil Chandran, L. Shankar Ram
On the relationship between ATSP and the cycle cover problem. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2007, v:370, n:1-3, pp:218-228 [Journal] - K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
A Combinatorial Family of Near Regular LDPC Codes [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal] - L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
Geometric representation of graphs in low dimension [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal] - L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
Representing graphs as the intersection of axis-parallel cubes [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal] - L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian
Graphs of low chordality. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:25-36 [Journal] - N. S. Narayanaswamy, N. Belkale, L. Sunil Chandran, Naveen Sivadasan
A note on the Hadwiger number of circular arc graphs. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2007, v:104, n:1, pp:10-13 [Journal] - L. Sunil Chandran, Naveen Sivadasan
Boxicity and treewidth. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 2007, v:97, n:5, pp:733-744 [Journal]
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs. [Citation Graph (, )][DBLP]
Isoperimetric Problem and Meta-Fibonacci Sequences. [Citation Graph (, )][DBLP]
Boxicity and Poset Dimension. [Citation Graph (, )][DBLP]
Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes. [Citation Graph (, )][DBLP]
On the cubicity of AT-free graphs and circular-arc graphs [Citation Graph (, )][DBLP]
On the cubicity of bipartite graphs [Citation Graph (, )][DBLP]
Acyclic Edge coloring of Planar Graphs [Citation Graph (, )][DBLP]
Acyclic Edge Coloring of Triangle Free Planar Graphs [Citation Graph (, )][DBLP]
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. [Citation Graph (, )][DBLP]
The cubicity of hypercube graphs. [Citation Graph (, )][DBLP]
Acyclic edge coloring of subcubic graphs. [Citation Graph (, )][DBLP]
An upper bound for Cubicity in terms of Boxicity. [Citation Graph (, )][DBLP]
Bounds on isoperimetric values of trees. [Citation Graph (, )][DBLP]
Cubicity, boxicity, and vertex cover. [Citation Graph (, )][DBLP]
Boxicity of Halin graphs. [Citation Graph (, )][DBLP]
A note on acyclic edge coloring of complete bipartite graphs. [Citation Graph (, )][DBLP]
Boxicity and cubicity of asteroidal triple free graphs. [Citation Graph (, )][DBLP]
Hadwiger's conjecture for proper circular arc graphs. [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.308secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002