Bento Natura

According to our database, Bento Natura authored at least 14 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Circuit Diameter of Polyhedra is Strongly Polynomial.

Bento Natura

CoRR, February, 2026

Trust Region Interior Point Methods: Optimal ℓ₂- and Faster Wide-Neighborhood Path Following.

Daniel Dadush, Haoyuan Ma, Bento Natura, László A. Végh

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025

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

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

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

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2022

On Circuit Diameter Bounds via Circuit Imbalances.

Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

A Faster Interior-Point Method for Sum-Of-Squares Optimization.

Shunhua Jiang, Bento Natura, Omri Weinstein

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Interior point methods are not worse than Simplex.

Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

The Pareto Cover Problem.

Bento Natura, Meike Neuwohner, Stefan Weltge

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Circuit imbalance measures and linear programming.

Farbod Ekbatani, Bento Natura, László A. Végh

CoRR, 2021

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

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

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

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

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers.

Daniel Dadush, Bento Natura, László A. Végh

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Global Interconnect Optimization.

Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter

Proceedings of the International Conference on Computer-Aided Design, 2019