Tijn de Vos

30 papers A* 8A 2B 3Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Deterministic Edge Coloring with few Colors in CONGEST.
CoRR
Joakim Blikstad, Yannic Maus, Tijn de Vos
2025 A conf
Brief Announcement: Distributed Sparsest Cut via Eigenvalue Estimation.
DISC
Yannic Maus, Tijn de Vos
2025 J jnl
Distributed Sparsest Cut via Eigenvalue Estimation.
CoRR
Yannic Maus, Tijn de Vos
2025 J jnl
Dynamic Matroids: Base Packing and Covering.
CoRR
Tijn de Vos, Mara Grilnberger
2025 B conf
Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances.
SPAA
Jan van den Brand, Hossein Gholizadeh, Yonggang Jiang, Tijn de Vos
2025 J jnl
Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances.
CoRR
Jan van den Brand, Hossein Gholizadeh, Yonggang Jiang, Tijn de Vos
2025 A conf
Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders.
DISC
Emilio Cruciani, Sebastian Forster, Tijn de Vos
2025 J jnl
Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders.
CoRR
Emilio Cruciani, Sebastian Forster, Tijn de Vos
2025 A* conf
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity.
SODA
Tijn de Vos, Aleksander B. G. Christiansen
2024 A* conf
Fast 2-Approximate All-Pairs Shortest Paths.
SODA
Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
2024 A* conf
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths.
ICALP
Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
2024 J jnl
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity.
CoRR
Tijn de Vos, Aleksander B. G. Christiansen
2023 A* conf
Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model.
PODC
Tijn de Vos
2023 A* conf
Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique.
PODC
Sebastian Forster, Tijn de Vos
2023 J jnl
Fast 2-Approximate All-Pairs Shortest Paths.
CoRR
Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
2023 — conf
Fast Algorithms for Energy Games in Special Cases.
GandALF
Sebastian Forster, Antonis Skarlatos, Tijn de Vos
2023 J jnl
Faster Cut Sparsification of Weighted Graphs.
Algorithmica
Sebastian Forster, Tijn de Vos
2023 B conf
Minimum Cost Flow in the CONGEST Model.
SIROCCO
Tijn de Vos
2023 J jnl
Minimum Cost Flow in the CONGEST Model.
CoRR
Tijn de Vos
2023 J jnl
The Environmental Cost of Our Conferences: The CO2 Emissions due to Travel at PODC and DISC.
SIGACT News
Laurent Feuilloley, Tijn de Vos
2023 J jnl
The Laplacian Paradigm in Deterministic Congested Clique.
CoRR
Sebastian Forster, Tijn de Vos
2022 A* conf
A Framework for Distributed Quantum Queries in the CONGEST Model.
PODC
Joran van Apeldoorn, Tijn de Vos
2022 J jnl
A Framework for Distributed Quantum Queries in the CONGEST Model.
CoRR
Joran van Apeldoorn, Tijn de Vos
2022 A* conf
Faster Cut Sparsification of Weighted Graphs.
ICALP
Sebastian Forster, Tijn de Vos
2022 J jnl
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths.
CoRR
Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
2022 A* conf
The Laplacian Paradigm in the Broadcast Congested Clique.
PODC
Sebastian Forster, Tijn de Vos
2022 J jnl
The Laplacian Paradigm in the Broadcast Congested Clique.
CoRR
Sebastian Forster, Tijn de Vos
2021 B conf
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions.
OPODIS
Sebastian Forster, Martin Grösbacher, Tijn de Vos
2021 J jnl
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions.
CoRR
Sebastian Forster, Martin Grösbacher, Tijn de Vos
2021 J jnl
Faster Cut Sparsification of Weighted Graphs.
CoRR
Sebastian Forster, Tijn de Vos