◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Bhowmick

12 papers hereh-index 395.5k citations372 works total

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

author position
  • middle author10
  • last author2

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

fields
  • cs.DB6
  • cs.SI4
  • cs.CE1
  • cs.IR1
same name
  • S. Bhowmick — 23 papers, h 28
  • S. Bhowmick — 12 papers, h 18
  • S. Bhowmick — 8 papers, h 28
  • S. Bhowmick — 8 papers, h 7
  • S. Bhowmick — 4 papers, h 4
  • S. Bhowmick — 3 papers, h 15

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
20172025
most citedEfficient Estimation of Heat Kernel PageRank for Local Clustering

33 citations · 75 across the 9 of their papers we have counts for

collaborators
Showing cs.SIShow all

4 papers · 1 filter

cs.SI2023★ 1 cited

Influence Maximization in Social Networks: A Survey

Hui Li, Susu Yang, Mengting Xu +2

Online social networks have become an important platform for people to communicate, share knowledge and disseminate information. Given the widespread usage of social media, individ…

cs.SI2019★ 23 cited

DISCO: Influence Maximization Meets Network Embedding and Deep Learning

Hui Li, Mengting Xu, Sourav S Bhowmick +3

Since its introduction in 2003, the influence maximization (IM) problem has drawn significant research attention in the literature. The aim of IM is to select a set of k users who…

cs.SI2019

Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank

Renchi Yang, Jieming Shi, Xiaokui Xiao +2

Given an input graph G and a node v in G, homogeneous network embedding (HNE) maps the graph structure in the vicinity of v to a compact, fixed-dimensional feature vector. This pap…

cs.SI2019★ 33 cited

Efficient Estimation of Heat Kernel PageRank for Local Clustering

Renchi Yang, Xiaokui Xiao, Zhewei Wei +3

Given an undirected graph G and a seed node s, the local clustering problem aims to identify a high-quality cluster containing s in time roughly proportional to the size of the clu…

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