| 2026 | ICALP | Back in the Saddle: Toward Parallel Approximate Minimum-Cost Flow. | Rasmus Kyng, Aurelio L. Sulser |
| 2026 | SODA | A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows. | Maximilian Probst Gutenberg, Rasmus Kyng, Weixuan Yuan, Wuwei Yuan |
| 2025 | ESA | Bootstrapping Dynamic APSP via Sparsification. | Rasmus Kyng, Simon Meierhans, Gernot Zcklein |
| 2025 | FOCS | Deterministic Almost-Linear-Time Gomory-Hu Trees. | Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan |
| 2025 | FOCS | Random-Shift Revisited: Tight Approximations for Tree Embeddings and ℓ₁-Oblivious Routings. | Rasmus Kyng, Maximilian Probst Gutenberg, Tim Rieder |
| 2025 | ICALP | Acceleration Meets Inverse Maintenance: Faster ℓ | Deeksha Adil, Shunhua Jiang, Rasmus Kyng |
| 2025 | ICALP | A Simple Dynamic Spanner via APSP. | Rasmus Kyng, Simon Meierhans, Gernot Zcklein |
| 2025 | MFCS | Almost-Linear Time Algorithms for Partially Dynamic Graphs (Invited Talk). | Rasmus Kyng |
| 2024 | FOCS | Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. | Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2024 | ICALP | Optimal Electrical Oblivious Routing on Expanders. | Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2024 | SODA | Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. | Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2024 | STOC | Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. | Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg |
| 2024 | STOC | A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications. | Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg |
| 2024 | SPAA | A Framework for Parallelizing Approximate Gaussian Elimination. | Yves Baumann, Rasmus Kyng |
| 2023 | FOCS | A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. | Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2023 | ICALP | An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk). | Rasmus Kyng |
| 2023 | SODA | Maintaining Expander Decompositions via Sparse Cuts. | Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu |
| 2022 | AISTATS | On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization. | Nicolas Emmenegger, Rasmus Kyng, Ahad N. Zehmakan |
| 2022 | FOCS | Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. | Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2022 | FOCS | Derandomizing Directed Random Walks in Almost-Linear Time. | Rasmus Kyng, Simon Meierhans, Maximilian Probst |
| 2022 | ICALP | Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions. | Ming Ding, Rasmus Kyng, Peng Zhang |
| 2022 | ICALP | Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. | Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang |
| 2022 | SODA | Scalar and Matrix Chernoff Bounds from ℓ | Tali Kaufman, Rasmus Kyng, Federico Sold |
| 2022 | SODA | Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. | Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg |
| 2021 | ICALP | Almost-Linear-Time Weighted 𝓁 | Deeksha Adil, Brian Bullins, Rasmus Kyng, Sushant Sachdeva |
| 2020 | SODA | Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard. | Rasmus Kyng, Di Wang, Peng Zhang |
| 2019 | SODA | Iterative Refinement for ℓp-norm Regression. | Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva |
| 2019 | STOC | Flows in almost linear time via adaptive preconditioning. | Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang |
| 2018 | FOCS | Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. | Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford |
| 2018 | FOCS | A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees. | Rasmus Kyng, Zhao Song |
| 2018 | STOC | Incomplete nested dissection. | Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang |
| 2017 | FOCS | Hardness Results for Structured Linear Systems. | Rasmus Kyng, Peng Zhang |
| 2017 | SODA | A Framework for Analyzing Resparsification Algorithms. | Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva |
| 2017 | STOC | Sampling random spanning trees faster than matrix multiplication. | David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva |
| 2016 | FOCS | Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple. | Rasmus Kyng, Sushant Sachdeva |
| 2016 | STOC | Sparsified Cholesky and multigrid solvers for connection laplacians. | Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman |
| 2015 | COLT | Algorithms for Lipschitz Learning on Graphs. | Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman |
| 2014 | STOC | Solving SDD linear systems in nearly | Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu |