Hang Zhou
Assistant Professor at the École Polytechnique
Bâtiment Alan Turing
1 Rue Honoré d’Estienne d’Orves
91120 Palaiseau
France
hzhou (at) lix.polytechnique.fr
I am an assistant professor in the Computer Science department at the École Polytechnique of the Institut Polytechnique de Paris.
My research is mainly on combinatorial optimization and graph algorithms.
I received my PhD degree from the École Normale Supérieure in Paris, under the supervision of Claire Mathieu.
Afterwards, I spent two years as a postdoctoral researcher at the MaxPlanckInstitut für Informatik in Germany.
Selected Papers

In Submission

A Tight (1.5+ε)Approximation for Unsplittable Capacitated Vehicle Routing on Trees.
Claire Mathieu and Hang Zhou.

A Tight (1.5+ε)Approximation for Unsplittable Capacitated Vehicle Routing on Trees.

Conference Papers

A PTAS for Capacitated Vehicle Routing on Trees.
Claire Mathieu and Hang Zhou.
In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2022. 
A Simple Algorithm for Graph Reconstruction (see also the full version).
Claire Mathieu and Hang Zhou.
In Proceedings of the European Symposium on Algorithms (ESA), 2021, slides. 
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing.
Claire Mathieu and Hang Zhou.
In Proceedings of the International Symposium on Algorithms and Computation (ISAAC), 2021, slides. 
A (5/3+ε)Approximation for Unsplittable Flow on a Path: Placing Small Tasks into Boxes.
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, and Hang Zhou.
In Proceedings of the ACM Symposium on Theory of Computing (STOC), 2018, slides. 
Optimization of Bootstrapping in Circuits.
Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, and Hang Zhou.
In Proceedings of the ACMSIAM Symposium on Discrete Algorithms (SODA), 2017, slides and poster. 
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack.
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, and Hang Zhou.
In Proceedings of the ACMSIAM Symposium on Discrete Algorithms (SODA), 2017, slides. 
NearLinear Query Complexity for Graph Inference.
Sampath Kannan, Claire Mathieu, and Hang Zhou.
In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2015, slides. 
Correlation Clustering and Twoedgeconnected Augmentation for Planar Graphs.
Philip Klein, Claire Mathieu, and Hang Zhou.
In Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS), 2015, slides. 
Graph Reconstruction via Distance Oracles.
Claire Mathieu and Hang Zhou.
In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2013, slides. 
SublinearTime Algorithms for MonomerDimer Systems on Bounded Degree Graphs.
Marc Lelarge and Hang Zhou.
In Proceedings of the International Symposium on Algorithms and Computation (ISAAC), 2013, slides.

A PTAS for Capacitated Vehicle Routing on Trees.

Journal Papers

Graph Reconstruction and Verification.
Sampath Kannan, Claire Mathieu, and Hang Zhou.
In ACM Transactions on Algorithms (TALG), 2018. 
SublinearTime Algorithms for MonomerDimer Systems on Bounded Degree Graphs.
Marc Lelarge and Hang Zhou.
In Theoretical Computer Science (TCS), 2014.

Graph Reconstruction and Verification.
Teaching

École Polytechnique
 ACMICPC SWERC Training, since 2017. Information and qualification rules for SWERC 20212022.
 Algorithms and Advanced Programming, since 2018.
 Introduction to Algorithms, 2018.
 Design and Analysis of Algorithms, 20172020.

Previous Teaching
 Approximation Algorithms. Max Planck Institute for Informatics, Germany, 2017.
 Introduction to Computer Science. Paris Diderot University, 20122013.
 Programming in C. Paris Diderot University, 20122013.