The SCEAS System
| |||||||

## Search the dblp DataBase
C. R. Subramanian:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - Rahul Muthu, N. Narayanan, C. R. Subramanian
**Optimal Acyclic Edge Colouring of Grid Like Graphs.**[Citation Graph (0, 0)][DBLP] COCOON, 2006, pp:360-367 [Conf] - C. R. Subramanian
**Coloring Sparse Random Graphs in Polynominal Average Time.**[Citation Graph (0, 0)][DBLP] ESA, 2000, pp:415-426 [Conf] - C. R. Subramanian
**Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time.**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:463-472 [Conf] - C. R. Subramanian, C. E. Veni Madhavan
**Coloring Semi-Random Graphs in Polynomial Expected Time.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1994, pp:137-148 [Conf] - Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan
**Coloring Random Graphs in Polynomial Expected Time.**[Citation Graph (0, 0)][DBLP] ISAAC, 1993, pp:31-37 [Conf] - Venkatesh Raman, Saket Saurabh, C. R. Subramanian
**Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.**[Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:241-248 [Conf] - C. R. Subramanian
**Improved Algorithms for Coloring Random Graphs.**[Citation Graph (0, 0)][DBLP] ISAAC, 1994, pp:460-468 [Conf] - Claus-Peter Schnorr, C. R. Subramanian
**Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).**[Citation Graph (0, 0)][DBLP] RANDOM, 1998, pp:218-231 [Conf] - C. R. Subramanian
**A Generalization of Janson Inequalities and its Application to Finding Shortest Paths.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:795-804 [Conf] - Martin Fürer, C. R. Subramanian
**Coloring Random Graphs.**[Citation Graph (0, 0)][DBLP] SWAT, 1992, pp:284-291 [Conf] - C. R. Subramanian
**Finding Induced Acyclic Subgraphs in Random Digraphs.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2003, v:10, n:, pp:- [Journal] - C. R. Subramanian
**Algorithms For Colouring Random K-Colourable Graphs.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2000, v:9, n:1, pp:- [Journal] - C. R. Subramanian
**Paths of specified length in random k-partite graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:133-138 [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] - C. R. Subramanian
**Analysis of a heuristic for acyclic edge colouring.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:99, n:6, pp:227-229 [Journal] - C. R. Subramanian
**Minimum Coloring k-Colorable Graphs in Polynomial Average Time.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:1, pp:112-123 [Journal] - C. R. Subramanian, C. E. Veni Madhavan
**General Partitioning on Random Graphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2002, v:42, n:1, pp:153-172 [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] - C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan
**Algorithms for coloring semi-random graphs.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1998, v:13, n:2, pp:125-158 [Journal] - Venkatesh Raman, Saket Saurabh, C. R. Subramanian
**Faster fixed parameter tractable algorithms for finding feedback vertex sets.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:3, pp:403-415 [Journal] - Rahul Muthu, N. Narayanan, C. R. Subramanian
**Acyclic Edge Colouring of Outerplanar Graphs.**[Citation Graph (0, 0)][DBLP] AAIM, 2007, pp:144-152 [Conf] - 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] - R. Balasubramanian, C. R. Subramanian
**On Sampling Colorings of Bipartite Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:17-30 [Journal] **The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.**[Citation Graph (, )][DBLP]**Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration.**[Citation Graph (, )][DBLP]**Forbidden Subgraph Colorings and the Oriented Chromatic Number.**[Citation Graph (, )][DBLP]**List Set Colouring: Bounds and Algorithms.**[Citation Graph (, )][DBLP]**Improved bounds on acyclic edge colouring.**[Citation Graph (, )][DBLP]**Optimal acyclic edge colouring of grid like graphs.**[Citation Graph (, )][DBLP]**On the Size of Induced Acyclic Subgraphs in Random Digraphs.**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |