
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:
Incremental Graph Computations: Doable and Undoable
Wenfei Fan, Chao Tian
ACM Transactions on Database Systems (2022) Vol. 47, Iss. 2, pp. 1-44
Open Access | Times Cited: 14
Wenfei Fan, Chao Tian
ACM Transactions on Database Systems (2022) Vol. 47, Iss. 2, pp. 1-44
Open Access | Times Cited: 14
Showing 14 citing articles:
An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs
Qing Chen, Michael H. Böhlen, Sven Helmer
Proceedings of the ACM on Management of Data (2025) Vol. 3, Iss. 1, pp. 1-26
Closed Access
Qing Chen, Michael H. Böhlen, Sven Helmer
Proceedings of the ACM on Management of Data (2025) Vol. 3, Iss. 1, pp. 1-26
Closed Access
Big graphs
Wenfei Fan
Proceedings of the VLDB Endowment (2022) Vol. 15, Iss. 12, pp. 3782-3797
Closed Access | Times Cited: 16
Wenfei Fan
Proceedings of the VLDB Endowment (2022) Vol. 15, Iss. 12, pp. 3782-3797
Closed Access | Times Cited: 16
Maximal D-Truss Search in Dynamic Directed Graphs
Anxin Tian, Alexander Zhou, Yue Wang, et al.
Proceedings of the VLDB Endowment (2023) Vol. 16, Iss. 9, pp. 2199-2211
Closed Access | Times Cited: 9
Anxin Tian, Alexander Zhou, Yue Wang, et al.
Proceedings of the VLDB Endowment (2023) Vol. 16, Iss. 9, pp. 2199-2211
Closed Access | Times Cited: 9
On Querying Connected Components in Large Temporal Graphs
Haoxuan Xie, Yixiang Fang, Yuyang Xia, et al.
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 2, pp. 1-27
Closed Access | Times Cited: 7
Haoxuan Xie, Yixiang Fang, Yuyang Xia, et al.
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 2, pp. 1-27
Closed Access | Times Cited: 7
IncBoost: Scaling Incremental Graph Processing for Edge Deletions and Weight Updates
Xizhe Yin, Zhijia Zhao, Rajiv Gupta
(2024), pp. 915-932
Closed Access | Times Cited: 1
Xizhe Yin, Zhijia Zhao, Rajiv Gupta
(2024), pp. 915-932
Closed Access | Times Cited: 1
Multi-Fuzzy-Objective Graph Pattern Matching with Big Graph Data
Lei Li, Fang Zhang, Guanfeng Liu
Journal of Database Management (2019) Vol. 30, Iss. 4, pp. 24-40
Closed Access | Times Cited: 10
Lei Li, Fang Zhang, Guanfeng Liu
Journal of Database Management (2019) Vol. 30, Iss. 4, pp. 24-40
Closed Access | Times Cited: 10
Certified Graph View Maintenance with Regular Datalog
Angela Bonifati, Stefania Dumbrava, Emilio Jesús Gallego Arias
EasyChair preprint (2018)
Open Access | Times Cited: 3
Angela Bonifati, Stefania Dumbrava, Emilio Jesús Gallego Arias
EasyChair preprint (2018)
Open Access | Times Cited: 3
Capturing More Associations by Referencing External Graphs
Wenfei Fan, Muyang Liu, Shuhao Liu, et al.
Proceedings of the VLDB Endowment (2024) Vol. 17, Iss. 6, pp. 1173-1186
Closed Access
Wenfei Fan, Muyang Liu, Shuhao Liu, et al.
Proceedings of the VLDB Endowment (2024) Vol. 17, Iss. 6, pp. 1173-1186
Closed Access
Incremental Model Checking for Fuzzy Computation Tree Logic
Haiyu Pan, Jie Zhou, Yuming Lin, et al.
Fuzzy Sets and Systems (2024) Vol. 500, pp. 109195-109195
Closed Access
Haiyu Pan, Jie Zhou, Yuming Lin, et al.
Fuzzy Sets and Systems (2024) Vol. 500, pp. 109195-109195
Closed Access
Edge Coloring on Dynamic Graphs
Zhepeng Huang, Long Yuan, Haofei Sui, et al.
Lecture notes in computer science (2023), pp. 137-153
Closed Access | Times Cited: 1
Zhepeng Huang, Long Yuan, Haofei Sui, et al.
Lecture notes in computer science (2023), pp. 137-153
Closed Access | Times Cited: 1
A Distributed Algorithm for Identifying Strongly Connected Components on Incremental Graphs
Sriram Srinivasan, Arindam Khanda, Sriram Srinivasan, et al.
(2023), pp. 109-118
Closed Access | Times Cited: 1
Sriram Srinivasan, Arindam Khanda, Sriram Srinivasan, et al.
(2023), pp. 109-118
Closed Access | Times Cited: 1
Optimizing differentially-maintained recursive queries on dynamic graphs
Khaled Ammar, Siddhartha Sahu, Semih Salihoğlu, et al.
Proceedings of the VLDB Endowment (2022) Vol. 15, Iss. 11, pp. 3186-3198
Open Access | Times Cited: 2
Khaled Ammar, Siddhartha Sahu, Semih Salihoğlu, et al.
Proceedings of the VLDB Endowment (2022) Vol. 15, Iss. 11, pp. 3186-3198
Open Access | Times Cited: 2
An Efficient Dynamic Programming Algorithm for Finding Group Steiner Trees in Temporal Graphs
Youming Ge, Zitong Chen, Weiyang Kong, et al.
International Journal of Intelligent Systems (2023) Vol. 2023, pp. 1-20
Open Access
Youming Ge, Zitong Chen, Weiyang Kong, et al.
International Journal of Intelligent Systems (2023) Vol. 2023, pp. 1-20
Open Access
Incremental Computation: What Is the Essence?
Yanhong A. Liu
arXiv (Cornell University) (2023)
Open Access
Yanhong A. Liu
arXiv (Cornell University) (2023)
Open Access