Mengxuan Zhang

Orcid: 0000-0001-8155-4942

Affiliations:

Australian National University (ANU), Canberra, ACT, Australia (since 2023)
Hong Kong University of Science and Technology Guangzhou (HKUST-GZ), Guangzhou, China (2023-2024)
Iowa State University, Ames, IA, USA (2021-2021)
University of Queensland, Brisbane, QLD, Australia (PhD, 2018-2019)

According to our database¹, Mengxuan Zhang authored at least 38 papers between 2019 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

Partitioned Dynamic Hub Labeling for Large Road Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., May, 2025

Continuous Lifelong Conflict-Aware AGV Routing with Kinematic Constraints.

[BibT_eX]

[DOI]

Proc. VLDB Endow., March, 2025

2024

Global Optimal Travel Planning for Massive Travel Queries in Road Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., December, 2024

I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., November, 2024

A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., November, 2024

Mobility Data Science: Perspectives and Challenges.

[BibT_eX]

[DOI]

ACM Trans. Spatial Algorithms Syst., June, 2024

Efficient processing of coverage centrality queries on road networks.

[BibT_eX]

[DOI]

World Wide Web (WWW), May, 2024

Three Pillars Towards Next-Generation Routing System.

[BibT_eX]

[DOI]

CoRR, 2024

High Throughput Shortest Distance Query Processing on Large Dynamic Road Networks.

[BibT_eX]

[DOI]

CoRR, 2024

Ranking Region-Based OD-Betweenness Centrality in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Neural Information Processing - 31st International Conference, 2024

Scalable Distance Labeling Maintenance and Construction for Dynamic Small-World Networks.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

A Just-In-Time Framework for Continuous Routing.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Managing the Future: Route Planning Influence Evaluation in Transportation Systems.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Approximate Skyline Index for Constrained Shortest Pathfinding with Theoretical Guarantee.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

A Lifelong Conflict-Aware AGV Routing System.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2024

Sub-graph Sharing for Faster Betweenness Centrality Computation on Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2024

2023

Parallel Hub Labeling Maintenance With High Efficiency in Dynamic Small-World Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., November, 2023

Multi-constraint shortest path using forest hop labeling.

[BibT_eX]

[DOI]

VLDB J., May, 2023

A Universal Scheme for Partitioned Dynamic Shortest Path Index.

[BibT_eX]

[DOI]

CoRR, 2023

Towards Mobility Data Science (Vision Paper).

[BibT_eX]

[DOI]

CoRR, 2023

Global Routing Optimization In Road Networks.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022

Stream Processing of Shortest Path Query in Dynamic Road Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Diversified Top-k Route Planning in Road Network.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Mobility Data Science (Dagstuhl Seminar 22021).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2022

A Top-Down Scheme for Coverage Centrality Queries on Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2022

2021

Efficient shortest path query processing in dynamic road networks

[BibT_eX]

[DOI]

Mengxuan Zhang

PhD thesis, 2021

An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network.

[BibT_eX]

[DOI]

Mengxuan Zhang

Lei Li

Xiaofang Zhou

Proc. VLDB Endow., 2021

Dynamic Hub Labeling for Road Networks.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Efficient 2-Hop Labeling Maintenance in Dynamic Small-World Networks.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Efficient Constrained Shortest Path Query Answering with Forest Hop Labeling.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Efficient Trajectory Contact Query Processing.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2021

An Experimental Study on Exact Multi-constraint Shortest Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2021

2020

Fast Query Decomposition for Batch Shortest Path Processing in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Path Query Processing Using Typical Snapshots in Dynamic Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2020

Typical Snapshots Selection for Shortest Path Query in Dynamic Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2020

2019

Efficient Batch Processing of Shortest Path Queries in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Conference on Mobile Data Management, 2019

Batch Processing of Shortest Path Queries in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2019

Mengxuan Zhang

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...