Zhengcheng Huang

According to our database, Zhengcheng Huang authored at least 7 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate Technique.

Timothy M. Chan, Zhengcheng Huang

Proceedings of the 41st International Symposium on Computational Geometry, 2025

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs.

Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, Csaba D. Tóth

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

Shortest Path Separators in Unit Disk Graphs.

Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Dynamic Geometric Connectivity in the Plane with Constant Query Time.

Timothy M. Chan, Zhengcheng Huang

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size.

Timothy M. Chan, Zhengcheng Huang

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2021

Dynamic Colored Orthogonal Range Searching.

Timothy M. Chan, Zhengcheng Huang

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Improved Upper and Lower Bounds for LR Drawings of Binary Trees.

Timothy M. Chan, Zhengcheng Huang

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020