OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!
If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.
Requested Article:
On Extracting Socially Tenuous Groups for Online Social Networks with k-Triangles
Chih-Ya Shen, Hong-Han Shuai, De-Nian Yang, et al.
IEEE Transactions on Knowledge and Data Engineering (2020), pp. 1-1
Closed Access | Times Cited: 9
Chih-Ya Shen, Hong-Han Shuai, De-Nian Yang, et al.
IEEE Transactions on Knowledge and Data Engineering (2020), pp. 1-1
Closed Access | Times Cited: 9
Showing 9 citing articles:
Learning to Solve Task-Optimized Group Search for Social Internet of Things
Chen-Hsu Yang, Hong-Han Shuai, Chih-Ya Shen, et al.
IEEE Transactions on Knowledge and Data Engineering (2021) Vol. 34, Iss. 11, pp. 5429-5445
Closed Access | Times Cited: 22
Chen-Hsu Yang, Hong-Han Shuai, Chih-Ya Shen, et al.
IEEE Transactions on Knowledge and Data Engineering (2021) Vol. 34, Iss. 11, pp. 5429-5445
Closed Access | Times Cited: 22
Examining Mental Disorder/Psychological Chaos through Various ML and DL Techniques: A Critical Review
Afra Binth Osman, Faria Tabassum, Muhammed J. A. Patwary, et al.
Annals of Emerging Technologies in Computing (2022) Vol. 6, Iss. 2, pp. 61-71
Open Access | Times Cited: 10
Afra Binth Osman, Faria Tabassum, Muhammed J. A. Patwary, et al.
Annals of Emerging Technologies in Computing (2022) Vol. 6, Iss. 2, pp. 61-71
Open Access | Times Cited: 10
Maximum (L, K)-Lasting Cores in Temporal Social Networks
Wei‐Chun Hung, Chih-Ying Tseng
Lecture notes in computer science (2021), pp. 336-352
Closed Access | Times Cited: 4
Wei‐Chun Hung, Chih-Ying Tseng
Lecture notes in computer science (2021), pp. 336-352
Closed Access | Times Cited: 4
On Efficient Processing of Queries for Live Multi-Streaming Soiree Organization
C. P. Kankeu Fotsing, Chih-Ya Shen, Liang-Hao Huang, et al.
IEEE Transactions on Services Computing (2023) Vol. 16, Iss. 4, pp. 2812-2826
Closed Access | Times Cited: 1
C. P. Kankeu Fotsing, Chih-Ya Shen, Liang-Hao Huang, et al.
IEEE Transactions on Services Computing (2023) Vol. 16, Iss. 4, pp. 2812-2826
Closed Access | Times Cited: 1
Keyword-based Socially Tenuous Group Queries
Huaijie Zhu, Wei Liu, Jian Yin, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023), pp. 965-977
Closed Access | Times Cited: 1
Huaijie Zhu, Wei Liu, Jian Yin, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023), pp. 965-977
Closed Access | Times Cited: 1
Similarity-Aware Sampling for Machine Learning-Based Goal-Oriented Subgraph Extraction
Jhen-Hao Yang, Chih-Ya Shen, Ming‐Yi Chang, et al.
ICC 2022 - IEEE International Conference on Communications (2023), pp. 5589-5594
Closed Access | Times Cited: 1
Jhen-Hao Yang, Chih-Ya Shen, Ming‐Yi Chang, et al.
ICC 2022 - IEEE International Conference on Communications (2023), pp. 5589-5594
Closed Access | Times Cited: 1
The most tenuous group query
Na Li, Huaijie Zhu, Wenhao Lu, et al.
Frontiers of Computer Science (2022) Vol. 17, Iss. 2
Closed Access | Times Cited: 2
Na Li, Huaijie Zhu, Wenhao Lu, et al.
Frontiers of Computer Science (2022) Vol. 17, Iss. 2
Closed Access | Times Cited: 2
Deep Reinforcement Learning for Tenuous Subgraph Finding
Heli Sun, Miaomiao Sun, Liu Xue-chun, et al.
(2023)
Open Access
Heli Sun, Miaomiao Sun, Liu Xue-chun, et al.
(2023)
Open Access
Deep Reinforcement Learning for Tenuous Subgraph Finding
Heli Sun, Miaomiao Sun, Liu Xue-chun, et al.
(2023)
Open Access
Heli Sun, Miaomiao Sun, Liu Xue-chun, et al.
(2023)
Open Access
