We stand with Ukraine

We stand with Ukraine

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 database¹, Hang Zhou authored at least 26 papers between 2011 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org
on normalesup.org

On csauthors.net:

Bibliography

2024

A Linear Time Gap-ETH-Tight Approximation Scheme for TSP in the Euclidean Plane.

[BibT_eX]

[DOI]

,

CoRR, 2024

Euclidean Capacitated Vehicle Routing in the Random Setting: A 1.55-Approximation Algorithm.

[BibT_eX]

[DOI]

,

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Faster Approximation Scheme for Euclidean k-TSP.

[BibT_eX]

[DOI]

Ernest van Wijland

,

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Iterated tour partitioning for Euclidean capacitated vehicle routing.

[BibT_eX]

[DOI]

,

Random Struct. Algorithms, July, 2023

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

[BibT_eX]

[DOI]

Ernest van Wijland

,

CoRR, 2023

An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees.

[BibT_eX]

[DOI]

,

,

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Capacitated Vehicle Routing in Graphic Metrics.

[BibT_eX]

[DOI]

,

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm.

[BibT_eX]

[DOI]

Fabrizio Grandoni

,

,

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

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

[BibT_eX]

[DOI]

,

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.

[BibT_eX]

[DOI]

,

CoRR, 2022

A PTAS for Capacitated Vehicle Routing on Trees.

[BibT_eX]

[DOI]

,

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Probabilistic Analysis of Euclidean Capacitated Vehicle Routing.

[BibT_eX]

[DOI]

,

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

A Simple Algorithm for Graph Reconstruction.

[BibT_eX]

[DOI]

,

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2018

Graph Reconstruction and Verification.

[BibT_eX]

[DOI]

,

,

ACM Trans. Algorithms, 2018

A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes.

[BibT_eX]

[DOI]

Fabrizio Grandoni

,

,

,

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.

[BibT_eX]

[DOI]

Fabrizio Grandoni

,

,

,

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Optimization of Bootstrapping in Circuits.

[BibT_eX]

[DOI]

Fabrice Benhamouda

,

Tancrède Lepoint

,

,

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2015

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

[BibT_eX]

[DOI]

PhD thesis, 2015

Backtracking-Assisted Multiplication.

[BibT_eX]

[DOI]

,

,

,

,

IACR Cryptol. ePrint Arch., 2015

Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs.

[BibT_eX]

[DOI]

Philip N. Klein

,

,

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Near-Linear Query Complexity for Graph Inference.

[BibT_eX]

[DOI]

,

,

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Graph Verification and Reconstruction via Distance Oracles.

[BibT_eX]

[DOI]

,

,

CoRR, 2014

2013

Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs.

[BibT_eX]

[DOI]

,

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Graph Reconstruction via Distance Oracles.

[BibT_eX]

[DOI]

,

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

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

[BibT_eX]

[DOI]

,

CoRR, 2012

2011

Approximation for Maximum Surjective Constraint Satisfaction Problems

[BibT_eX]

[DOI]

,

CoRR, 2011

Loading...