Embedded Files
About me
About me
I'm a postoc in the group of Yannic Maus at the TU Graz. I completed my PhD under Sebastian Forster at the University of Salzburg. I obtained my master's degree in Mathematics from the University of Amsterdam, under supervision of Viresh Patel. You can find my master's thesis here.
Pronouns: they/them/he/him
tijn [dot] devos [at] tugraz.at
Address:
Room 2.34
Jakob-Haringer-Str. 2
5020 Salzburg, Austria
News
News
Our paper "Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances" is accepted to SPAA 2025.
I joined Yannic Maus' group at the Institute of Algorithms and Theory in Graz in December 2024.
I received my PhD in November 2024.
Our paper "Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity" is accepted to SODA 2025.
I receieved the Young Investigators Award 2023 for up-coming researchers at the University of Salzburg.
Climate Crisis
Climate Crisis
The biggest problem we will face in our lifetime might be the climate crisis. It is my opinion that everyone, but especially all scientists, have a role to play in creating a more sustainable way of living. As an individual researcher, this can include travelling by train as much as possible, adjusting eating habits to a vegetarian/vegan diet, combining multiple trips into one when feasible, and use modern tools for global collaborations. Please consider supporting the Theoretical Computer Scientists for Future initiative.
Research interests
Research interests
Graph Algorithms
Distributed Computing
Dynamic Graph Algorithms
Publications
Publications
Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances (arXiv)
Jan van den Brand, Hossein Gholizadeh, Yonggang Jiang, Tijn de Vos
SPAA 2025
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity (arXiv)
Tijn de Vos ® Aleksander B. G. Christiansen
SODA 2025
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths (arXiv)
Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
ICALP 2024
Fast 2-Approximate All-Pairs Shortest Paths (arXiv)
Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
SODA 2024
Fast Algorithms for Energy Games in Special Cases (arXiv)
Sebastian Forster, Antonis Skarlatos, Tijn de Vos
GandALF 2023
Minimum Cost Flow in the CONGEST Model (arXiv)
Tijn de Vos
SIROCCO 2023
PODC 2023 (Brief announcement)
The Laplacian Paradigm in Deterministic Congested Clique (arXiv)
Sebastian Forster, Tijn de Vos
PODC 2023 (Brief announcement)
The Laplacian Paradigm in the Broadcast Congested Clique (arXiv)
Sebastian Forster, Tijn de Vos
PODC 2022
A Framework for Distributed Quantum Queries in the CONGEST Model (arXiv)
Joran van Apeldoorn, Tijn de Vos,
PODC 2022
QIP 2022 (Poster, no proceedings)
Faster Cut Sparsifiaction of Weighted Graphs (arXiv)
Sebastian Forster, Tijn de Vos
ICALP 2022
Algorithmica, 2022
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions (arXiv)
Sebastian Forster, Martin Grösbacher, Tijn de Vos
OPODIS 2021
Columns
Columns
I wrote a column about my research for the OCG (Österreichische Computer Gesellschaft)
Laurent Feuilloley and I wrote a column for the december 2023 edition of SIGACT news,
I wrote a blog about traveling for conferences: An Ode to Train Travel.
Teaching Assistant
Teaching Assistant
Algorithms for Distributed Systems
Introduction to Geometry
Linear Algebra
Real Analysis
Mathematical Highlights
Mentorship of first-year students
Various organizational positions regarding the organization of the Bachelor Mathematics and the development of a science education master's program,
Academic Service
Academic Service
Environmental co-chair of DISC 2023, with Laurent Feuilloley. For our report on PODC-DISC travel emisions, see here.
External reviewer for STOC 2021, DISC 2022, ICALP 2022, APPROX 2022, PODC 2023, ICALP 2023, SIROCCO 2023, FOCS 2023, DISC 2023, ESA 2023, SODA 2024, SOSA 2024, IPDPS 2024, STOC 2024, FOCS 2024, ICALP 2025, PODC 2025, FORCS 2025.
Reviewer for Distributed Computing.
Page updated
Google Sites
Report abuse