Scholar
Tijn de Vos
Google Scholar ID: V_ZYM0gAAAAJ
TU Graz
Citations & Impact
Citations
84
H-index
6
i10-index
3
Publications
20
Co-authors
0
Publications
Resume
Academic Achievements
- Publications:
- - Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders (DISC 2025)
- - Distributed Sparsest Cut via Eigenvalue Estimation (DISC 2025)
- - Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances (SPAA 2025, Distinguished Paper Award)
- - Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity (SODA 2025)
- - New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths (ICALP 2024)
- - Fast 2-Approximate All-Pairs Shortest Paths (SODA 2024)
- - Fast Algorithms for Energy Games in Special Cases (GandALF 2023)
- - Minimum Cost Flow in the CONGEST Model (SIROCCO 2023, PODC 2023 Brief Announcement)
- - The Laplacian Paradigm in Deterministic Congested Clique (PODC 2023 Brief Announcement)
- - The Laplacian Paradigm in the Broadcast Congested Clique (PODC 2022)
- - A Framework for Distributed Quantum Queries in the CONGEST Model (PODC 2022, QIP 2022 Poster)
- - Faster Cut Sparsification of Weighted Graphs (ICALP 2022, Algorithmica 2022)
- - An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions (OPODIS 2021)
Research Experience
- Joined Yannic Maus' group at the Institute of Algorithms and Theory in Graz in December 2024.
Education
- Master's: Mathematics from the University of Amsterdam, supervised by Viresh Patel; PhD: University of Salzburg, supervised by Sebastian Forster.
Background
- Research interests: Graph Algorithms, Distributed Computing, Dynamic Graph Algorithms. Personal background: Postdoc in Yannic Maus' group, completed PhD under Sebastian Forster.
Miscellany
- Personal interests: Concerned about the climate crisis, promotes sustainable living such as traveling by train and adjusting eating habits. Supports the Theoretical Computer Scientists for Future initiative.