Back to authors
Long Yuan
- Author ID
- 27435
- ORCID
-
-
- Links
-
(found by gpt-5.2 on feb 8th, 2026)
- Most Frequent Institution
- Nanjing University
- Pagerank
- 0.07688978
- Overall Rank
- 922 | 95.59%
- 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,059 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
9.3142927e-05 |
| 5,710 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6.1795374e-05 |
| 7,029 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
5.7754385e-05 |
| 7,104 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
5.754502e-05 |
| 7,285 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
5.7107054e-05 |
| 8,011 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
5.5653705e-05 |
| 8,616 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
5.4598872e-05 |
| 9,473 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
5.3246578e-05 |
| 9,479 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
5.3246578e-05 |
| 10,123 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
5.1725247e-05 |
Frequent Co-authors
Co-authored at least 5 papers.