Bento Natura
Orcid: 0000-0002-8068-3280
According to our database1,
Bento Natura
authored at least 11 papers
between 2020 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2020
2021
2022
2023
2024
0
1
2
3
4
2
3
1
1
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.
Math. Program., March, 2024
A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
2023
ACM Trans. Design Autom. Electr. Syst., September, 2023
Algorithmica, September, 2023
An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems.
Math. Oper. Res., 2023
2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
2021
2020
A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality.
CoRR, 2020
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020