Sattar Hashemi

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hamidreza Alvari

> Home > Persons > Sattar Hashemi

Publications

2013
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/aicom/AlvariHH13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aicom/AlvariHH13
Hamidreza Alvari, Sattar Hashemi, Ali Hamzeh:
Discovering overlapping communities in social networks: A novel game-theoretic approach. AI Commun. 26(2): 161-177 (2013)
2012
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/asunam/HajibagheriAHH12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/asunam/HajibagheriAHH12
Alireza Hajibagheri, Hamidreza Alvari, Ali Hamzeh, Sattar Hashemi:
Community Detection in Social Networks Using Information Diffusion. ASONAM 2012: 702-703
[c17]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/ic3k/SorkhiAHH12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ic3k/SorkhiAHH12
Maryam Sorkhi, Hamidreza Alvari, Sattar Hashemi, Ali Hamzeh:
A Game-Theoretic Framework to Identify Top-K Teams in Social Networks. KDIR 2012: 252-257
2011
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/aici/AlvariHH11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aici/AlvariHH11
Hamidreza Alvari, Sattar Hashemi, Ali Hamzeh:
Detecting Overlapping Communities in Social Networks by Game Theory and Structural Equivalence Concept. AICI (2) 2011: 620-630

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.