Q6065293
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Faster min-cost flow and approximate tree decomposition on bounded treewidth graphs | 2026-05-26 | Paper |
| Nested dissection meets IPMs: planar min-cost flow in nearly-linear time Journal of the ACM | 2025-10-23 | Paper |
| Fast algorithms for separable linear programs | 2024-11-28 | Paper |
| Nested dissection meets IPMs: planar min-cost flow in nearly-linear time | 2024-07-19 | Paper |
| A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions | 2021-12-13 | Paper |
Research outcomes over time
This page was built for person:
