Hang Zhou

Orcid: 0000-0003-1059-4909

Affiliations:
  • École Polytechnique, France
  • Max-Planck-Institut für Informatik, Saarbrücken, Germany (former)
  • École Normale Supérieure de Paris, France (PhD 2015)


According to our database1, Hang Zhou authored at least 23 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs.
Algorithmica, October, 2023

A simple algorithm for graph reconstruction.
Random Struct. Algorithms, September, 2023

A PTAS for Capacitated Vehicle Routing on Trees.
ACM Trans. Algorithms, April, 2023

Faster Approximation Schemes for k-TSP and k-MST in the Euclidean Space.
CoRR, 2023

Euclidean Capacitated Vehicle Routing in Random Setting: A 1.55-Approximation Algorithm.
CoRR, 2023

An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Capacitated Vehicle Routing in Graphic Metrics.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
A Tight 3/2+ε-Approximation for Unsplittable Capacitated Vehicle Routing on Trees.
CoRR, 2022

2021
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2018
Graph Reconstruction and Verification.
ACM Trans. Algorithms, 2018

Backtracking-assisted multiplication.
Cryptogr. Commun., 2018

A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Optimization of Bootstrapping in Circuits.
IACR Cryptol. ePrint Arch., 2016

2015
Graph Algorithms: Network Inference and Planar Graph Optimization. (Algorithmes des Graphes: Inférence des Réseaux et Optimisation dans les Graphes Planaires).
PhD thesis, 2015

Near-Linear Query Complexity for Graph Inference.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs.
Theor. Comput. Sci., 2014

Graph Verification and Reconstruction via Distance Oracles.
CoRR, 2014

2013
Graph Reconstruction via Distance Oracles.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Constant-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs
CoRR, 2012

2011
Approximation for Maximum Surjective Constraint Satisfaction Problems
CoRR, 2011


  Loading...