Tijn de Vos

Orcid: 0000-0002-1417-6387

According to our database1, Tijn de Vos authored at least 13 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity.
CoRR, 2024

Fast 2-Approximate All-Pairs Shortest Paths.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
The Environmental Cost of Our Conferences: The CO2 Emissions due to Travel at PODC and DISC.
SIGACT News, December, 2023

Faster Cut Sparsification of Weighted Graphs.
Algorithmica, April, 2023

Fast Algorithms for Energy Games in Special Cases.
Proceedings of the Fourteenth International Symposium on Games, 2023

The Laplacian Paradigm in Deterministic Congested Clique.
CoRR, 2023

Minimum Cost Flow in the CONGEST Model.
Proceedings of the Structural Information and Communication Complexity, 2023

Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022
The Laplacian Paradigm in the Broadcast Congested Clique.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

A Framework for Distributed Quantum Queries in the CONGEST Model.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021


  Loading...