Publications

2025

  1. Interior point methods are not worse than Simplex

2024

  1. On Circuit Diameter Bounds via Circuit Imbalances
    Daniel DadushZhuan Khye Koh Bento Natura , and László A. Végh
  2. A strongly polynomial algorithm for linear programs with at most two non-zero entries per row or column

2023

  1. A Scaling-Invariant Algorithm for Linear Programming Whose Running Time Depends Only on the Constraint Matrix
    Daniel DadushSophie Huiberts Bento Natura , and László A. Végh
  2. A Faster Interior-Point Method for Sum-Of-Squares Optimization
    Shunhua Jiang Bento Natura , and Omri Weinstein
  3. Global Interconnect Optimization
    Siad DaboulStephan Held Bento Natura , and Daniel Rotter

2022

  1. An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems
    Daniel DadushZhuan Khye Koh Bento Natura , and László A. Végh
  2. Circuit Imbalance Measures and Linear Programming
    Farbod Ekbatani Bento Natura , and László A. Végh
  3. The Pareto cover problem
    Bento Natura Meike Neuwohner, and Stefan Weltge

2020

  1. Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers
    Daniel Dadush Bento Natura , and László A. Végh