Mosab Hassaan

Orcid: 0000-0003-0481-3271

According to our database1, Mosab Hassaan authored at least 9 papers between 2007 and 2022.

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

2022
Scaling Subgraph Matching by Improving Ullmann Algorithm.
Comput. Informatics, 2022

2021
Brain Tumor Segmentation: A Comparative Analysis.
Proceedings of the International Conference on Artificial Intelligence and Computer Vision, 2021

2019
A novel edge-centric approach for graph edit similarity computation.
Inf. Syst., 2019

New Subgraph Isomorphism Algorithms: Vertex versus Path-at-a-time Matching.
CoRR, 2019

2016
CSI_GED: An efficient approach for graph edit similarity computation.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

2013
Efficiently Using Prime-Encoding for Mining Frequent Itemsets in Sparse Data.
Comput. Informatics, 2013

Compressed feature-based filtering and verification approach for subgraph search.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2010
Prism: An effective approach for frequent sequence mining via prime-block encoding.
J. Comput. Syst. Sci., 2010

2007
Prism: A Primal-Encoding Approach for Frequent Sequence Mining.
Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), 2007


  Loading...