Natura, Bento

Number of items: 13.
None
  • Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Végh, László A A. (2022). On circuit diameter bounds via circuit imbalances. In Aardal, K. & Sanità, L. (Eds.), Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Proceedings (pp. 140 - 153). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-06901-7_11
    • Public
  • Allamigeon, Xavier, Dadush, Daniel, Loho, Georg, Natura, Bento, Végh, László A. (2025). Interior point methods are not worse than simplex. SIAM Journal on Computing, 54(5), FOCS22-178 - FOCS22-264. https://doi.org/10.1137/23m1554588 picture_as_pdf
  • Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Olver, Neil, Vegh, Laszlo A. (2025). A strongly polynomial algorithm for linear programs with at most two non-zero entries per row or column. In Beyersdorff, O., Pilipczuk, M., Pimentel, E. & Thang, N. (Eds.), 42nd International Symposium On Theoretical Aspects Of Computer Science, Stacs 2025 . https://doi.org/10.4230/LIPIcs.STACS.2025.2 picture_as_pdf
  • Koh, Zhuan Khye, Natura, Bento, Végh, László A. (2024). On circuit diameter bounds via circuit imbalances. Mathematical Programming, 206(1-2), 631 - 662. https://doi.org/10.1007/s10107-024-02107-x picture_as_pdf
  • Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Olver, Neil, Végh, László A. (2024). A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column. In Mohar, B., Shinkar, I. & O�Donnell, R. (Eds.), STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC ’24), June 24–28 (pp. 1561 – 1572). ACM Press. https://doi.org/10.1145/3618260.3649764 picture_as_pdf
  • Dadush, Daniel, Huiberts, Sophie, Natura, Bento, Végh, László A. (2024). A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Mathematical Programming, 204(1-2), 135 – 206. https://doi.org/10.1007/s10107-023-01956-2 picture_as_pdf
  • Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Végh, László A. (2023). An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems. Mathematics of Operations Research, 48(4), 1934 - 1958. https://doi.org/10.1287/moor.2022.1326 picture_as_pdf
  • Natura, Bento, Neuwohner, Meike, Weltge, Stefan (2022). The Pareto cover problem. In Chechik, S., Navarro, G., Rotenberg, E. & Herman, G. (Eds.), Leibniz International Proceedings in Informatics, LIPIcs . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2022.80 picture_as_pdf
  • Jiang, Shunhua, Natura, Bento, Weinstein, Omri (2022). A faster interior-point method for sum-of-squares optimization. In Bojanczyk, M., Merelli, E. & Woodruff, D. P. (Eds.), 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2022.79 picture_as_pdf
  • Natura, Bento (2022). Exact linear programming circuits, curvature, and diameter [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.00004448
  • Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Végh, László A. (2021). An accelerated Newton-dinkelbach method and its application to two variables per inequality systems. In Mutzel, P., Pagh, R. & Herman, G. (Eds.), 29th Annual European Symposium on Algorithms, ESA 2021 . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2021.36 picture_as_pdf
  • Dadush, Daniel, Natura, Bento, Végh, László A. (2020). Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers. In Proceedings of The 61st Annual Symposium on Foundations of Computer Science (FOCS 2020), November 16-19 (pp. 931-942). IEEE Computer Society. picture_as_pdf
  • Dadush, Daniel, Huiberts, Sophie, Natura, Bento, Végh, László A. (2020). A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. In Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (Eds.), STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (pp. 761-774). Association for Computing Machinery. https://doi.org/10.1145/3357713.3384326 picture_as_pdf