Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

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:

Distributed edge connectivity in sublinear time
Mohit Daga, Monika Henzinger, Danupon Nanongkai, et al.
(2019), pp. 343-354
Open Access | Times Cited: 34

Showing 1-25 of 34 citing articles:

Distributed exact weighted all-pairs shortest paths in near-linear time
Aaron Bernstein, Danupon Nanongkai
(2019), pp. 334-342
Open Access | Times Cited: 44
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
Yi‐Jun Chang, Thatchaphol Saranurak
(2019) Vol. 121, pp. 66-73
Open Access | Times Cited: 41
Distributed Small Cuts using Semigroups
John Augustine, Mohit Daga
(2025), pp. 134-143
Closed Access
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization
Yi‐Jun Chang, Thatchaphol Saranurak
(2020), pp. 377-388
Open Access | Times Cited: 24
Near-optimal Distributed Triangle Enumeration via Expander Decompositions
Yi‐Jun Chang, Seth Pettie, Thatchaphol Saranurak, et al.
Journal of the ACM (2021) Vol. 68, Iss. 3, pp. 1-36
Open Access | Times Cited: 16
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
Michal Dory, Mohsen Ghaffari
(2019) Vol. 94, pp. 521-530
Open Access | Times Cited: 16
Distributed weighted min-cut in nearly-optimal time
Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, et al.
(2021), pp. 1144-1153
Open Access | Times Cited: 14
Universally-Optimal Distributed Exact Min-Cut
Mohsen Ghaffari, Goran Žužić
(2022), pp. 281-291
Open Access | Times Cited: 9
A Simple Deterministic Algorithm for Edge Connectivity
Thatchaphol Saranurak
Society for Industrial and Applied Mathematics eBooks (2021), pp. 80-85
Open Access | Times Cited: 12
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach
Merav Parter
arXiv (Cornell University) (2019)
Open Access | Times Cited: 13
Sublinear-time distributed algorithms for detecting small cliques and even cycles
Talya Eden, Nimrod Fiat, Orr Fischer, et al.
Distributed Computing (2021) Vol. 35, Iss. 3, pp. 207-234
Closed Access | Times Cited: 10
Minor Sparsifiers and the Distributed Laplacian Paradigm
Sebastian Forster, Gramoz Goranci, Yang P. Liu, et al.
(2022), pp. 989-999
Open Access | Times Cited: 7
Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel
Merav Parter
(2022), pp. 1080-1092
Closed Access | Times Cited: 6
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates
Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, et al.
(2022), pp. 1-10
Open Access | Times Cited: 5
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex
Yu Gao, Jason Li, Danupon Nanongkai, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 7
Strong-Diameter Network Decomposition
Yi‐Jun Chang, Mohsen Ghaffari
(2021) Vol. 16, pp. 273-281
Open Access | Times Cited: 7
Finding a Small Vertex Cut on Distributed Networks
Yonggang Jiang, Sagnik Mukhopadhyay
(2023), pp. 1791-1801
Open Access | Times Cited: 2
Minor Sparsifiers and the Distributed Laplacian Paradigm
Sebastian Forster, Gramoz Goranci, Yang P. Liu, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 5
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions
Yi‐Jun Chang, Hsin-Hao Su
(2022), pp. 301-312
Open Access | Times Cited: 3
Fast Broadcast in Highly Connected Networks
Shashwat Chandra, Yi‐Jun Chang, Michal Dory, et al.
(2024)
Open Access
Faster Algorithms for Edge Connectivity via Random $2$-Out Contractions
Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup
(2019)
Closed Access | Times Cited: 3
Distributed Weighted Min-Cut in Nearly-Optimal Time
Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 3
A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph
Michal Dory, Mohsen Ghaffari
Society for Industrial and Applied Mathematics eBooks (2023), pp. 4296-4334
Closed Access | Times Cited: 1
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
Naoki Kitamura, Taisuke Izumi
IEICE Transactions on Information and Systems (2022) Vol. E105.D, Iss. 3, pp. 634-645
Open Access | Times Cited: 2
Page 1 - Next Page

Scroll to top