LV

László A. Végh

0000-0003-1152-200X

cs.DSmath.OCcs.GTcs.DMmath.COcs.LGCircuit Imbalancescs.MAcs.NEecon.TH

On Valency

published · living versions

Newton Steps are Faster for Linear Complementarity Problems

with Haoyuan Ma, Adrian Vladu

1 version

W_gnvqqe9nv1 · current

Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time

W_hq93zgsfv1

Preprints & journals

49 papers in the corpus · 2011–2026

Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time

Daniel Dadush, Zhuan Khye Koh, Bento Natura et al.

0 citations

2610.26073v12026arXiv

On finding exact solutions of linear programs in the oracle model

Daniel Dadush, L'aszl'o A. V'egh, Giacomo Zambelli

0 citations

2606.11820v12026arXiv

Handicap reduction for linear complementarity problems

Marianna E.-Nagy, L'aszl'o A. V'egh

0 citations

2605.10701v22026arXiv

From Incremental Transitive Cover to Strongly Polynomial Maximum Flow

Daniel Dadush, James B. Orlin, Aaron Sidford et al.

0 citations

2510.20368v12025arXiv

A first order method for linear programming parameterized by circuit imbalance.

Cole, Richard, Hertrich, Christoph, Tao, Yixin et al.

1 citation

420646212026Mathematical programming. 2026;216(1-2):339-377

Matroids are Equitable

Hannaneh Akrami, Siyue Liu, Roshan Raj et al.

0 citations

2507.12100v22025arXiv

Tight Efficiency Bounds for the Probabilistic Serial and Related Mechanisms

Jugal Garg, Yixin Tao, L'aszl'o A. V'egh

0 citations

2507.03359v22025arXiv

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

Sharat Ibrahimpur, L'aszl'o A. V'egh

1 citation

2501.12549v22025arXiv

On the correlation gap of matroids.

Husić, Edin, Koh, Zhuan Khye, Loho, Georg et al.

0 citations

400266052025Mathematical programming. 2025;210(1-2):407-456

Approximating Competitive Equilibrium by Nash Welfare

Jugal Garg, Yixin Tao, L'aszl'o A. V'egh

2 citations

2402.09994v32024arXiv

A First Order Method for Linear Programming Parameterized by Circuit Imbalance

Richard Cole, Christoph Hertrich, Yixin Tao et al.

2 citations

2311.01959v22023arXiv

Faster Dynamic Auctions via Polymatroid Sum

Katharina Eickhoff, Meike Neuwohner, Britta Peis et al.

2 citations

2310.08454v32023arXiv

Mode Connectivity in Auction Design

Christoph Hertrich, Yixin Tao, L'aszl'o A. V'egh

3 citations

2305.11005v22023arXiv

Approximating Nash Social Welfare by Matching and Local Search

Jugal Garg, Edin Husi'c, Wenzheng Li et al.

9 citations

2211.03883v52022arXiv

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

Satoru Fujishige, Tomonari Kitahara, L'aszl'o A. V'egh

3 citations

2211.02560v22022arXiv

Interior point methods are not worse than Simplex

Xavier Allamigeon, Daniel Dadush, Georg Loho et al.

8 citations

2206.08810v42022arXiv

Tractable Fragments of the Maximum Nash Welfare Problem

Jugal Garg, Edin Husi'c, Aniket Murhekar et al.

9 citations

2112.10199v22021arXiv

On Circuit Diameter Bounds via Circuit Imbalances

Daniel Dadush, Zhuan Khye Koh, Bento Natura et al.

4 citations

2111.07913v42021arXiv

Circuit imbalance measures and linear programming

Farbod Ekbatani, Bento Natura, L'aszl'o A. V'egh

1 citation

2108.03616v22021arXiv

On complete classes of valuated matroids

Edin Husi'c, Georg Loho, Ben Smith et al.

1 citation

2107.06961v42021TheoretiCS, Volume 3 (November 18, 2024) theoretics:10755

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

Jugal Garg, Yixin Tao, L'aszl'o A. V'egh

5 citations

2107.05700v12021arXiv

Approximating Nash Social Welfare under Rado Valuations

Jugal Garg, Edin Husic, Laszlo A. Vegh

28 citations

2009.14793v12020arXiv

Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers

Daniel Dadush, Bento Natura, L'aszl'o A. V'egh

18 citations

2009.04942v12020arXiv

Directed Shortest Paths via Approximate Cost Balancing

James B. Orlin, L'aszl'o A. V'egh

3 citations

2007.07975v32020arXiv

An Accelerated Newton-Dinkelbach Method and its Application to Two Variables Per Inequality Systems

Daniel Dadush, Zhuan Khye Koh, Bento Natura et al.

3 citations

2004.08634v42020arXiv

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Daniel Dadush, Sophie Huiberts, Bento Natura et al.

16 citations

1912.06252v42019arXiv

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands

Jugal Garg, Edin Husi'c, L'aszl'o A. V'egh

5 citations

1908.07948v42019arXiv

Signed tropical convexity

Georg Loho, L'aszl'o A. V'egh

1 citation

1906.06686v22019arXiv

A Strongly Polynomial Algorithm for Linear Exchange Markets

Jugal Garg, L'aszl'o A. V'egh

25 citations

1809.06266v32018arXiv

A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

Ola Svensson, Jakub Tarnawski, L'aszl'o A. V'egh

45 citations

1708.04215v42017arXiv

Geometric Rescaling Algorithms for Submodular Function Minimization

Daniel Dadush, L'aszl'o A. V'egh, Giacomo Zambelli

13 citations

1707.05065v42017arXiv

Decomposable Submodular Function Minimization: Discrete and Continuous

Alina Ene, Huy L. Nguyen, L'aszl'o A. V'egh

17 citations

1703.01830v12017arXiv

Rescaling Algorithms for Linear Conic Feasibility

Daniel Dadush, L'aszl'o A. V'egh, Giacomo Zambelli

16 citations

1611.06427v52016arXiv

A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization

Neil Olver, L'aszl'o A. V'egh

26 citations

1611.01778v32016arXiv

On Submodular Search and Machine Scheduling

Robbert Fokkink, Thomas Lidbetter, L'aszl'o A. V'egh

18 citations

1607.07598v42016arXiv

Constant Factor Approximation for ATSP with Two Edge Weights

Ola Svensson, Jakub Tarnawski, L'aszl'o A. V'egh

1 citation

1511.07038v22015Proc. of Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, pages 226-237

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

Matthias Mnich, Virginia Vassilevska Williams, L'aszl'o A. V'egh

17 citations

1511.01137v12015arXiv

A Rational Convex Program for Linear Arrow-Debreu Markets

Nikhil R. Devanur, Jugal Garg, L'aszl'o A. V'egh

40 citations

1307.8037v22013arXiv

A strongly polynomial algorithm for generalized flow maximization

L'aszl'o A. V'egh

40 citations

1307.6809v42013arXiv

Approximating Minimum Cost Connectivity Orientation and Augmentation

Mohit Singh, L'aszl'o A. V'egh

0 citations

1307.4164v22013arXiv

A polynomial projection-type algorithm for linear programming

L'aszl'o A. V'egh, Giacomo Zambelli

1 citation

1307.4334v32013arXiv

Fixed-parameter algorithms for minimum cost edge-connectivity augmentation

D'aniel Marx, L'aszl'o A. V'egh

21 citations

1304.6593v22013arXiv

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

Joseph Cheriyan, Laszlo A. Vegh

21 citations

1212.3981v12012arXiv

Oriented Euler Complexes and Signed Perfect Matchings

L'aszl'o A. V'egh, Bernhard von Stengel

9 citations

1210.4694v22012Mathematical Programming Series B 150:1, 153-178 (2014)

On Mimicking Networks Representing Minimum Terminal Cuts

Arindam Khan, Prasad Raghavendra, Prasad Tetali et al.

30 citations

1207.6371v12012arXiv

The Cutting Plane Method is Polynomial for Perfect Matchings

Karthekeyan Chandrasekaran, Laszlo A. Vegh, Santosh Vempala

16 citations

1207.5813v32012arXiv

LP-based Covering Games with Low Price of Anarchy

Georgios Piliouras, Tomas Valla, Laszlo A. Vegh

4 citations

1203.0050v12012arXiv

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

Laszlo A. Vegh

36 citations

1110.4882v52011arXiv

Concave Generalized Flows with Applications to Market Equilibria

Laszlo A. Vegh

24 citations

1109.3893v32011arXiv

Career total: 122 works. 49 are in this corpus.

Profile built from the corpus for this byline.

122

works

811

citations

18

h-index

Corpus papers per year

Author records are still filling in while the Hub is in beta. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.