| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Abhijin Adiga, Jasine Babu, L. Sunil Chandran |
Parameterized and Approximation Algorithms for Boxicity  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Manu Basavaraju, L. Sunil Chandran |
Acyclic edge coloring of 2-degenerate graphs. |
Journal of Graph Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma |
Rainbow Connection Number and Connected Dominating Sets. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan |
Boxicity of line graphs. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Mathew C. Francis, Rogers Mathew |
Chordal Bipartite Graphs with High Boxicity. |
Graphs and Combinatorics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Mathew C. Francis, Rogers Mathew |
Boxicity of Leaf Powers. |
Graphs and Combinatorics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Diptendu Bhowmick, L. Sunil Chandran |
Boxicity of Circular Arc Graphs. |
Graphs and Combinatorics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhijin Adiga, Jasine Babu, L. Sunil Chandran |
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Abhijin Adiga, L. Sunil Chandran, Rogers Mathew |
Cubicity, Degeneracy, and Crossing Number |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller |
Acyclic Edge-Coloring of Planar Graphs. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran |
Boxicity and Poset Dimension. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhijin Adiga, Jasine Babu, L. Sunil Chandran |
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhijin Adiga, L. Sunil Chandran, Rogers Mathew |
Cubicity, Degeneracy, and Crossing Number. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Diptendu Bhowmick, L. Sunil Chandran |
Boxicity and cubicity of asteroidal triple free graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan |
Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan |
Boxicity of Line Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Manu Basavaraju, L. Sunil Chandran |
Acyclic Edge Coloring of Triangle Free Planar Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy |
Rainbow Connection Number and Radius |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Manu Basavaraju, L. Sunil Chandran, Manoj Kummini |
d-Regular graphs of acyclic chromatic index at least d+2. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhijin Adiga, L. Sunil Chandran |
Cubicity of interval graphs and the claw number. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran |
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran |
Boxicity and Poset Dimension. |
COCOON |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhijin Adiga, L. Sunil Chandran |
Cubicity of Interval Graphs and the Claw Number. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Anita Das, Naveen Sivadasan |
On the cubicity of bipartite graphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, K. Ashik Mathew |
An upper bound for Cubicity in terms of Boxicity. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Mathew C. Francis, Santhosh Suresh |
Boxicity of Halin graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Anita Das, Chintan D. Shah |
Cubicity, boxicity, and vertex cover. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | B. V. Subramanya Bharadwaj, L. Sunil Chandran |
Bounds on isoperimetric values of trees. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manu Basavaraju, L. Sunil Chandran |
A note on acyclic edge coloring of complete bipartite graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Naveen Belkale, L. Sunil Chandran |
Hadwiger's conjecture for proper circular arc graphs. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan |
On the Cubicity of Interval Graphs. |
Graphs and Combinatorics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran |
On the Structure of Contractible Edges in k-connected Partial k-trees. |
Graphs and Combinatorics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manu Basavaraju, L. Sunil Chandran |
Acyclic Edge coloring of Planar Graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Manu Basavaraju, L. Sunil Chandran |
Acyclic edge coloring of graphs with maximum degree 4. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
Cubicity, AT-free graphs, cocomparability graphs, bandwidth, circular-arc graphs, intersection graphs |
| 1 | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan |
Boxicity and maximum degree. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Naveen Sivadasan |
The cubicity of hypercube graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manu Basavaraju, L. Sunil Chandran |
Acyclic edge coloring of subcubic graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Alexandr V. Kostochka, J. Krishnam Raju |
Hadwiger Number and the Cartesian Product of Graphs. |
Graphs and Combinatorics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Anita Das, Naveen Sivadasan |
On the cubicity of bipartite graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan |
On the cubicity of AT-free graphs and circular-arc graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | B. V. Subramanya Bharadwaj, L. Sunil Chandran, Anita Das |
Isoperimetric Problem and Meta-Fibonacci Sequences. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlo Mannino, Gianpaolo Oriolo, Federico Ricci, L. Sunil Chandran |
The stable set problem and the thinness of a graph. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Naveen Sivadasan |
Boxicity and treewidth. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan |
On the Cubicity of Interval Graphs. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chandran, Naveen Sivadasan |
A note on the Hadwiger number of circular arc graphs. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, L. Shankar Ram |
On the relationship between ATSP and the cycle cover problem. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Naveen Sivadasan |
On the Hadwiger's conjecture for graph products. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ankur Bohra, L. Sunil Chandran, J. Krishnam Raju |
Boxicity of series-parallel graphs. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Telikepalli Kavitha |
The carvingwidth of hypercubes. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Telikepalli Kavitha |
The treewidth and pathwidth of hypercubes. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Fabrizio Grandoni |
A linear time algorithm to list the minimal separators of chordal graphs. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan |
Geometric representation of graphs in low dimension |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan |
Representing graphs as the intersection of axis-parallel cubes |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar |
A Combinatorial Family of Near Regular LDPC Codes |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | L. Sunil Chandran, Naveen Sivadasan |
Geometric Representation of Graphs in Low Dimension. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Murali Krishnan, L. Sunil Chandran |
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, C. R. Subramanian |
Girth and treewidth. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Naveen Sivadasan |
On the Hadwiger number of hypercubes and its generalizations. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Fabrizio Grandoni |
Refined memorization for vertex cover. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo |
On the cubicity of certain graphs. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian |
Graphs of low chordality. |
Discrete Mathematics & Theoretical Computer Science |
2005 |
DBLP BibTeX RDF |
|
| 1 | L. Sunil Chandran |
Minimum cuts, girth and a spectral threshold. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, L. Shankar Ram |
On the Number of Minimum Cuts in a Graph. |
SIAM J. Discrete Math. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Fabrizio Grandoni |
Refined Memorisation for Vertex Cover. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, N. S. Narayanaswamy |
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. |
COCOON |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran |
A lower bound for the hitting set size for combinatorial rectangles and an application. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, C. R. Subramanian |
A spectral lower bound for the treewidth of a graph and its consequences. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada |
Generating and characterizing the perfect elimination orderings of a chordal graph. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran |
A High Girth Graph Construction. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian |
Isoperimetric Inequalities and the Width Parameters of Graphs. |
COCOON |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, L. Shankar Ram |
Approximations for ATSP with Parametrized Triangle Inequality. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, L. Shankar Ram |
On the Number of Minimum Cuts in a Graph. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran |
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran |
Edge Connectivity vs Vertex Connectivity in Chordal Graphs. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran |
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles. |
FSTTCS |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")