Approximation for Maximum Surjective Constraint Satisfaction Problems - Walter Bach; Hang Zhou 001 (CoRR, 2011)

Constant-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs - Marc Lelarge; Hang Zhou 001 (CoRR, 2012)

Graph Reconstruction via Distance Oracles. - Claire Mathieu; Hang Zhou 001 (ICALP (1), 2013)

Graph Verification and Reconstruction via Distance Oracles. - Sampath Kannan; Claire Mathieu; Hang Zhou 001 (CoRR, 2014)

Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs. - Marc Lelarge; Hang Zhou 001 (Theor. Comput. Sci., 2014)

Near-Linear Query Complexity for Graph Inference. - Sampath Kannan; Claire Mathieu; Hang Zhou 001 (ICALP (1), 2015)

Graph Algorithms: Network Inference and Planar Graph Optimization. (Algorithmes des Graphes: Inférence des Réseaux et Optimisation dans les Graphes Planaires). - Hang Zhou 001 (2015)

Optimization of Bootstrapping in Circuits. - Fabrice Benhamouda; Tancrède Lepoint; Claire Mathieu; Hang Zhou 001 (IACR Cryptol. ePrint Arch., 2016)

To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. - Fabrizio Grandoni 001; Tobias Mömke; Andreas Wiese; Hang Zhou 001 (SODA, 2017)

A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. - Fabrizio Grandoni 001; Tobias Mömke; Andreas Wiese; Hang Zhou 001 (STOC, 2018)

Backtracking-assisted multiplication. - Houda Ferradi; Rémi Géraud; Diana Maimut; David Naccache; Hang Zhou 001 (Cryptogr. Commun., 2018)

Graph Reconstruction and Verification. - Sampath Kannan; Claire Mathieu; Hang Zhou 001 (ACM Trans. Algorithms, 2018)

Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. - Claire Mathieu; Hang Zhou 001 (ISAAC, 2021)

A Tight 3/2+ε-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. - Claire Mathieu; Hang Zhou 001 (CoRR, 2022)

Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm. - Fabrizio Grandoni 001; Claire Mathieu; Hang Zhou 001 (ITCS, 2023)

Capacitated Vehicle Routing in Graphic Metrics. - Tobias Mömke; Hang Zhou 001 (SOSA, 2023)

An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. - Marc Dufay; Claire Mathieu; Hang Zhou 001 (STACS, 2023)

Faster Approximation Schemes for k-TSP and k-MST in the Euclidean Space. - Ernest van Wijland; Hang Zhou 001 (CoRR, 2023)

A PTAS for Capacitated Vehicle Routing on Trees. - Claire Mathieu; Hang Zhou 001 (ACM Trans. Algorithms, 2023)

Iterated tour partitioning for Euclidean capacitated vehicle routing. - Claire Mathieu; Hang Zhou 001 (Random Struct. Algorithms, 2023)

A simple algorithm for graph reconstruction. - Claire Mathieu; Hang Zhou 001 (Random Struct. Algorithms, 2023)

Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs. - Philip N. Klein; Claire Mathieu; Hang Zhou 001 (Algorithmica, 2023)

Faster Approximation Scheme for Euclidean k-TSP. - Ernest van Wijland; Hang Zhou 001 (SoCG, 2024)

Euclidean Capacitated Vehicle Routing in the Random Setting: A 1.55-Approximation Algorithm. - Zipei Nie; Hang Zhou 001 (ESA, 2024)

A Linear Time Gap-ETH-Tight Approximation Scheme for TSP in the Euclidean Plane. - Tobias Mömke; Hang Zhou 001 (CoRR, 2024)

A tight (1.5+ε )-approximation for unsplittable capacitated vehicle routing on trees. - Claire Mathieu; Hang Zhou 001 (Math. Program., 2025)