| Approximations for throughput maximization D Hyatt-Denesik, M Rahgoshay, MR Salavatipour Algorithmica, 1-33, 2024 | 6 | 2024 |
| Node connectivity augmentation via iterative randomized rounding H Angelidakis, D Hyatt-Denesik, L Sanità Mathematical Programming 199 (1), 995-1031, 2023 | 6 | 2023 |
| 31st International Symposium on Algorithms and Computation (ISAAC 2020) S Oum, K Yi, L Dublois, T Hanaka, M Khosravian Ghadikolaei, M Lampis, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | 3 | 2020 |
| Finding almost tight witness trees D Hyatt-Denesik, AJ Ameli, L Sanità arXiv preprint arXiv:2211.12431, 2022 | 2 | 2022 |
| Algorithms in throughput maximization DV Hyatt-Denesik | 1 | 2019 |
| Improved Approximations for Flexible Network Design D Hyatt-Denesik, AJ Ameli, L Sanita arXiv preprint arXiv:2404.08972, 2024 | | 2024 |
| Node Connectivity Augmentation of Highly Connected Graphs W Galvez, D Hyatt-Denesik, AJ Ameli, L Sanita arXiv preprint arXiv:2311.17010, 2023 | | 2023 |
| Choose your witnesses wisely. D Hyatt-Denesik, AJ Ameli, L Sanità CoRR, 2022 | | 2022 |
