Mohammad Mehdi Hosseinzadeh

Orcid: 0000-0003-3275-6286

According to our database1, Mohammad Mehdi Hosseinzadeh authored at least 15 papers between 2019 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Dense subgraphs in temporal social networks.
Soc. Netw. Anal. Min., December, 2023

Colorful path detection in vertex-colored temporal.
Netw. Sci., December, 2023

Portfolio optimization with asset preselection using data envelopment analysis.
Central Eur. J. Oper. Res., March, 2023

Temporal networks in biology and medicine: a survey on models, algorithms, and tools.
Netw. Model. Anal. Health Informatics Bioinform., 2023

2022
Dense Temporal Subgraphs in Protein-Protein Interaction Networks.
Proceedings of the Computational Science - ICCS 2022, 2022

Integrating Temporal Graphs via Dual Networks: Dense Graph Discovery.
Proceedings of the Complex Networks and Their Applications XI, 2022

2021
Dense Sub-networks Discovery in Temporal Networks.
SN Comput. Sci., 2021

Top-k overlapping densest subgraphs: approximation algorithms and computational complexity.
J. Comb. Optim., 2021

Hardness and tractability of the <i>γ</i>-Complete Subgraph problem.
Inf. Process. Lett., 2021

A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks.
Appl. Netw. Sci., 2021

Finding Colorful Paths in Temporal Graphs.
Proceedings of the Complex Networks & Their Applications X - Volume 1, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021, Madrid, Spain, November 30, 2021

2020
Dense Subgraphs in Biological Networks.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Genetic Algorithms for Finding Episodes in Temporal Networks.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

Top-k Connected Overlapping Densest Subgraphs in Dual Networks.
Proceedings of the Complex Networks & Their Applications IX, 2020

2019
Top-k Overlapping Densest Subgraphs: Approximation and Complexity.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019


  Loading...