◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Arunabha Sen

19 papers hereh-index 283k citations190 works total

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

author position
  • middle author6
  • last author12

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

fields
  • cs.NI6
  • cs.CV2
  • cs.GT2
  • cs.CC1
  • cs.CR1
  • cs.CY1
same name
  • Arunabha Sen — 3 papers
  • Arunabha Sen — 2 papers, h 3
  • 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

activity
20102023
most citedA Survey of Interdependency Models for Critical Infrastructure Networks

15 citations · 22 across the 14 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

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.