◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sina Sadeghian Sadeghabad

3 papers hereh-index 5145 citations7 works total

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

author position
  • middle author2
  • last author1

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

fields
  • cs.DS1
  • cs.GT1
  • cs.SI1

identity via Semantic Scholar / OpenAlex

most citedOn a Bounded Budget Network Creation Game

24 citations · 27 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2013★ 3 cited

An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree

Jochen Könemann, Sina Sadeghian, Laura Sanità

In the node-weighted prize-collecting Steiner tree problem (NW-PCST) we are given an undirected graph G=(V,E), non-negative costs c(v) and penalties π(v) for each v∈V.…

cs.GT2011★ 24 cited

On a Bounded Budget Network Creation Game

Shayan Ehsani, Saber Shokat Fadaee, MohammadAmin Fazli +4

We consider a network creation game in which each player (vertex) has a fixed budget to establish links to other players. In our model, each link has unit price and each agent trie…

cs.SI2011

On the Non-Progressive Spread of Influence through Social Networks

MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi +3

The spread of influence in social networks is studied in two main categories: the progressive model and the non-progressive model (see e.g. the seminal work of Kempe, Kleinberg, an…

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