László A. Végh

According to our database, László A. Végh authored at least 68 papers between 2005 and 2025.

Collaborative distances:

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

2025

From Incremental Transitive Cover to Strongly Polynomial Maximum Flow.

Daniel Dadush, James B. Orlin, Aaron Sidford, László A. Végh

CoRR, October, 2025

Faster Dynamic Auctions via Polymatroid Sum.

Katharina Eickhoff, Meike Neuwohner, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh

ACM Trans. Economics and Comput., September, 2025

IFORS' Operational Research Hall of Fame: Ailsa Land.

Jonathan Rosenhead, László A. Végh

Int. Trans. Oper. Res., July, 2025

Matroids are Equitable.

Hannaneh Akrami, Roshan Raj, László A. Végh

CoRR, July, 2025

Tight Efficiency Bounds for the Probabilistic Serial Mechanism under Cardinal Preferences.

Jugal Garg, Yixin Tao, László A. Végh

CoRR, July, 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

Approximating Competitive Equilibrium by Nash Welfare.

Jugal Garg, Yixin Tao, László A. Végh

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding.

Sharat Ibrahimpur, László A. Végh

Proceedings of the Integer Programming and Combinatorial Optimization, 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

A First Order Method for Linear Programming Parameterized by Circuit Imbalance.

Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

An Auction Algorithm for Market Equilibrium with Weak Gross Substitute Demands.

Jugal Garg, Edin Husic, László A. Végh

ACM Trans. Economics and Comput., 2023

Faster Ascending Auctions via Polymatroid Sum.

Katharina Eickhoff, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh

CoRR, 2023

Approximating Nash Social Welfare by Matching and Local Search.

Jugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Mode Connectivity in Auction Design.

Christoph Hertrich, Yixin Tao, László A. Végh

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Correlation Gap of Matroids.

Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem.

Satoru Fujishige, Tomonari Kitahara, László A. Végh

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Tractable Fragments of the Maximum Nash Welfare Problem.

Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

On complete classes of valuated matroids.

Edin Husic, Georg Loho, Ben Smith, László A. Végh

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets.

Jugal Garg, Yixin Tao, László A. Végh

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

On finding exact solutions of linear programs in the oracle model.

Daniel Dadush, László A. Végh, Giacomo Zambelli

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 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

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

2021

Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword.

Noga Ron-Zewi, Ivona Bezáková, László A. Végh

Theory Comput., 2021

Circuit imbalance measures and linear programming.

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

CoRR, 2021

Approximating Nash social welfare under rado valuations.

Jugal Garg, Edin Husic, László A. Végh

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications.

Jugal Garg, Edin Husic, László A. Végh

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Directed Shortest Paths via Approximate Cost Balancing.

James B. Orlin, László A. Végh

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 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

Rescaling Algorithms for Linear Conic Feasibility.

Daniel Dadush, László A. Végh, Giacomo Zambelli

Math. Oper. Res., 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

Signed Tropical Convexity.

Georg Loho, László A. Végh

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 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

On Submodular Search and Machine Scheduling.

Robbert Fokkink, Thomas Lidbetter, László A. Végh

Math. Oper. Res., 2019

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands.

Jugal Garg, Edin Husic, László A. Végh

CoRR, 2019

A strongly polynomial algorithm for linear exchange markets.

Jugal Garg, László A. Végh

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Constant factor approximation for ATSP with two edge weights.

Ola Svensson, Jakub Tarnawski, László A. Végh

Math. Program., 2018

A constant-factor approximation algorithm for the asymmetric traveling salesman problem.

Ola Svensson, Jakub Tarnawski, László A. Végh

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Geometric Rescaling Algorithms for Submodular Function Minimization.

Daniel Dadush, László A. Végh, Giacomo Zambelli

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

A simpler and faster strongly polynomial algorithm for generalized flow maximization.

Neil Olver, László A. Végh

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Decomposable Submodular Function Minimization: Discrete and Continuous.

Alina Ene, Huy L. Nguyen, László A. Végh

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016

A Rational Convex Program for Linear Arrow-Debreu Markets.

Nikhil R. Devanur, Jugal Garg, László A. Végh

ACM Trans. Economics and Comput., 2016

Current Trends in Combinatorial Optimization (NII Shonan Meeting 2016-7).

Takuro Fukunaga, R. Ravi, László A. Végh

NII Shonan Meet. Rep., 2016

Rescaling Algorithms for Linear Programming - Part I: Conic feasibility.

Daniel Dadush, László A. Végh, Giacomo Zambelli

CoRR, 2016

Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract).

Ola Svensson, Jakub Tarnawski, László A. Végh

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

Rescaled Coordinate Descent Methods for Linear Programming.

Daniel Dadush, László A. Végh, Giacomo Zambelli

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

A 7/3-Approximation for Feedback Vertex Sets in Tournaments.

Matthias Mnich, Virginia Vassilevska Williams, László A. Végh

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Oriented Euler complexes and signed perfect matchings.

László A. Végh, Bernhard von Stengel

Math. Program., 2015

2014

A polynomial projection-type algorithm for linear programming.

László A. Végh, Giacomo Zambelli

Oper. Res. Lett., 2014

To Save Or Not To Save: The Fisher Game.

Ruta Mehta, Nithum Thain, László A. Végh, Adrian Vetta

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

A strongly polynomial algorithm for generalized flow maximization.

László A. Végh

Proceedings of the Symposium on Theory of Computing, 2014

Approximating Minimum Cost Connectivity Orientation and Augmentation.

Mohit Singh, László A. Végh

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Strongly polynomial algorithm for generalized flows.

László A. Végh

CoRR, 2013

Algorithms for multiplayer multicommodity flow problems.

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

Central Eur. J. Oper. Res., 2013

Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation.

Dániel Marx, László A. Végh

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs.

Joseph Cheriyan, László A. Végh

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

On Mimicking Networks Representing Minimum Terminal Cuts

Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh

CoRR, 2012

LP-Based Covering Games with Low Price of Anarchy.

Georgios Piliouras, Tomás Valla, László A. Végh

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives.

László A. Végh

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Concave Generalized Flows with Applications to Market Equilibria.

László A. Végh

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

The Cutting Plane Method Is Polynomial for Perfect Matchings.

Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

The constructive characterization of (<i>κ, ℓ</i>)-edge-connected digraphs.

Erika R. Kovács, László A. Végh

Comb., 2011

ILP based diverse path routing with node inclusion.

Zsolt Lakatos, Lajos Bajzik, Tamás Kárász, Kristóf Bérczi, Erika R. Kovács, László A. Végh

Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011

2010

Augmenting undirected node-connectivity by one.

László A. Végh

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Restricted <i>b</i>-Matchings in Degree-Bounded Graphs.

Kristóf Bérczi, László A. Végh

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2008

An algorithm to increase the node-connectivity of a digraph by one.

András Frank, László A. Végh

Discret. Optim., 2008

2007

Nonadaptive Selfish Routing with Online Demands.

Tobias Harks, László A. Végh

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2005

Primal-dual approach for directed vertex connectivity augmentation and generalizations.

László A. Végh, András A. Benczúr

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005