default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaram Gouda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j8]Karam Gouda, Gyöngyi Bujdosó, Mosab Hassaan:
Scaling Subgraph Matching by Improving Ullmann Algorithm. Comput. Informatics 41(4): 1002-1024 (2022)
2010 – 2019
- 2019
- [j7]Karam Gouda, Mosab Hassaan
:
A novel edge-centric approach for graph edit similarity computation. Inf. Syst. 80: 91-106 (2019) - [i1]Mosab Hassaan, Karam Gouda:
New Subgraph Isomorphism Algorithms: Vertex versus Path-at-a-time Matching. CoRR abs/1904.08819 (2019) - 2018
- [j6]Karam Gouda, Mona Arafa, Toon Calders:
A novel hierarchical-based framework for upper bound computation of graph edit distance. Pattern Recognit. 80: 210-224 (2018) - 2017
- [j5]Karam Gouda, Metwally Rashad:
Efficient String Edit Similarity Join Algorithm. Comput. Informatics 36(3): 683-704 (2017) - 2016
- [c7]Karam Gouda, Mosab Hassaan:
CSI_GED: An efficient approach for graph edit similarity computation. ICDE 2016: 265-276 - [c6]Karam Gouda, Mona Arafa, Toon Calders:
BFST_ED: A Novel Upper Bound Computation Framework for the Graph Edit Distance. SISAP 2016: 3-19 - 2015
- [j4]Karam Gouda, Mona Arafa:
An improved global lower bound for graph edit similarity search. Pattern Recognit. Lett. 58: 8-14 (2015) - 2013
- [j3]Karam Gouda, Mosab Hassaan:
Efficiently Using Prime-Encoding for Mining Frequent Itemsets in Sparse Data. Comput. Informatics 32(5): 1079-1099 (2013) - [c5]Karam Gouda, Mosab Hassaan:
Compressed feature-based filtering and verification approach for subgraph search. EDBT 2013: 287-298 - 2010
- [j2]Karam Gouda, Mosab Hassaan, Mohammed J. Zaki:
Prism: An effective approach for frequent sequence mining via prime-block encoding. J. Comput. Syst. Sci. 76(1): 88-102 (2010)
2000 – 2009
- 2007
- [c4]Karam Gouda, Mosab Hassaan, Mohammed Javeed Zaki:
Prism: A Primal-Encoding Approach for Frequent Sequence Mining. ICDM 2007: 487-492 - 2005
- [j1]Karam Gouda, Mohammed Javeed Zaki:
GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets. Data Min. Knowl. Discov. 11(3): 223-242 (2005) - 2003
- [c3]Mohammed Javeed Zaki, Karam Gouda:
Fast vertical mining using diffsets. KDD 2003: 326-335 - 2001
- [c2]Karam Gouda, Mohammed Javeed Zaki:
Efficiently Mining Maximal Frequent Itemsets. ICDM 2001: 163-170
1990 – 1999
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-04-24 23:12 CEST 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:
