Arrow Research search

Author name cluster

S. Banerjee

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

YNICL Journal 2024 Journal Article

COVID-19 Stroke Apical Lung Examination Study 2: a national prospective CTA biomarker study of the lung apices, in patients presenting with suspected acute stroke (COVID SALES 2)

  • T. Ratneswaren
  • N. Chan
  • J. Aeron-Thomas
  • S. Sait
  • O. Adesalu
  • M. Alhawamdeh
  • M. Benger
  • J. Garnham

BACKGROUND: Apical ground-glass opacification (GGO) identified on CT angiography (CTA) performed for suspected acute stroke was developed in 2020 as a coronavirus-disease-2019 (COVID-19) diagnostic and prognostic biomarker in a retrospective study during the first wave of COVID-19. OBJECTIVE: To prospectively validate whether GGO on CTA performed for suspected acute stroke is a reliable COVID-19 diagnostic and prognostic biomarker and whether it is reliable for COVID-19 vaccinated patients. METHODS: In this prospective, pragmatic, national, multi-center validation study performed at 13 sites, we captured study data consecutively in patients undergoing CTA for suspected acute stroke from January-March 2021. Demographic and clinical features associated with stroke and COVID-19 were incorporated. The primary outcome was the likelihood of reverse-transcriptase-polymerase-chain-reaction swab-test-confirmed COVID-19 using the GGO biomarker. Secondary outcomes investigated were functional status at discharge and survival analyses at 30 and 90 days. Univariate and multivariable statistical analyses were employed. RESULTS: CTAs from 1,111 patients were analyzed, with apical GGO identified in 8.5 % during a period of high COVID-19 prevalence. GGO showed good inter-rater reliability (Fleiss κ = 0.77); and high COVID-19 specificity (93.7 %, 91.8-95.2) and negative predictive value (NPV; 97.8 %, 96.5-98.6). In subgroup analysis of vaccinated patients, GGO remained a good diagnostic biomarker (specificity 93.1 %, 89.8-95.5; NPV 99.7 %, 98.3-100.0). Patients with COVID-19 were more likely to have higher stroke score (NIHSS (mean +/- SD) 6.9 +/- 6.9, COVID-19 negative, 9.7 +/- 9.0, COVID-19 positive; p = 0.01), carotid occlusions (6.2 % negative, 14.9 % positive; p = 0.02), and larger infarcts on presentation CT (ASPECTS 9.4 +/- 1.5, COVID-19 negative, 8.6 +/- 2.4, COVID-19 positive; p = 0.00). After multivariable logistic regression, GGO (odds ratio 15.7, 6.2-40.1), myalgia (8.9, 2.1-38.2) and higher core body temperature (1.9, 1.1-3.2) were independent COVID-19 predictors. GGO was associated with worse functional outcome on discharge and worse survival after univariate analysis. However, after adjustment for factors including stroke severity, GGO was not independently predictive of functional outcome or mortality. CONCLUSION: Apical GGO on CTA performed for patients with suspected acute stroke is a reliable diagnostic biomarker for COVID-19, which in combination with clinical features may be useful in COVID-19 triage.

Details DOI

TCS Journal 2020 Journal Article

Algorithm and hardness results on neighborhood total domination in graphs

  • Anupriya Jha
  • D. Pradhan
  • S. Banerjee

A set D ⊆ V of a graph G = ( V, E ) is called a neighborhood total dominating set of G if D is a dominating set and the subgraph of G induced by the open neighborhood of D has no isolated vertex. Given a graph G, Min-NTDS is the problem of finding a neighborhood total dominating set of G of minimum cardinality. The decision version of Min-NTDS is known to be NP-complete for bipartite graphs and chordal graphs. In this paper, we extend this NP-completeness result to undirected path graphs, chordal bipartite graphs, and planar graphs. We also present a linear time algorithm for computing a minimum neighborhood total dominating set in proper interval graphs. We show that for a given graph G = ( V, E ), Min-NTDS cannot be approximated within a factor of ( 1 − ε ) log ⁡ | V |, unless NP⊆DTIME( | V | O ( log ⁡ log ⁡ | V | ) ) and can be approximated within a factor of O ( log ⁡ Δ ), where Δ is the maximum degree of the graph G. Finally, we show that Min-NTDS is APX-complete for graphs of degree at most 3.

Details DOI

TCS Journal 2019 Journal Article

Perfect Roman domination in graphs

  • S. Banerjee
  • J. Mark Keil
  • D. Pradhan

A perfect Roman dominating function on a graph G is a function f: V ( G ) ⟶ { 0, 1, 2 } having the property that for every vertex u with f ( u ) = 0, there exists exactly one vertex v such that u v ∈ E ( G ) and f ( v ) = 2. The weight of f, denoted by w ( f ), is the value ∑ v ∈ V ( G ) f ( v ). Given a graph G and a positive integer k, the perfect Roman domination problem is to decide whether there is a perfect Roman dominating function f on G such that w ( f ) is at most k. In this paper, we first show that the perfect Roman domination problem is NP-complete for chordal graphs, planar graphs, and bipartite graphs. Then we present polynomial time algorithms for computing a perfect Roman dominating function with minimum weight in block graphs, cographs, series-parallel graphs, and proper interval graphs.

Details DOI