Improved Upper and Lower Bounds for LR Drawings of Binary Trees. - Timothy M. Chan; Zhengcheng Huang (GD, 2020)

Dynamic Colored Orthogonal Range Searching. - Timothy M. Chan; Zhengcheng Huang (ESA, 2021)

Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size. - Timothy M. Chan; Zhengcheng Huang (SoCG, 2023)

Dynamic Geometric Connectivity in the Plane with Constant Query Time. - Timothy M. Chan; Zhengcheng Huang (SoCG, 2024)

Shortest Path Separators in Unit Disk Graphs. - Elfarouk Harb; Zhengcheng Huang; Da Wei Zheng (ESA, 2024)

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs. - Sujoy Bhore; Timothy M. Chan; Zhengcheng Huang; Shakhar Smorodinsky; Csaba D. Tóth (SoCG, 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 (SoCG, 2025)