Nonadaptive Selfish Routing with Online Demands. - Tobias Harks; László A. Végh (CAAN, 2007)

An algorithm to increase the node-connectivity of a digraph by one. - András Frank; László A. Végh (Discret. Optim., 2008)

Primal-dual approach for directed vertex connectivity augmentation and generalizations. - László A. Végh; András A. Benczúr (ACM Trans. Algorithms, 2008)

Restricted b-Matchings in Degree-Bounded Graphs. - Kristóf Bérczi; László A. Végh (IPCO, 2010)

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 (ICUMT, 2011)

The constructive characterization of (κ, ℓ)-edge-connected digraphs. - Erika R. Kovács; László A. Végh (Comb., 2011)

Augmenting Undirected Node-Connectivity by One. - László A. Végh (SIAM J. Discret. Math., 2011)

On Mimicking Networks Representing Minimum Terminal Cuts - Arindam Khan 001; Prasad Raghavendra; Prasad Tetali; László A. Végh (CoRR, 2012)

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)

Strongly polynomial algorithm for generalized flows. - László A. Végh (CoRR, 2013)

To Save Or Not To Save: The Fisher Game. - Ruta Mehta; Nithum Thain; László A. Végh; Adrian Vetta (WINE, 2014)

Concave Generalized Flows with Applications to Market Equilibria. - László A. Végh (Math. Oper. Res., 2014)

A polynomial projection-type algorithm for linear programming. - László A. Végh; Giacomo Zambelli (Oper. Res. Lett., 2014)

Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. - Joseph Cheriyan; László A. Végh (SIAM J. Comput., 2014)

Oriented Euler complexes and signed perfect matchings. - László A. Végh; Bernhard von Stengel (Math. Program., 2015)

LP-Based Covering Games with Low Price of Anarchy. - Georgios Piliouras; Tomás Valla; László A. Végh (Theory Comput. Syst., 2015)

Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation. - Dániel Marx; László A. Végh (ACM Trans. Algorithms, 2015)

A 7/3-Approximation for Feedback Vertex Sets in Tournaments. - Matthias Mnich; Virginia Vassilevska Williams; László A. Végh (ESA, 2016)

Rescaled Coordinate Descent Methods for Linear Programming. - Daniel Dadush; László A. Végh; Giacomo Zambelli (IPCO, 2016)

Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). - Ola Svensson; Jakub Tarnawski; László A. Végh (IPCO, 2016)

Rescaling Algorithms for Linear Programming - Part I: Conic feasibility. - Daniel Dadush; László A. Végh; Giacomo Zambelli (CoRR, 2016)

The Cutting Plane Method is Polynomial for Perfect Matchings. - Karthekeyan Chandrasekaran; László A. Végh; Santosh S. Vempala (Math. Oper. Res., 2016)

Current Trends in Combinatorial Optimization (NII Shonan Meeting 2016-7). - Takuro Fukunaga; R. Ravi 001; László A. Végh (NII Shonan Meet. Rep., 2016)

A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives. - László A. Végh (SIAM J. Comput., 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)

Decomposable Submodular Function Minimization: Discrete and Continuous. - Alina Ene; Huy L. Nguyen; László A. Végh (NIPS, 2017)

A Strongly Polynomial Algorithm for Generalized Flow Maximization. - László A. Végh (Math. Oper. Res., 2017)

Constant factor approximation for ATSP with two edge weights. - Ola Svensson; Jakub Tarnawski; László A. Végh (Math. Program., 2018)

Approximating Minimum Cost Connectivity Orientation and Augmentation. - Mohit Singh; László A. Végh (SIAM J. Comput., 2018)

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands. - Jugal Garg; Edin Husic; László A. Végh (CoRR, 2019)

On Submodular Search and Machine Scheduling. - Robbert Fokkink; Thomas Lidbetter; László A. Végh (Math. Oper. Res., 2019)

Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. - Daniel Dadush; Bento Natura; László A. Végh (FOCS, 2020)

Signed Tropical Convexity. - Georg Loho; László A. Végh (ITCS, 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 Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. - Neil Olver; László A. Végh (J. ACM, 2020)

A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. - Ola Svensson; Jakub Tarnawski; László A. Végh (J. ACM, 2020)

Rescaling Algorithms for Linear Conic Feasibility. - Daniel Dadush; László A. Végh; Giacomo Zambelli (Math. Oper. Res., 2020)

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. - Jugal Garg; Edin Husic; László A. Végh (STACS, 2021)

Circuit imbalance measures and linear programming. - Farbod Ekbatani; Bento Natura; László A. Végh (CoRR, 2021)

Geometric Rescaling Algorithms for Submodular Function Minimization. - Dan Dadush; László A. Végh; Giacomo Zambelli (Math. Oper. Res., 2021)

Approximating nash social welfare under rado valuations. - Jugal Garg; Edin Husic; László A. Végh (SIGecom Exch., 2021)

Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. - Noga Ron-Zewi; Ivona Bezáková; László A. Végh (Adv. Math. Commun., 2021)

Interior point methods are not worse than Simplex. - Xavier Allamigeon; Daniel Dadush; Georg Loho; Bento Natura; László A. Végh (FOCS, 2022)

On finding exact solutions of linear programs in the oracle model. - Daniel Dadush; László A. Végh; Giacomo Zambelli (SODA, 2022)

Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. - Jugal Garg; Yixin Tao; László A. Végh (SODA, 2022)

Tractable Fragments of the Maximum Nash Welfare Problem. - Jugal Garg; Edin Husic; Aniket Murhekar; László A. Végh (WINE, 2022)

Mode Connectivity in Auction Design. - Christoph Hertrich; Yixin Tao; László A. Végh (NeurIPS, 2023)

Approximating Nash Social Welfare by Matching and Local Search. - Jugal Garg; Edin Husic; Wenzheng Li; László A. Végh; Jan Vondrák (STOC, 2023)

Faster Ascending Auctions via Polymatroid Sum. - Katharina Eickhoff; Britta Peis; Niklas Rieken; Laura Vargas Koch; László A. Végh (CoRR, 2023)

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

Directed Shortest Paths via Approximate Cost Balancing. - James B. Orlin; László A. Végh (J. ACM, 2023)

A Strongly Polynomial Algorithm for Linear Exchange Markets. - Jugal Garg; László A. Végh (Oper. Res., 2023)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance. - Richard Cole 001; Christoph Hertrich; Yixin Tao; László A. Végh (IPCO, 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 (STOC, 2024)

On complete classes of valuated matroids. - Edin Husic; Georg Loho; Ben Smith; László A. Végh (TheoretiCS, 2024)

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 (Math. Program., 2024)

On circuit diameter bounds via circuit imbalances. - Daniel Dadush; Zhuan Khye Koh; Bento Natura; László A. Végh (Math. Program., 2024)

An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding. - Sharat Ibrahimpur; László A. Végh (IPCO, 2025)

Approximating Competitive Equilibrium by Nash Welfare. - Jugal Garg; Yixin Tao; László A. Végh (SODA, 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 (STACS, 2025)

An update-and-stabilize framework for the minimum-norm-point problem. - Satoru Fujishige; Tomonari Kitahara; László A. Végh (Math. Program., 2025)

On the correlation gap of matroids. - Edin Husic; Zhuan Khye Koh; Georg Loho; László A. Végh (Math. Program., 2025)

Tight Efficiency Bounds for the Probabilistic Serial Mechanism under Cardinal Preferences. - Jugal Garg; Yixin Tao; László A. Végh (CoRR, 2025)

Matroids are Equitable. - Hannaneh Akrami; Roshan Raj; László A. Végh (CoRR, 2025)

IFORS' Operational Research Hall of Fame: Ailsa Land. - Jonathan Rosenhead; László A. Végh (Int. Trans. Oper. Res., 2025)