Fast and scalable algorithms for mining subgraphs in a single large graph. - Lam B. Q. Nguyen; Bay Vo; Ngoc-Thao Le; Václav Snásel; Ivan Zelinka (Eng. Appl. Artif. Intell., 2020)

Mining weighted subgraphs in a single large graph. - Ngoc-Thao Le; Bay Vo; Lam B. Q. Nguyen; Hamido Fujita; Bac Le (Inf. Sci., 2020)

Frequent Closed Subgraph Mining: A Multi-thread Approach. - Lam B. Q. Nguyen; Ngoc-Thao Le; Hung Son Nguyen; Tri Pham; Bay Vo (ACIIDS (1), 2022)

OWGraMi: Efficient method for mining weighted subgraphs in a single graph. - Ngoc-Thao Le; Bay Vo; Lam B. Q. Nguyen; Bac Le (Expert Syst. Appl., 2022)

A novel approach to discover frequent weighted subgraphs using the average measure. - Ngoc-Thao Le; Bay Vo; Unil Yun; Bac Le (Appl. Intell., 2023)