I'm a postoc in the group of Yannic Maus at the Institute of Algorithms and Theory, 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.
Pronouns: they/them/he/him
tijn [dot] devos [at] tugraz.at
I will give a talk at the Workshop on Algorithms for Massive Graphs (AMG 2026, colocated with DISC 2026 in Rome).
Our manuscript "Distributed Santa Claus via Global Rounding" is now available on arXiv.
I will serve on the PC of PODC 2026.
Our manuscript "Deterministic Edge Coloring with few Colors in CONGEST" is now available on arXiv. It is accecpted as a BA at PODC 2026.
I will present our paper "Distributed Sparsest Cut via Eigenvalue Estimation" at SIROCCO 2026.
I received the Michael-Breitenbach-Dissertation Award (Second place) for my PhD thesis.
I wrote a blog about environmentally aware candidates for the EATCS election 2025.
Our paper "Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances" is accepted to SPAA 2025. It has been awarded the distinguished paper award.
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.
Graph Algorithms
Distributed Computing
Dynamic Graph Algorithms
Distributed Santa Claus via Global Rounding (arXiv)
Tijn de Vos ® Leo Wennmann ® Malte Baumecker ® Yannic Maus ® Florian Schager
In submission
Deterministic Edge Coloring with few Colors in CONGEST (arXiv)
Joakim Blikstad ® Yannic Maus ® Tijn de Vos
In submission
PODC 2026 (Brief announcement)
Dynamic Matroids: Base Packing and Covering (arXiv)
Tijn de Vos ® Mara Grilnberger
In submission
Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders (arXiv)
Emilio Cruciani, Sebastian Forster, Tijn de Vos
DISC 2025
Distributed Sparsest Cut via Eigenvalue Estimation (arXiv)
Yannic Maus ® Tijn de Vos
SIROCCO 2026
DISC 2025 (Brief announcement)
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 - Distinguished Paper Award
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
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.
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,
Environmental co-chair of DISC 2023, with Laurent Feuilloley. For our report on PODC-DISC travel emisions, see here.
Member of the PODC 2026 Program Committee.
Regular reviewer for STOC, FOCS, SODA, ICALP, PODC, DISC, ESA, STACS, ITCS, SOSA, APPROX, SIROCCO, IPDPS.
Reviewer for Distributed Computing.