◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Arunabha Sen

1 paper here

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

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.CC1
same name
  • Arunabha Sen — 1 paper

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

most citedNP-completeness Proof: RBCDN Reduction Problem

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CC2010★ 1 cited

NP-completeness Proof: RBCDN Reduction Problem

Sujogya Banerjee, Shahrzad Shirazipourazad, Pavel Ghosh +1

Computational complexity of the design problem for a network with a target value of Region-Based Component Decomposition Number (RBCDN) has been proven to be NP-complete.

◍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.