default search action
Mohammad Mehdi Hosseinzadeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
A Network Learning Method for Functional Disability Prediction from Health Data. KDIR 2024: 358-362 - [c8]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Alexandru Popa:
Maximum Letter-Duplicated Subsequence (short paper). ICTCS 2024: 340-345 - 2023
- [j8]Mohammad Mehdi Hosseinzadeh
, Sergio Ortobelli Lozza
Portfolio optimization with asset preselection using data envelopment analysis. Central Eur. J. Oper. Res. 31(1): 287-310 (2023) - [j7]Mohammad Mehdi Hosseinzadeh, Mario Cannataro, Pietro Hiram Guzzi
Temporal networks in biology and medicine: a survey on models, algorithms, and tools. Netw. Model. Anal. Health Informatics Bioinform. 12(1): 10 (2023) - [j6]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh
Colorful path detection in vertex-colored temporal. Netw. Sci. 11(4): 615-631 (2023) - [j5]Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh, Marianna Milano:
Dense subgraphs in temporal social networks. Soc. Netw. Anal. Min. 13(1): 128 (2023) - 2022
- [c7]Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh:
Integrating Temporal Graphs via Dual Networks: Dense Graph Discovery. COMPLEX NETWORKS (2) 2022: 523-535 - [c6]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Italo Zoppis:
Dense Temporal Subgraphs in Protein-Protein Interaction Networks. ICCS (1) 2022: 469-480 - 2021
- [j4]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Pietro H. Guzzi
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks. Appl. Netw. Sci. 6(1): 40 (2021) - [j3]Ambroise Baril, Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Hardness and tractability of the γ-Complete Subgraph problem. Inf. Process. Lett. 169: 106105 (2021) - [j2]Riccardo Dondi
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity. J. Comb. Optim. 41(1): 80-104 (2021) - [j1]Riccardo Dondi
Dense Sub-networks Discovery in Temporal Networks. SN Comput. Sci. 2(3): 158 (2021) - [c5]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Finding Colorful Paths in Temporal Graphs. COMPLEX NETWORKS 2021: 553-565 - [i3]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Finding Colorful Paths in Temporal Graphs. CoRR abs/2109.01392 (2021) - 2020
- [c4]Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh:
Top-k Connected Overlapping Densest Subgraphs in Dual Networks. COMPLEX NETWORKS (2) 2020: 585-596 - [c3]Mauro Castelli
Genetic Algorithms for Finding Episodes in Temporal Networks. KES 2020: 215-224 - [c2]Mohammad Mehdi Hosseinzadeh
Dense Subgraphs in Biological Networks. SOFSEM 2020: 711-719 - [i2]Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh:
Top-k Connected Overlapping Densest Subgraphs in Dual Networks. CoRR abs/2008.01573 (2020)
2010 – 2019
- 2019
- [c1]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis:
Top-k Overlapping Densest Subgraphs: Approximation and Complexity. ICTCS 2019: 110-121 - 2018
- [i1]Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis:
Top-k Overlapping Densest Subgraphs: Approximation and Complexity. CoRR abs/1809.02434 (2018)
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-12-18 18:28 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: