| 2026 | ESA | Dynamic Matroids: Base Packing and Covering. | Tijn de Vos, Mara Grilnberger |
| 2026 | PODC | Brief Announcement: Deterministic Edge Coloring with few Colors in CONGEST. | Tijn de Vos, Yannic Maus, Joakim Blikstad |
| 2026 | SPAA | Deterministic Distance Approximation in MPC via Improved Hitting Sets. | Kyungjin Cho, Michal Dory, Yannic Maus, Tijn de Vos |
| 2026 | SIROCCO | Distributed Sparsest Cut via Eigenvalue Estimation. | Yannic Maus, Tijn de Vos |
| 2025 | SODA | Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity. | Tijn de Vos, Aleksander B. G. Christiansen |
| 2025 | SPAA | Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances. | Jan van den Brand, Hossein Gholizadeh, Yonggang Jiang, Tijn de Vos |
| 2024 | ICALP | New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. | Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos |
| 2024 | SODA | Fast 2-Approximate All-Pairs Shortest Paths. | Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos |
| 2023 | PODC | Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. | Sebastian Forster, Tijn de Vos |
| 2023 | PODC | Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model. | Tijn de Vos |
| 2023 | SIROCCO | Minimum Cost Flow in the CONGEST Model. | Tijn de Vos |
| 2022 | ICALP | Faster Cut Sparsification of Weighted Graphs. | Sebastian Forster, Tijn de Vos |
| 2022 | PODC | A Framework for Distributed Quantum Queries in the CONGEST Model. | Joran van Apeldoorn, Tijn de Vos |
| 2022 | PODC | The Laplacian Paradigm in the Broadcast Congested Clique. | Sebastian Forster, Tijn de Vos |
| 2021 | OPODIS | An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. | Sebastian Forster, Martin Grsbacher, Tijn de Vos |