Lune

Profiles2020-2026

Rasmus Kyng

Ilan University

14Papers
0Last author
19Unique co-authors
5First author
0Solo

First and last author come from byline position, which some venues assign alphabetically.

Recent papers14

  1. A Simple and Fast Reduction from Gomory-Hu Trees to Polylog MaxflowsAuthor 2 of 5SODA 2026
  2. Deterministic Almost-Linear-Time Gomory-Hu TreesAuthor 2 of 9FOCS 2025 · 10 citations
  3. Random-Shift Revisited: Tight Approximations for Tree Embeddings and ℓ₁-Oblivious RoutingsAuthor 1 of 4FOCS 2025 · 1 citation
  4. Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost FlowAuthor 2 of 6STOC 2024 · 11 citations
  5. Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update TimeAuthor 3 of 9SODA 2024 · 3 citations
  6. A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their ApplicationsAuthor 1 of 4STOC 2024 · 2 citations
  7. Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via DualityAuthor 3 of 8FOCS 2024 · 1 citation
  8. A Deterministic Almost-Linear Time Algorithm for Minimum-Cost FlowAuthor 3 of 9FOCS 2023 · 28 citations
  9. Maintaining Expander Decompositions via Sparse CutsAuthor 3 of 5SODA 2023 · 5 citations
  10. Maximum Flow and Minimum-Cost Flow in Almost-Linear TimeAuthor 2 of 7FOCS 2022 · 135 citations
  11. Scalar and Matrix Chernoff Bounds from ℓ∞-IndependenceAuthor 2 of 4SODA 2022 · 7 citations
  12. Derandomizing Directed Random Walks in Almost-Linear TimeAuthor 1 of 4FOCS 2022 · 5 citations
  13. Incremental SSSP for Sparse Digraphs Beyond the Hopset BarrierAuthor 1 of 4SODA 2022 · 3 citations
  14. Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are HardAuthor 1 of 4SODA 2020 · 5 citations
Dusk over the sea between two cliffs drawn in fine vertical lines