| 2026 | SODA | Matroids are Equitable. | Hannaneh Akrami, Roshan Raj, Lszl A. Vgh |
| 2026 | SODA | From Incremental Transitive Cover to Strongly Polynomial Maximum Flow. | Daniel Dadush, James B. Orlin, Aaron Sidford, Lszl A. Vgh |
| 2026 | STOC | Trust Region Interior Point Methods: Optimal ℓ₂- and Faster Wide-Neighborhood Path Following. | Daniel Dadush, Haoyuan Ma, Bento Natura, Lszl A. Vgh |
| 2025 | IPCO | An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding. | Sharat Ibrahimpur, Lszl A. Vgh |
| 2025 | SODA | Approximating Competitive Equilibrium by Nash Welfare. | Jugal Garg, Yixin Tao, Lszl A. Vgh |
| 2025 | STACS | 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, Lszl A. Vgh |
| 2024 | IPCO | A First Order Method for Linear Programming Parameterized by Circuit Imbalance. | Richard Cole, Christoph Hertrich, Yixin Tao, Lszl A. Vgh |
| 2024 | STOC | 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, Lszl A. Vgh |
| 2023 | IPCO | An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem. | Satoru Fujishige, Tomonari Kitahara, Lszl A. Vgh |
| 2023 | IPCO | On the Correlation Gap of Matroids. | Edin Husic, Zhuan Khye Koh, Georg Loho, Lszl A. Vgh |
| 2023 | STOC | Approximating Nash Social Welfare by Matching and Local Search. | Jugal Garg, Edin Husic, Wenzheng Li, Lszl A. Vgh, Jan Vondrk |
| 2022 | FOCS | Interior point methods are not worse than Simplex. | Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, Lszl A. Vgh |
| 2022 | IPCO | On Circuit Diameter Bounds via Circuit Imbalances. | Daniel Dadush, Zhuan Khye Koh, Bento Natura, Lszl A. Vgh |
| 2022 | SODA | On finding exact solutions of linear programs in the oracle model. | Daniel Dadush, Lszl A. Vgh, Giacomo Zambelli |
| 2022 | SODA | Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. | Jugal Garg, Yixin Tao, Lszl A. Vgh |
| 2022 | SODA | On complete classes of valuated matroids. | Edin Husic, Georg Loho, Ben Smith, Lszl A. Vgh |
| 2021 | ESA | An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. | Daniel Dadush, Zhuan Khye Koh, Bento Natura, Lszl A. Vgh |
| 2021 | SODA | Directed Shortest Paths via Approximate Cost Balancing. | James B. Orlin, Lszl A. Vgh |
| 2021 | STOC | Approximating Nash social welfare under rado valuations. | Jugal Garg, Edin Husic, Lszl A. Vgh |
| 2021 | STACS | Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. | Jugal Garg, Edin Husic, Lszl A. Vgh |
| 2020 | FOCS | Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. | Daniel Dadush, Bento Natura, Lszl A. Vgh |
| 2020 | STOC | A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. | Daniel Dadush, Sophie Huiberts, Bento Natura, Lszl A. Vgh |
| 2019 | STOC | A strongly polynomial algorithm for linear exchange markets. | Jugal Garg, Lszl A. Vgh |
| 2018 | SODA | Geometric Rescaling Algorithms for Submodular Function Minimization. | Daniel Dadush, Lszl A. Vgh, Giacomo Zambelli |
| 2018 | STOC | A constant-factor approximation algorithm for the asymmetric traveling salesman problem. | Ola Svensson, Jakub Tarnawski, Lszl A. Vgh |
| 2017 | STOC | A simpler and faster strongly polynomial algorithm for generalized flow maximization. | Neil Olver, Lszl A. Vgh |
| 2016 | ESA | A 7/3-Approximation for Feedback Vertex Sets in Tournaments. | Matthias Mnich, Virginia Vassilevska Williams, Lszl A. Vgh |
| 2016 | IPCO | Rescaled Coordinate Descent Methods for Linear Programming. | Daniel Dadush, Lszl A. Vgh, Giacomo Zambelli |
| 2016 | IPCO | Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). | Ola Svensson, Jakub Tarnawski, Lszl A. Vgh |
| 2014 | SODA | Approximating Minimum Cost Connectivity Orientation and Augmentation. | Mohit Singh, Lszl A. Vgh |
| 2014 | STOC | A strongly polynomial algorithm for generalized flow maximization. | Lszl A. Vgh |
| 2013 | FOCS | Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. | Joseph Cheriyan, Lszl A. Vgh |
| 2013 | ICALP | Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation. | Dniel Marx, Lszl A. Vgh |
| 2012 | FOCS | The Cutting Plane Method Is Polynomial for Perfect Matchings. | Karthekeyan Chandrasekaran, Lszl A. Vgh, Santosh S. Vempala |
| 2012 | FOCS | Concave Generalized Flows with Applications to Market Equilibria. | Lszl A. Vgh |
| 2012 | STOC | Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. | Lszl A. Vgh |
| 2010 | IPCO | Restricted | Kristf Brczi, Lszl A. Vgh |
| 2010 | STOC | Augmenting undirected node-connectivity by one. | Lszl A. Vgh |
| 2005 | SODA | Primal-dual approach for directed vertex connectivity augmentation and generalizations. | Lszl A. Vgh, Andrs A. Benczr |