Zhengcheng Huang

13 papers A* 4A 3Journal 6
YearRankTypeTitle / Venue / Authors
2025 A* conf
Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate Technique.
SoCG
Timothy M. Chan, Zhengcheng Huang
2025 J jnl
Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique.
CoRR
Timothy M. Chan, Zhengcheng Huang
2025 A* conf
Sparse Bounded Hop-Spanners for Geometric Intersection Graphs.
SoCG
Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, Csaba D. Tóth
2025 J jnl
Sparse Bounded Hop-Spanners for Geometric Intersection Graphs.
CoRR
Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, Csaba D. Tóth
2024 A* conf
Dynamic Geometric Connectivity in the Plane with Constant Query Time.
SoCG
Timothy M. Chan, Zhengcheng Huang
2024 J jnl
Dynamic Geometric Connectivity in the Plane with Constant Query Time.
CoRR
Timothy M. Chan, Zhengcheng Huang
2024 A conf
Shortest Path Separators in Unit Disk Graphs.
ESA
Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng
2024 J jnl
Shortest Path Separators in Unit Disk Graphs.
CoRR
Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng
2023 A* conf
Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size.
SoCG
Timothy M. Chan, Zhengcheng Huang
2023 J jnl
Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size.
CoRR
Timothy M. Chan, Zhengcheng Huang
2021 A conf
Dynamic Colored Orthogonal Range Searching.
ESA
Timothy M. Chan, Zhengcheng Huang
2020 A conf
Improved Upper and Lower Bounds for LR Drawings of Binary Trees.
GD
Timothy M. Chan, Zhengcheng Huang
2019 J jnl
Improved Upper and Lower Bounds for LR Drawings of Binary Trees.
CoRR
Timothy M. Chan, Zhengcheng Huang