A (5/3+ ε)-approximation for unsplittable flow on a path: placing small tasks into boxes F Grandoni, T Mömke, A Wiese, H Zhou
Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018
35 2018 Correlation clustering and two-edge-connected augmentation for planar graphs PN Klein, C Mathieu, H Zhou
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
31 2015 Optimization of bootstrapping in circuits F Benhamouda, T Lepoint, C Mathieu, H Zhou
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
30 2017 Graph reconstruction and verification S Kannan, C Mathieu, H Zhou
ACM Transactions on Algorithms (TALG) 14 (4), 1-30, 2018
28 2018 To augment or not to augment: Solving unsplittable flow on a path by creating slack F Grandoni, T Mömke, A Wiese, H Zhou
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
27 2017 Graph reconstruction via distance oracles C Mathieu, H Zhou
International Colloquium on Automata, Languages, and Programming, 733-744, 2013
19 2013 A PTAS for capacitated vehicle routing on trees C Mathieu, H Zhou
ACM Transactions on Algorithms 19 (2), 1-28, 2023
15 2023 Near-linear query complexity for graph inference S Kannan, C Mathieu, H Zhou
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
15 2015 A simple algorithm for graph reconstruction C Mathieu, H Zhou
Random Structures & Algorithms 63 (2), 512-532, 2023
13 2023 A tight C Mathieu, H Zhou
Mathematical Programming, 1-32, 2024
8 2024 Unsplittable Euclidean Capacitated Vehicle Routing: A F Grandoni, C Mathieu, H Zhou
arXiv preprint arXiv:2209.05520, 2022
7 2022 Capacitated vehicle routing in graphic metrics T Mömke, H Zhou
Symposium on Simplicity in Algorithms (SOSA), 114-123, 2023
6 2023 Probabilistic analysis of Euclidean capacitated vehicle routing C Mathieu, H Zhou
arXiv preprint arXiv:2109.06958, 2021
5 2021 Approximation for maximum surjective constraint satisfaction problems W Bach, H Zhou
arXiv preprint arXiv:1110.2953, 2011
5 2011 Backtracking-assisted multiplication H Ferradi, R Géraud, D Maimuţ, D Naccache, H Zhou
Cryptography and Communications 10, 17-26, 2018
3 2018 Sublinear-time algorithms for monomer–dimer systems on bounded degree graphs M Lelarge, H Zhou
Theoretical Computer Science 548, 68-78, 2014
3 2014 A (5/3+∈)-Approximation for Unsplittable Flow on a Path: Placing Small Tasks into Boxes F Grandoni, TMA Wiese, H Zhou
Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC …, 0
3 Correlation clustering and two-edge-connected augmentation for planar graphs PN Klein, C Mathieu, H Zhou
Algorithmica 85 (10), 3024-3057, 2023
2 2023 Euclidean Capacitated Vehicle Routing in Random Setting: A Z Nie, H Zhou
arXiv preprint arXiv:2304.11281, 2023
2 2023 An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees M Dufay, C Mathieu, H Zhou
arXiv preprint arXiv:2210.03811, 2022
2 2022 
Tobias MömkeProfessor, Computer Science, University of AugsburgZweryfikowany adres z informatik.uni-augsburg.de
