Skip to content
GraphTheory.in
h-index
17

via OpenAlex

Citations
1,125

via OpenAlex

Publications
104

About

C. R. Subramanian is a researcher at San Francisco General Hospital. With over three decades of active research spanning from 1993 to 2023, he has contributed 13 publications on graph theory and its applications. His work focuses on developing algorithms for coloring and partitioning random graphs, as well as exploring induced subgraphs in digraphs. Subramanian's research aims to provide efficient solutions for complex graph-related problems.

Research areas

  • Mathematics
  • Combinatorics
  • Computer science
  • Graph
  • Discrete mathematics

Publications (104)

Sorted by most cited.

  1. Participation of Women and Older Participants in Randomized Clinical Trials of Lipid-Lowering Therapies

    2020

    View DOI
    149 cites
  2. Faster fixed parameter tractable algorithms for finding feedback vertex sets

    2006

    View DOI
    95 cites
  3. Refractory gastroesophageal reflux disease

    2014

    View DOI
    70 cites
  4. India and the Computer: A Study of Planned Development

    1992

    56 cites
  5. A systematic review and Bayesian network meta‐analysis of risk of intracranial hemorrhage with direct oral anticoagulants

    2018

    View DOI
    47 cites
  6. Acyclic Edge Colouring of Outerplanar Graphs

    2007

    View DOI
    46 cites
  7. Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set

    2002

    View DOI
    44 cites
  8. The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover

    2010

    View DOI
    42 cites
  9. Girth and treewidth

    2005

    View DOI
    35 cites
  10. Enhancing Health Care Communication With Large Language Models—The Role, Challenges, and Future Directions

    2024

    View DOI
    31 cites
  11. Improved bounds on acyclic edge colouring

    2007

    View DOI
    29 cites
  12. Optimal Acyclic Edge Colouring of Grid Like Graphs

    2006

    View DOI
    24 cites
  13. Association of Women Authors With Women Enrollment in Clinical Trials of Atrial Fibrillation

    2022

    View DOI
    22 cites
  14. A spectral lower bound for the treewidth of a graph and its consequences

    2003

    View DOI
    22 cites
  15. Care of inflammatory bowel disease patients in remission

    2016

    View DOI
    20 cites
  16. Representation of women, older patients, ethnic, and racial minorities in trials of atrial fibrillation

    2021

    View DOI
    18 cites
  17. Improved bounds on acyclic edge colouring

    2005

    View DOI
    18 cites
  18. Bounding <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>χ</mml:mi></mml:math> in terms of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>ω</mml:mi></mml:math> and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mi>Δ</mml:mi></mml:math> for some classes of graphs

    2011

    View DOI
    17 cites
  19. Graphs of low chordality

    2005

    View DOI
    17 cites
  20. The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

    2007

    View DOI
    15 cites
  21. Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract)

    1998

    View DOI
    15 cites
  22. Faster algorithms for feedback vertex set

    2005

    View DOI
    13 cites
  23. Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs

    2015

    View DOI
    12 cites
  24. New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs

    2012

    View DOI
    12 cites
  25. Review of Bone Modifying Agents in Metastatic Breast Cancer

    2021

    View DOI
    11 cites
  26. On Induced Paths, Holes and Trees in Random Graphs

    2018

    View DOI
    11 cites
  27. Diagnosis and therapy of esophageal squamous cell dysplasia and early esophageal squamous cell cancer

    2017

    View DOI
    11 cites
  28. Endoscopic Treatments for Dysplastic Barrett’s Esophagus: Resection, Ablation, What Else?

    2014

    View DOI
    11 cites
  29. Bounds on vertex colorings with restrictions on the union of color classes

    2011

    View DOI
    10 cites
  30. Analysis of a heuristic for acyclic edge colouring

    2006

    View DOI
    10 cites
  31. Representation of Women Authors in Trials of Lipid‐Lowering Therapy

    2021

    View DOI
    9 cites
  32. Algorithms for coloring semi-random graphs

    1998

    View DOI
    9 cites
  33. Finding Induced Acyclic Subgraphs in Random Digraphs

    2003

    View DOI
    8 cites
  34. Coloring random graphs in polynomial expected time

    1993

    View DOI
    8 cites
  35. Causal Node Failures and Computation of Giant and Small Components in Networks

    2021

    View DOI
    7 cites
  36. Oriented colouring of some graph products

    2011

    View DOI
    7 cites
  37. Star coloring of subcubic graphs

    2013

    View DOI
    6 cites
  38. Bounds on Edge Colorings with Restrictions on the Union of Color Classes

    2010

    View DOI
    6 cites
  39. On k-intersection edge colourings

    2009

    View DOI
    6 cites
  40. Forbidden Subgraph Colorings and the Oriented Chromatic Number

    2009

    View DOI
    6 cites
  41. General Partitioning on Random Graphs

    2002

    View DOI
    6 cites
  42. Improved algorithms for coloring random graphs

    1994

    View DOI
    6 cites
  43. Minimum coloring random and semi-random graphs in polynomial expected time

    2002

    View DOI
    5 cites
  44. Coloring random graphs

    1992

    View DOI
    5 cites
  45. Fecal Microbiota Transplantation for Recurrent <i>Clostridium difficile</i> Infection in Patients With Multiple Comorbidities: Long-Term Safety and Efficacy Results From a Tertiary Care Community Hospital

    2020

    View DOI
    4 cites
  46. Thrombus or vegetation: A mystery causing ST elevation myocardial infarction with infective endocarditis of mechanical aortic valve

    2017

    View DOI
    4 cites
  47. Forbidden subgraph colorings and the oriented chromatic number

    2012

    View DOI
    4 cites
  48. Minimum Coloring k-Colorable Graphs in Polynomial Average Time

    1999

    View DOI
    4 cites
  49. High-Speed Packet Classification: A Case for Approximate Sorting

    2022

    View DOI
    3 cites
  50. Inductive graph invariants and approximation algorithms

    2021

    View DOI
    3 cites
  51. Incidental Finding of Squamous Cell Carcinoma on a 68Ga-DOTATATE PET Scan

    2021

    View DOI
    3 cites
  52. Bilateral Primary Marginal Zone Lymphoma of the Breast – A Rare Breast Malignancy

    2020

    View DOI
    3 cites
  53. Radiofrequency-based treatments for esophageal disease

    2014

    View DOI
    3 cites
  54. Dominating set based exact algorithms for 3-coloring

    2010

    View DOI
    3 cites
  55. Induced acyclic subgraphs in random digraphs: Improved bounds

    2010

    View DOI
    3 cites
  56. On the size of induced acyclic subgraphs in random digraphs

    2008

    3 cites
  57. Isoperimetric Inequalities and the Width Parameters of Graphs

    2003

    View DOI
    3 cites
  58. Coloring Sparse Random Graphs in Polynomial Average Time

    2000

    View DOI
    3 cites
  59. Algorithms for Colouring Random <i>k</i>-colourable Graphs

    2000

    View DOI
    3 cites
  60. Trends of Comorbidities in Clinical Trials of Atrial Fibrillation

    2020

    View DOI
    2 cites
  61. • SUM CORDIAL LABELING OF ZERO-DIVISOR GRAPHS

    2018

    2 cites
  62. Recurrent Carbon Monoxide Poisoning Due to Smoking Leading to Cognitive Decline

    2016

    View DOI
    2 cites
  63. Improved COPD Control With Combination LABA/CS Using Small Volume Nebulized Delivery

    2016

    View DOI
    2 cites
  64. The Gates of Hell: Crohn’s Disease Isolated to the Pylorus and Ileo-Cecal Valve

    2014

    View DOI
    2 cites
  65. Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms

    2014

    View DOI
    2 cites
  66. Optimal acyclic edge colouring of grid like graphs

    2010

    View DOI
    2 cites
  67. List Set Colouring: Bounds and Algorithms

    2006

    View DOI
    2 cites
  68. On Sampling Colorings of Bipartite Graphs

    2006

    View DOI
    2 cites
  69. The existence of homeomorphic subgraphs in chordal graphs

    1997

    View DOI
    2 cites
  70. Coloring semi-random graphs in polynomial expected time

    1994

    View DOI
    2 cites
  71. On Induced Paths, Holes, and Trees in Random Graphs

    2023

    View DOI
    1 cites
  72. On approximating MIS over B1-VPG graphs*

    2021

    View DOI
    1 cites
  73. Algorithms and Discrete Applied Mathematics

    2021

    View DOI
    1 cites
  74. Abstract 13723: Representation of Women and Older Patients in Trials of Lipid Lowering Therapy: A Systematic Review

    2019

    1 cites
  75. Intersection dimension and graph invariants

    2018

    View DOI
    1 cites
  76. Pulmonary Arteriovenous Malformations: A Rare Cause of Recurrent Stroke

    2017

    View DOI
    1 cites
  77. Oxaliplatin-Induced Interstitial Lung Disease

    2016

    View DOI
    1 cites
  78. GI Mucosal Injury and Bleeding: Association with Sevelamer Crystals

    2016

    View DOI
    1 cites
  79. Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs

    2016

    View DOI
    1 cites
  80. Celecoxib Induced Asthma Exacerbation

    2015

    View DOI
    1 cites
  81. Cartesian Product and Acyclic Edge Colouring

    2015

    View DOI
    1 cites
  82. On induced acyclic subgraphs in sparse random digraphs

    2011

    View DOI
    1 cites
  83. Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration

    2010

    View DOI
    1 cites
  84. Intersection Dimension and Maximum Degree

    2009

    View DOI
    1 cites
  85. Advancing Toward Clinical Deployment of AI-Generated Discharge Summaries—Beyond the Bench

    2025

    View DOI
    0 cites
  86. The Elements of Style for Interruptive Electronic Health Record Alerts

    2024

    View DOI
    0 cites
  87. On Searching an Approximately Sorted Array

    2024

    View DOI
    0 cites
  88. On approximating stochastic independent sets

    2023

    View DOI
    0 cites
  89. Representation of Women, Older Patients, Ethnic and Racial Minorities in Trials of Atrial Fibrillation

    2020

    View DOI
    0 cites
  90. Inductive Graph Invariants and Algorithmic Applications

    2020

    View DOI
    0 cites
  91. Approximating MIS over equilateral $B_1$-VPG graphs

    2019

    View DOI
    0 cites
  92. 2827 Fecal Microbiota Transplant for Recurrent Clostridium difficile Infection in Patients With Multiple Comorbidities: A Case Series From a Tertiary Care Community Hospital

    2019

    View DOI
    0 cites
  93. Greedy Heuristics and Stochastic Matchings

    2018

    0 cites
  94. Risk of Intracranial Hemorrhage with Direct Oral Anticoagulants: A Traditional and Network Meta-Analysis

    2017

    View DOI
    0 cites
  95. CNS Aspergillosis: Early Recognition Is Key

    2016

    View DOI
    0 cites
  96. An Enhanced Protocol for the evaluation of QOS using collective-path routing protocol in hybrid wireless Networks

    2015

    0 cites
  97. Probabilistic Arguments in Graph Coloring (Invited Talk)

    2015

    View DOI
    0 cites
  98. African wild dog algorithm a new Meta heuristic approach for optimal Design of steel structures

    2014

    0 cites
  99. Induced acyclic subgraphs in random digraphs: Improved bounds

    2013

    0 cites
  100. New lower bounds for the independence number of sparse graphs and hypergraphs

    2011

    View DOI
    0 cites
  101. Paths of specified length in random k-partite graphs

    2001

    View DOI
    0 cites
  102. A Generalization of Janson inequalities and its application to finding shortest paths

    1999

    0 cites
  103. Some properties of touching distances for polygons and polyhedra

    1998

    View DOI
    0 cites
  104. Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter

    1998

    0 cites