Ehab Abdelhamid

Information Systems · 2014

A researcher in the Science corpus: 1 paper; trusts 6 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

• Information Systems — 6 citations into it
• Signal Processing — 6 citations into it
• Artificial Intelligence — 5 citations into it
• Computer Networks and Communications — 5 citations into it
• Computer Vision and Pattern Recognition — 5 citations into it

Whom Ehab Abdelhamid trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Xifeng Yan
2. Michihiro Kuramochi
3. Huahai He
4. Jiawei Han
5. George Karypis
6. Jinsoo Lee

Papers from Ehab Abdelhamid's perspective

Ordered by how strongly the researchers Ehab Abdelhamid trusts endorse each paper. Same corpus, a different order for every researcher.

1. gSpan: graph-based substructure pattern mining
2. Frequent subgraph discovery (Proceedings 2001 IEEE International Conference on Data Mining)
3. CloseGraph: mining closed frequent graph patterns (Knowledge Discovery and Data Mining)
4. Graph indexing: a frequent structure-based approach (ACM SIGMOD Conference)
5. Frequent sub-structure-based approaches for classifying chemical compounds
6. The NP-Completeness Column: An Ongoing Guide
7. Mining significant graph patterns by leap search (SIGMOD Conference)
8. Graphs-at-a-time: query language and access methods for graph databases (SIGMOD Conference)
9. Finding Frequent Patterns in a Large Sparse Graph* (Data mining and knowledge discovery)
10. An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases (Proceedings of the VLDB Endowment)

Their papers

• GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph (2014) — 335 citations