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.076184224
- Overall Rank
- 950 | 95.61%
- 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 10 of 10 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 2,141 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.9668034e-05 |
| 5,781 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
5.9972461e-05 |
| 5,803 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
5.9893561e-05 |
| 6,211 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
5.8487355e-05 |
| 7,248 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
5.5746656e-05 |
| 7,377 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
5.5395908e-05 |
| 8,895 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
5.2559789e-05 |
| 9,309 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
5.1969334e-05 |
| 9,805 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
5.1257999e-05 |
| 10,603 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
4.9793485e-05 |
Frequent Co-authors
Co-authored at least 5 papers.