◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. K. Ghosh

4 papers hereh-index 161.3k citations82 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author3
  • middle author1

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.DS2
  • cs.DC1
  • physics.soc-ph1
same name
  • S. K. Ghosh — 39 papers
  • S. K. Ghosh — 8 papers, h 5
  • S. K. Ghosh — 7 papers, h 6
  • S. K. Ghosh — 7 papers, h 6
  • S. K. Ghosh — 4 papers, h 2
  • S. K. Ghosh — 2 papers

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20092020
most citedSome Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs

5 citations · 8 across the 4 of their papers we have counts for

collaborators

4 papers

physics.soc-ph2020★ 1 cited

A Study on The Effectiveness of Lock-down Measures to Control The Spread of COVID-19

Subhas Kumar Ghosh, Sachchit Ghosh, Sai Shanmukha Narumanchi

The ongoing pandemic of coronavirus disease 2019-2020 (COVID-19) is caused by Severe Acute Respiratory Syndrome Coronavirus 2 (SARS-CoV-2). This pathogenic virus is able to spread…

cs.DC2011

On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs

Esha Ghosh, Subhas K. Ghosh, C. Pandu Rangan

Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network whe…

cs.DS2009★ 2 cited

A Randomized Algorithm for 3-SAT

Subhas Kumar Ghosh, Janardan Misra

In this work we propose and analyze a simple randomized algorithm to find a satisfiable assignment for a Boolean formula in conjunctive normal form (CNF) having at most 3 literals…

cs.DS2009★ 5 cited

Some Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs

Subhas Kumar Ghosh, Koushik Sinha

A greedy embedding of a graph G=(V,E) into a metric space (X,d) is a function x:V(G)→X such that in the embedding for every pair of non-adjacent vertices x(s),x(t)…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.