| 2026 | STOC | Trust Region Interior Point Methods: Optimal ℓ₂- and Faster Wide-Neighborhood Path Following. | Daniel Dadush, Haoyuan Ma, Bento Natura, Lszl A. Vgh |
| 2025 | STACS | A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk). | Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, Lszl A. Vgh |
| 2024 | STOC | A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. | Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, Lszl A. Vgh |
| 2022 | ESA | The Pareto Cover Problem. | Bento Natura, Meike Neuwohner, Stefan Weltge |
| 2022 | FOCS | Interior point methods are not worse than Simplex. | Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, Lszl A. Vgh |
| 2022 | ICALP | A Faster Interior-Point Method for Sum-Of-Squares Optimization. | Shunhua Jiang, Bento Natura, Omri Weinstein |
| 2022 | IPCO | On Circuit Diameter Bounds via Circuit Imbalances. | Daniel Dadush, Zhuan Khye Koh, Bento Natura, Lszl A. Vgh |
| 2021 | ESA | An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. | Daniel Dadush, Zhuan Khye Koh, Bento Natura, Lszl A. Vgh |
| 2020 | FOCS | Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. | Daniel Dadush, Bento Natura, Lszl A. Vgh |
| 2020 | STOC | A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. | Daniel Dadush, Sophie Huiberts, Bento Natura, Lszl A. Vgh |
| 2019 | ICCAD | Global Interconnect Optimization. | Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter |