default search action
Soham Das 0001
Person information
- affiliation: University of Florida, Gainesville, FL, USA
Other persons with the same name
- Soham Das 0002 — Indian Institute of Technology Delhi, New Delhi, India
- Soham Das 0003
— Jadavpur University, Kolkata, India
- Soham Das 0004 — Indian Statistical Institute, Kolkata, India
- Soham Das 0005
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c10]Arnab Kumar Ghoshal
Trust-based Misinformation Containment in Directed Online Social Networks. COMSNETS 2023: 594-602 - 2022
- [j6]Arnab Kumar Ghoshal
Disjoint and Overlapping Community Detection in Small-World Networks Leveraging Mean Path Length. IEEE Trans. Comput. Soc. Syst. 9(2): 406-418 (2022) - [c9]Arnab Kumar Ghoshal
A Fast Community-based Approach for Discovering Anomalies in Evolutionary Networks. COMSNETS 2022: 455-463 - 2021
- [j5]Arnab Kumar Ghoshal
Influence of community structure on misinformation containment in online social networks. Knowl. Based Syst. 213: 106693 (2021) - [j4]Soham Das
Two-Aggregator Topology Optimization Using Single Paths in Data Center Networks. IEEE Trans. Cloud Comput. 9(2): 807-820 (2021)
2010 – 2019
- 2019
- [j3]Soham Das
Two-Aggregator Topology Optimization Using Multiple Paths in Data Center Networks. IEEE Trans. Cloud Comput. 7(4): 1139-1151 (2019) - [c8]Arnab Kumar Ghoshal
Misinformation Containment in OSNs leveraging Community Structure. iCAST 2019: 1-6 - 2017
- [c7]Soham Das:
Seed Node Distribution for Influence Maximization in Multiple Online Social Networks. DASC/PiCom/DataCom/CyberSciTech 2017: 1260-1264 - [c6]Soham Das, Sartaj Sahni:
Two-aggregator topology optimization without splitting in data center networks. ISCC 2017: 310-315 - 2016
- [j2]Huiyuan Zhang
Corrections to "Least Cost Influence Maximization Across Multiple Social Networks". IEEE/ACM Trans. Netw. 24(5): 3232 (2016) - [i3]Huiyuan Zhang, Dung T. Nguyen, Soham Das, Huiling Zhang, My T. Thai:
Least Cost Influence Maximization Across Multiple Social Networks. CoRR abs/1606.08927 (2016) - 2015
- [j1]Soham Das, Sartaj Sahni:
Network topology optimisation for data aggregation using multiple paths. Int. J. Metaheuristics 4(2): 115-140 (2015) - [c5]Soham Das, Sartaj Sahni:
Two-aggregator network topology optimization with splitting. ISCC 2015: 683-688 - [i2]Soham Das, Kishaloy Halder, Sanjoy Pratihar, Partha Bhowmick:
Properties of Farey Sequence and their Applications to Digital Image Processing. CoRR abs/1509.07757 (2015) - 2014
- [c4]Soham Das, Sartaj Sahni:
Network Topology Optimization for Data Aggregation. CCGRID 2014: 493-501 - [c3]Soham Das, Sartaj Sahni:
Network topology optimization for data aggregation with splitting. ISSPIT 2014: 398-403 - 2013
- [c2]Dung T. Nguyen, Soham Das, My T. Thai:
Influence maximization in multiple online social networks. GLOBECOM 2013: 3060-3065 - [c1]Dung T. Nguyen, Huiyuan Zhang, Soham Das, My T. Thai, Thang N. Dinh
Least Cost Influence in Multiplex Social Networks: Model Representation and Analysis. ICDM 2013: 567-576 - 2012
- [i1]S. Rajyalakshmi, Amitabha Bagchi, Soham Das, Rudra M. Tripathy:
Topic Diffusion and Emergence of Virality in Social Networks. CoRR abs/1202.2215 (2012)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: