| A framework for distributed quantum queries in the CONGEST model J van Apeldoorn, T de Vos Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022 | 19 | 2022 |
| An improved random shift algorithm for spanners and low diameter decompositions S Forster, M Grösbacher, T de Vos arXiv preprint arXiv:2111.08975, 2021 | 7 | 2021 |
| The Laplacian paradigm in the broadcast congested clique S Forster, T De Vos Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022 | 6 | 2022 |
| New tradeoffs for decremental approximate all-pairs shortest paths M Dory, S Forster, Y Nazari, T de Vos arXiv preprint arXiv:2211.01152, 2022 | 5 | 2022 |
| Fast 2-approximate all-pairs shortest paths M Dory, S Forster, Y Kirkpatrick, Y Nazari, VV Williams, T Vos Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 3 | 2024 |
| Minimum Cost Flow in the CONGEST Model T de Vos International Colloquium on Structural Information and Communication …, 2023 | 3 | 2023 |
| Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique S Forster, T De Vos Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing …, 2023 | 1 | 2023 |
| Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity T de Vos, ABG Christiansen arXiv preprint arXiv:2405.09141, 2024 | | 2024 |
| The Environmental Cost of Our Conferences: The CO2 Emissions due to Travel at PODC and DISC L Feuilloley, T de Vos ACM SIGACT News 54 (4), 94-107, 2024 | | 2024 |
| Fast 2-Approximate All-Pairs Shortest Paths T de Vos, S Forster, Y Nazari, M Dory, Y Kirkpatrick, VV Williams Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, 2024 | | 2024 |
| Fast Algorithms for Energy Games in Special Cases S Forster, A Skarlatos, T de Vos arXiv preprint arXiv:2307.08442, 2023 | | 2023 |
| Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model T De Vos Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing …, 2023 | | 2023 |
| The Laplacian Paradigm in Deterministic Congested Clique S Forster, T de Vos arXiv preprint arXiv:2304.02315, 2023 | | 2023 |
| Faster Cut Sparsification of Weighted Graphs S Forster, T de Vos Algorithmica 85 (4), 929-964, 2023 | | 2023 |
| Not-As-Fast Cut Sparsification of Weighted Graphs T de Vos | | 2022 |
| Faster Cut Sparsification of Weighted Graphs T de Vos | | 2021 |
| Report on travel-related carbon emissions of DISC/PODC L Feuilloley, T de Vos | | |
Yasamin NazariAssistant Professor, VU AmsterdamVerified email at jhu.edu
