Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. - Daniel Dadush; Bento Natura; László A. Végh (FOCS, 2020)

A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality. - Zhuan Khye Koh; Bento Natura; László A. Végh (CoRR, 2020)

Circuit imbalance measures and linear programming. - Farbod Ekbatani; Bento Natura; László A. Végh (CoRR, 2021)

The Pareto Cover Problem. - Bento Natura; Meike Neuwohner; Stefan Weltge (ESA, 2022)

Interior point methods are not worse than Simplex. - Xavier Allamigeon; Daniel Dadush; Georg Loho; Bento Natura; László A. Végh (FOCS, 2022)

An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. - Daniel Dadush; Zhuan Khye Koh; Bento Natura; László A. Végh (Math. Oper. Res., 2023)

A Faster Interior-Point Method for Sum-of-Squares Optimization. - Shunhua Jiang; Bento Natura; Omri Weinstein (Algorithmica, 2023)

Global Interconnect Optimization. - Siad Daboul; Stephan Held; Bento Natura; Daniel Rotter (ACM Trans. Design Autom. Electr. Syst., 2023)

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; László A. Végh (STOC, 2024)

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. - Daniel Dadush; Sophie Huiberts; Bento Natura; László A. Végh (Math. Program., 2024)

On circuit diameter bounds via circuit imbalances. - Daniel Dadush; Zhuan Khye Koh; Bento Natura; László A. Végh (Math. Program., 2024)

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; László A. Végh (STACS, 2025)