Остановите войну!
for scientists:
default search action
Rasmus Kyng
- > Home > Persons > Rasmus Kyng
Publications
- 2024
- [c28]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. SODA 2024: 2980-2998 - 2023
- [j2]Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Commun. ACM 66(12): 85-92 (2023) - [c27]Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. FOCS 2023: 503-514 - [c25]Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu:
Maintaining Expander Decompositions via Sparse Cuts. SODA 2023: 48-69 - [c24]Li Chen, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
A Simple Framework for Finding Balanced Sparse Cuts via APSP. SOSA 2023: 42-55 - [i30]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. CoRR abs/2309.16629 (2023) - [i29]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. CoRR abs/2311.03174 (2023) - [i28]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications. CoRR abs/2311.06402 (2023) - [i27]Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg:
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. CoRR abs/2311.18295 (2023) - 2022
- [c22]Rasmus Kyng, Simon Meierhans, Maximilian Probst:
Derandomizing Directed Random Walks in Almost-Linear Time. FOCS 2022: 407-418 - [c21]Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. FOCS 2022: 612-623 - [c20]Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang:
Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. ICALP 2022: 53:1-53:19 - [c17]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. SODA 2022: 3452-3481 - [i25]Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang:
Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. CoRR abs/2202.05011 (2022) - [i24]Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. CoRR abs/2203.00671 (2022) - [i23]Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu:
Maintaining Expander Decompositions via Sparse Cuts. CoRR abs/2204.02519 (2022) - [i22]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Derandomizing Directed Random Walks in Almost-Linear Time. CoRR abs/2208.10959 (2022) - [i21]Li Chen, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
A Simple Framework for Finding Balanced Sparse Cuts via APSP. CoRR abs/2209.08845 (2022) - 2021
- [i16]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. CoRR abs/2110.11712 (2021)
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-04-07 22:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint