Below is a list of papers categorized by research area. You can also find my full list of publications through the DBLP, Google Scholar, ORCID, and Scopus entries:
DBLP 185/1009-1
Google Scholar r0BMJ3IAAAAJ
ORCID 0000-0001-8155-4942
Scopus ID 57205683577
IEEE Membership Number: 97018363
Papers on Dynamic Shortest Path Computation
Mengxuan Zhang, et al.. “Efficient Batch Processing of Shortest Path Queries in Road Networks.” MDM 2019
Mengxuan Zhang, et al.. “Batch Processing of Shortest Path Queries in Road Networks.” ADC 2019
Lei Li, et al.. “Fast Query Decomposition for Batch Shortest Path Processing in Road Networks.” ICDE 2020
Mengxuan Zhang, et al.. “Stream Processing of Shortest Path Queries in Dynamic Road Networks.” TKDE 2020
Mengxuan Zhang, et al.. “Typical Snapshots Selection for Shortest Path Query in Dynamic Road Networks.” ADC 2020
Mengxuan Zhang, et al.. “Path Query Processing Using Typical Snapshots in Dynamic Road Network.” DASFAA 2020
Mengxuan Zhang, et al.. “Efficient 2-Hop Labeling Maintenance in Dynamic Small-World Networks.“ ICDE 2021
Mengxuan Zhang, et al.. “Dynamic Hub Labeling for Road Networks.” In ICDE 2021
Mengxuan Zhang, et al.. “An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network.” VLDB 2021 [Code]
Mengxuan Zhang, et al.. “Parallel Hub Labeling Maintenance With High Efficiency in Dynamic Small-World Networks.” TKDE 2023
Xinjie Zhou, et al. "Scalable distance labeling maintenance and construction for dynamic small-world networks." ICDE 2024
Xinjie Zhou, et al. "High throughput shortest distance query processing on large dynamic road networks." ICDE 2025
Mengxuan Zhang, et al. "Partitioned Dynamic Hub Labeling for Large Road Networks." TKDE 2025
Papers on Constrained Shortest Path Computation
Xuanyi Zhang, et al. “An Experimental Study on Exact Multi-Constraint Shortest Path Finding.” ADC 2021
Ziyi Liu, et al. “Efficient Constrained Shortest Path Query Answering with Forest Hop Labeling.” ICDE 2021
Ziyi Liu, et al. “FHL-Cube:Multi-Constraint Shortest Path Querying with Varying Combination of Constraints.” VLDB 2022
Ziyi Liu, et al.“Multi-Constraint Shortest Path using Forest Hop Labeling.“ VLDBJ 2023
Ziyi Liu, et al. "Approximate skyline index for constrained shortest pathfinding with theoretical guarantee." ICDE 2024
Papers on Diversified Shortest Path Computation
Zihan Luo, et al. “Diversified Top-k Route Planning in Road Network.” VLDB 2022
Papers on Global Routing
Yehong Xu, et al. "Global routing optimization in road networks." ICDE 2023
Yehong Xu, et al. "Global Optimal Travel Planning for Massive Travel Queries in Road Networks." TKDE 2024
Papers on Automatic Guided Vehicle (AGV) Routing
Ruizhong Wu, et al. "A Lifelong Conflict-Aware AGV Routing System." ADC 2024
Ruizhong Wu, et al. "Continuous Lifelong Conflict-Aware AGV Routing with Kinematic Constraints." VLDB 2025
Papers on Betweenness Computation
Yehong Xu, et al. "A top-down scheme for coverage centrality queries on road networks." ADC 2022
Yehong Xu, et al. "Efficient processing of coverage centrality queries on road networks." WWWJ 2024
Zhixiao Zheng, et al. "Ranking Region-Based OD-Betweenness Centrality in Road Networks." ICONIP 2024
Ruizhong Wu, et al. "Sub-graph Sharing for Faster Betweenness Centrality Computation on Road Networks." ADC 2024
Papers on Traffic Data Management and Traffic Prediction
Zizhuo Xu, et al. "Managing the future: Route planning influence evaluation in transportation systems." ICDE 2024
Zizhuo Xu, et al. "Ultra-Flexible, Explainable, and Scalable Traffic Prediction with Dynamic Future Routes." ICDE 2025
Jing Zhao, et al. "A Just-In-Time Framework for Routing-Oriented Traffic Prediction." ICDE 2025
Zizhuo Xu, et al. "RouteSys: A Future Route Data Management System." ACM SIGSPATIAL GIS 2025