default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTijn de Vos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Michal Dory, Sebastian Forster, Yasamin Nazari
, Tijn de Vos:
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. ICALP 2024: 58:1-58:19- [c9]Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos:
Fast 2-Approximate All-Pairs Shortest Paths. SODA 2024: 4728-4757 - [i9]Tijn de Vos, Aleksander B. G. Christiansen:
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity. CoRR abs/2405.09141 (2024) - 2023
- [j2]Sebastian Forster, Tijn de Vos:
Faster Cut Sparsification of Weighted Graphs. Algorithmica 85(4): 929-964 (2023) - [j1]Laurent Feuilloley, Tijn de Vos:
The Environmental Cost of Our Conferences: The CO2 Emissions due to Travel at PODC and DISC. SIGACT News 54(4): 94-107 (2023) - [c8]Tijn de Vos:
Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model. PODC 2023: 71-74 - [c7]Sebastian Forster, Tijn de Vos:
Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. PODC 2023: 75-78 - [c6]Tijn de Vos:
Minimum Cost Flow in the CONGEST Model. SIROCCO 2023: 406-426 - [c5]Sebastian Forster, Antonis Skarlatos, Tijn de Vos:
Fast Algorithms for Energy Games in Special Cases. GandALF 2023: 236-252 - [i8]Tijn de Vos:
Minimum Cost Flow in the CONGEST Model. CoRR abs/2304.01600 (2023) - [i7]Sebastian Forster, Tijn de Vos:
The Laplacian Paradigm in Deterministic Congested Clique. CoRR abs/2304.02315 (2023) - [i6]Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos:
Fast 2-Approximate All-Pairs Shortest Paths. CoRR abs/2307.09258 (2023) - 2022
- [c4]Sebastian Forster, Tijn de Vos:
Faster Cut Sparsification of Weighted Graphs. ICALP 2022: 61:1-61:19 - [c3]Joran van Apeldoorn, Tijn de Vos:
A Framework for Distributed Quantum Queries in the CONGEST Model. PODC 2022: 109-119 - [c2]Sebastian Forster, Tijn de Vos:
The Laplacian Paradigm in the Broadcast Congested Clique. PODC 2022: 335-344 - [i5]Joran van Apeldoorn, Tijn de Vos:
A Framework for Distributed Quantum Queries in the CONGEST Model. CoRR abs/2202.10969 (2022) - [i4]Sebastian Forster, Tijn de Vos:
The Laplacian Paradigm in the Broadcast Congested Clique. CoRR abs/2205.12059 (2022) - [i3]Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos:
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR abs/2211.01152 (2022) - 2021
- [c1]Sebastian Forster, Martin Grösbacher, Tijn de Vos:
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. OPODIS 2021: 16:1-16:17 - [i2]Sebastian Forster, Martin Grösbacher, Tijn de Vos:
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. CoRR abs/2111.08975 (2021) - [i1]Sebastian Forster, Tijn de Vos:
Faster Cut Sparsification of Weighted Graphs. CoRR abs/2112.03120 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
