László A. Végh

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 74

Top Venues

Publications

Jugal Garg, Yixin Tao, László A. Végh
Approximating Competitive Equilibrium by Nash Welfare. CoRR (2024)
Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Math. Program. 204 (1) (2024)
Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh
A First Order Method for Linear Programming Parameterized by Circuit Imbalance. IPCO (2024)
Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. STOC (2024)
Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
On circuit diameter bounds via circuit imbalances. Math. Program. 206 (1) (2024)
Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh
A First Order Method for Linear Programming Parameterized by Circuit Imbalance. CoRR (2023)
Jugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák
Approximating Nash Social Welfare by Matching and Local Search. STOC (2023)
Christoph Hertrich, Yixin Tao, László A. Végh
Mode Connectivity in Auction Design. NeurIPS (2023)
Satoru Fujishige, Tomonari Kitahara, László A. Végh
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem. IPCO (2023)
Christoph Hertrich, Yixin Tao, László A. Végh
Mode Connectivity in Auction Design. CoRR (2023)
Jugal Garg, László A. Végh
A Strongly Polynomial Algorithm for Linear Exchange Markets. Oper. Res. 71 (2) (2023)
James B. Orlin, László A. Végh
Directed Shortest Paths via Approximate Cost Balancing. J. ACM 70 (1) (2023)
Katharina Eickhoff, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh
Faster Ascending Auctions via Polymatroid Sum. CoRR (2023)
Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh
On the Correlation Gap of Matroids. IPCO (2023)
Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh
Interior point methods are not worse than Simplex. CoRR (2022)
Daniel Dadush, László A. Végh, Giacomo Zambelli
On finding exact solutions of linear programs in the oracle model. SODA (2022)
Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
On Circuit Diameter Bounds via Circuit Imbalances. IPCO (2022)
Jugal Garg, Yixin Tao, László A. Végh
Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. SODA (2022)
Edin Husic, Georg Loho, Ben Smith, László A. Végh
On complete classes of valuated matroids. SODA (2022)
Jugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák
Approximating Nash Social Welfare by Matching and Local Search. CoRR (2022)
Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh
Interior point methods are not worse than Simplex. FOCS (2022)
Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh
Tractable Fragments of the Maximum Nash Welfare Problem. WINE (2022)
Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh
On the Correlation Gap of Matroids. CoRR (2022)
Farbod Ekbatani, Bento Natura, László A. Végh
Circuit imbalance measures and linear programming. CoRR (2021)
Dan Dadush, László A. Végh, Giacomo Zambelli
Geometric Rescaling Algorithms for Submodular Function Minimization. Math. Oper. Res. 46 (3) (2021)
Jugal Garg, Edin Husic, László A. Végh
Approximating nash social welfare under rado valuations. SIGecom Exch. 19 (1) (2021)
Jugal Garg, Edin Husic, László A. Végh
Approximating Nash social welfare under rado valuations. STOC (2021)
Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. ESA (2021)
Noga Ron-Zewi, Ivona Bezáková, László A. Végh
Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. Theory Comput. 17 (2021)
Jugal Garg, Edin Husic, László A. Végh
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. STACS (2021)
James B. Orlin, László A. Végh
Directed Shortest Paths via Approximate Cost Balancing. SODA (2021)
Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh
Tractable Fragments of the Maximum Nash Welfare Problem. CoRR (2021)
Jugal Garg, Yixin Tao, László A. Végh
Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. CoRR (2021)
Edin Husic, Georg Loho, Ben Smith, László A. Végh
On complete classes of valuated matroids. CoRR (2021)
Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
On Circuit Diameter Bounds via Circuit Imbalances. CoRR (2021)
Ola Svensson, Jakub Tarnawski, László A. Végh
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. J. ACM 67 (6) (2020)
Zhuan Khye Koh, Bento Natura, László A. Végh
A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality. CoRR (2020)
Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. STOC (2020)
Jugal Garg, Edin Husic, László A. Végh
Approximating Nash Social Welfare under Rado Valuations. CoRR (2020)
Daniel Dadush, László A. Végh, Giacomo Zambelli
Rescaling Algorithms for Linear Conic Feasibility. Math. Oper. Res. 45 (2) (2020)
Daniel Dadush, Bento Natura, László A. Végh
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. FOCS (2020)
Daniel Dadush, Bento Natura, László A. Végh
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. CoRR (2020)
James B. Orlin, László A. Végh
Directed Shortest Paths via Approximate Cost Balancing. CoRR (2020)
Georg Loho, László A. Végh
Signed Tropical Convexity. ITCS (2020)
Neil Olver, László A. Végh
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. J. ACM 67 (2) (2020)
Robbert Fokkink, Thomas Lidbetter, László A. Végh
On Submodular Search and Machine Scheduling. Math. Oper. Res. 44 (4) (2019)
Jugal Garg, Edin Husic, László A. Végh
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands. CoRR (2019)
Jugal Garg, László A. Végh
A strongly polynomial algorithm for linear exchange markets. STOC (2019)
Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. CoRR (2019)
Ola Svensson, Jakub Tarnawski, László A. Végh
A constant-factor approximation algorithm for the asymmetric traveling salesman problem. STOC (2018)
Mohit Singh, László A. Végh
Approximating Minimum Cost Connectivity Orientation and Augmentation. SIAM J. Comput. 47 (1) (2018)
Daniel Dadush, László A. Végh, Giacomo Zambelli
Geometric Rescaling Algorithms for Submodular Function Minimization. SODA (2018)
Jugal Garg, László A. Végh
A Strongly Polynomial Algorithm for Linear Exchange Markets. CoRR (2018)
Ola Svensson, Jakub Tarnawski, László A. Végh
Constant factor approximation for ATSP with two edge weights. Math. Program. 172 (1-2) (2018)
Alina Ene, Huy L. Nguyen, László A. Végh
Decomposable Submodular Function Minimization: Discrete and Continuous. CoRR (2017)
Daniel Dadush, László A. Végh, Giacomo Zambelli
Geometric Rescaling Algorithms for Submodular Function Minimization. CoRR (2017)
Neil Olver, László A. Végh
A simpler and faster strongly polynomial algorithm for generalized flow maximization. STOC (2017)
Ola Svensson, Jakub Tarnawski, László A. Végh
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. CoRR (2017)
Alina Ene, Huy L. Nguyen, László A. Végh
Decomposable Submodular Function Minimization: Discrete and Continuous. NIPS (2017)
László A. Végh
A Strongly Polynomial Algorithm for Generalized Flow Maximization. Math. Oper. Res. 42 (1) (2017)
Nikhil R. Devanur, Jugal Garg, László A. Végh
A Rational Convex Program for Linear Arrow-Debreu Markets. ACM Trans. Economics and Comput. 5 (1) (2016)
Daniel Dadush, László A. Végh, Giacomo Zambelli
Rescaling Algorithms for Linear Programming - Part I: Conic feasibility. CoRR (2016)
Ola Svensson, Jakub Tarnawski, László A. Végh
Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). IPCO (2016)
Matthias Mnich, Virginia Vassilevska Williams, László A. Végh
A 7/3-Approximation for Feedback Vertex Sets in Tournaments. ESA (2016)
László A. Végh
A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives. SIAM J. Comput. 45 (5) (2016)
Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
The Cutting Plane Method is Polynomial for Perfect Matchings. Math. Oper. Res. 41 (1) (2016)
Daniel Dadush, László A. Végh, Giacomo Zambelli
Rescaled Coordinate Descent Methods for Linear Programming. IPCO (2016)
Neil Olver, László A. Végh
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. CoRR (2016)
Takuro Fukunaga, R. Ravi, László A. Végh
Current Trends in Combinatorial Optimization (NII Shonan Meeting 2016-7). NII Shonan Meet. Rep. 2016 (2016)
Dániel Marx, László A. Végh
Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation. ACM Trans. Algorithms 11 (4) (2015)
Georgios Piliouras, Tomás Valla, László A. Végh
LP-Based Covering Games with Low Price of Anarchy. Theory Comput. Syst. 57 (1) (2015)
László A. Végh, Bernhard von Stengel
Oriented Euler complexes and signed perfect matchings. Math. Program. 150 (1) (2015)
Matthias Mnich, Virginia Vassilevska Williams, László A. Végh
A 7/3-Approximation for Feedback Vertex Sets in Tournaments. CoRR (2015)
Ola Svensson, Jakub Tarnawski, László A. Végh
Constant Factor Approximation for ATSP with Two Edge Weights. CoRR (2015)
Mohit Singh, László A. Végh
Approximating Minimum Cost Connectivity Orientation and Augmentation. SODA (2014)
László A. Végh
A strongly polynomial algorithm for generalized flow maximization. STOC (2014)
Ruta Mehta, Nithum Thain, László A. Végh, Adrian Vetta
To Save Or Not To Save: The Fisher Game. WINE (2014)
Joseph Cheriyan, László A. Végh
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. SIAM J. Comput. 43 (4) (2014)
László A. Végh
Concave Generalized Flows with Applications to Market Equilibria. Math. Oper. Res. 39 (2) (2014)
László A. Végh, Giacomo Zambelli
A polynomial projection-type algorithm for linear programming. Oper. Res. Lett. 42 (1) (2014)
Dániel Marx, László A. Végh
Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation. ICALP (1) (2013)
Nikhil R. Devanur, Jugal Garg, László A. Végh
A Rational Convex Program for Linear Arrow-Debreu Markets. CoRR (2013)
Mohit Singh, László A. Végh
Approximating Minimum Cost Connectivity Orientation and Augmentation. CoRR (2013)
Attila Bernáth, Tamás Király, Erika R. Kovács, Gergely Mádi-Nagy, Gyula Pap, Júlia Pap, Jácint Szabó, László A. Végh
Algorithms for multiplayer multicommodity flow problems. Central Eur. J. Oper. Res. 21 (4) (2013)
Dániel Marx, László A. Végh
Fixed-parameter algorithms for minimum cost edge-connectivity augmentation CoRR (2013)
Joseph Cheriyan, László A. Végh
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. FOCS (2013)
László A. Végh
Strongly polynomial algorithm for generalized flows. CoRR (2013)
László A. Végh, Giacomo Zambelli
A polynomial projection-type algorithm for linear programming. CoRR (2013)
László A. Végh, Bernhard von Stengel
Oriented Euler Complexes and Signed Perfect Matchings CoRR (2012)
Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
The Cutting Plane Method is Polynomial for Perfect Matchings CoRR (2012)
Joseph Cheriyan, László A. Végh
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs CoRR (2012)
Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
The Cutting Plane Method Is Polynomial for Perfect Matchings. FOCS (2012)
Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh
On Mimicking Networks Representing Minimum Terminal Cuts CoRR (2012)
László A. Végh
Concave Generalized Flows with Applications to Market Equilibria. FOCS (2012)
László A. Végh
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. STOC (2012)
Georgios Piliouras, Tomás Valla, László A. Végh
LP-based Covering Games with Low Price of Anarchy CoRR (2012)
Georgios Piliouras, Tomás Valla, László A. Végh
LP-Based Covering Games with Low Price of Anarchy. WINE (2012)
László A. Végh
Augmenting Undirected Node-Connectivity by One. SIAM J. Discret. Math. 25 (2) (2011)
Zsolt Lakatos, Lajos Bajzik, Tamas Karasz, Kristóf Bérczi, Erika R. Kovács, László A. Végh
ILP based diverse path routing with node inclusion. ICUMT (2011)
Erika R. Kovács, László A. Végh
)-edge-connected digraphs. Comb. 31 (2) (2011)

László A. Végh.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

László A. Végh