Back to authors
Long Yuan
- Author ID
- u27612
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Nanjing University
- Pagerank
- 0.07616619
- Overall Rank
- 950 | 95.62%
- Paper Count
- 10
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing all 10 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 2,143 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
19 |
8.9625587e-05 |
| 5,784 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6 |
5.9944071e-05 |
| 5,804 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
5 |
5.9865208e-05 |
| 6,214 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
11 |
5.8459668e-05 |
| 7,250 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
5 |
5.5720266e-05 |
| 7,379 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
6 |
5.5369684e-05 |
| 8,903 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
1 |
5.2534908e-05 |
| 9,318 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
3 |
5.1944733e-05 |
| 9,812 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
2 |
5.1233734e-05 |
| 10,614 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
1 |
4.9769913e-05 |
Frequent Co-authors
Co-authored at least 5 papers.