Jan van den Brand
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
27
Venues
7
Active years
2016–2026
Best venue rank
A*
Where they publish
Papers
27 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Dynamic Rank, Basis, and Matching. | Jan van den Brand, Vishal Kumar, Daniel J. Zhang |
| 2026 | ICALP | Computing Flows in Subquadratic Space. | Jan van den Brand, Zhao Song, Albert Weng |
| 2026 | STOC | An Optimal Algorithm for Stochastic Vertex Cover. | Jan van den Brand, Inge Li Grtz, Chirag Pabbaraju, Debmalya Panigrahi, Clifford Stein, Miltiadis Stouras, Ola Svensson, Ali Vakilian |
| 2025 | SPAA | Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances. | Jan van den Brand, Hossein Gholizadeh, Yonggang Jiang, Tijn de Vos |
| 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 | The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants. | Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang |
| 2024 | ICML | Algorithm and Hardness for Dynamic Attention Maintenance in Large Language Models. | Jan van den Brand, Zhao Song, Tianyi Zhou |
| 2024 | SODA | Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary. | Anastasiia Alokhina, Jan van den Brand |
| 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 | SODA | On Dynamic Graph Algorithms with Predictions. | Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak |
| 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 | FOCS | Deterministic Fully Dynamic SSSP and More. | Jan van den Brand, Adam Karczmarz |
| 2023 | FOCS | Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques. | Jan van den Brand, Daniel J. Zhang |
| 2023 | STOC | Dynamic Maxflow via Dynamic Interior Point Methods. | Jan van den Brand, Yang P. Liu, Aaron Sidford |
| 2022 | FOCS | Nearly Optimal Communication and Query Complexity of Bipartite Matching. | Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2022 | FOCS | Fast Deterministic Fully Dynamic Distance Approximation. | Jan van den Brand, Sebastian Forster, Yasamin Nazari |
| 2022 | ICALP | Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. | Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun |
| 2022 | STOC | Faster maxflow via improved dynamic spectral vertex sparsifiers. | Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford |
| 2021 | STOC | Breaking the quadratic barrier for matroid intersection. | Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2021 | STOC | Minimum cost flows, MDPs, and ℓ | Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang |
| 2020 | FOCS | Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. | Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang |
| 2020 | SODA | A Deterministic Linear Program Solver in Current Matrix Multiplication Time. | Jan van den Brand |
| 2020 | STOC | Solving tall dense linear programs in nearly linear time. | Jan van den Brand, Yin Tat Lee, Aaron Sidford, Zhao Song |
| 2019 | FOCS | Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. | Jan van den Brand, Danupon Nanongkai |
| 2019 | FOCS | Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. | Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak |
| 2019 | FOCS | Sensitive Distance and Reachability Oracles for Large Batch Updates. | Jan van den Brand, Thatchaphol Saranurak |
| 2016 | ACCV | Instance-Level Segmentation of Vehicles by Deep Contours. | Jan van den Brand, Matthias Ochs, Rudolf Mester |