C. R. Subramanian

Statistics

Publications

Citations

342

H-Index

Active since

2003

Affiliations

Institute of Mathematical Sciences(Current)

Max Planck Institute for Informatics

C. R. Subramanian is an author at Institute of Mathematical Sciences specializing in discrete mathematics, engineering, and combinatorial optimization.

ORCID

Top concepts

Discrete MathematicsEngineeringGraph TheoryCombinatorial OptimizationComputational ComplexityComputational GeometryComputer ScienceMathematical ProgrammingNatural SciencesGeometry Modeling

Publications per year

2003–2017

Publications

Faster fixed parameter tractable algorithms for finding feedback vertex sets

Venkatesh Raman, Saket Saurabh, C. R. Subramanian · ACM Transactions on Algorithms · 2006 · 95 citations

Mathematical Programming, Engineering, Planar Graph +18

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover

Sounaka Mishra, Venkatesh Raman, Saket Saurabh et al. · Algorithmica · 2010 · 42 citations

Mathematical Programming, Engineering, Graph Theory +10

Girth and treewidth

L. Sunil Chandran, C. R. Subramanian · Journal of Combinatorial Theory Series B · 2005 · 35 citations

Tree Breeding, Tree Growth, Forestry +1

Improved bounds on acyclic edge colouring

Rahul Muthu, N. Narayanan, C. R. Subramanian · Discrete Mathematics · 2007 · 28 citations

Geometric Modeling, Acyclic Edge Colouring, Engineering +8

A spectral lower bound for the treewidth of a graph and its consequences

L. Sunil Chandran, C. R. Subramanian · Information Processing Letters · 2003 · 22 citations

Spectral Theory, Graph Minor, Engineering +9

1–5 of 14