Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLászló A. Végh
Person information
- affiliation: London School of Economics and Political Science, London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j27]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): 135-206 (2024)- 2023
- [j26]Jugal Garg, László A. Végh:
A Strongly Polynomial Algorithm for Linear Exchange Markets. Oper. Res. 71(2): 487-505 (2023) - [j25]James B. Orlin, László A. Végh:
Directed Shortest Paths via Approximate Cost Balancing. J. ACM 70(1): 3:1-3:33 (2023) - 2021
- [j24]Dan Dadush, László A. Végh, Giacomo Zambelli:
Geometric Rescaling Algorithms for Submodular Function Minimization. Math. Oper. Res. 46(3): 1081-1108 (2021) - [j23]Jugal Garg, Edin Husic, László A. Végh:
Approximating nash social welfare under rado valuations. SIGecom Exch. 19(1): 45-51 (2021) - [j22]Noga Ron-Zewi, Ivona Bezáková, László A. Végh:
Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. Theory Comput. 17: 1-4 (2021) - 2020
- [j21]Neil Olver, László A. Végh:
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. J. ACM 67(2): 10:1-10:26 (2020) - [j20]Ola Svensson, Jakub Tarnawski, László A. Végh:
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. J. ACM 67(6): 37:1-37:53 (2020) - [j19]Daniel Dadush, László A. Végh, Giacomo Zambelli:
Rescaling Algorithms for Linear Conic Feasibility. Math. Oper. Res. 45(2): 732-754 (2020) - 2019
- [j18]Robbert Fokkink, Thomas Lidbetter, László A. Végh:
On Submodular Search and Machine Scheduling. Math. Oper. Res. 44(4): 1431-1449 (2019) - 2018
- [j17]Ola Svensson, Jakub Tarnawski, László A. Végh:
Constant factor approximation for ATSP with two edge weights. Math. Program. 172(1-2): 371-397 (2018) - [j16]Mohit Singh, László A. Végh:
Approximating Minimum Cost Connectivity Orientation and Augmentation. SIAM J. Comput. 47(1): 270-293 (2018) - 2017
- [j15]László A. Végh:
A Strongly Polynomial Algorithm for Generalized Flow Maximization. Math. Oper. Res. 42(1): 179-211 (2017) - 2016
- [j14]Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala:
The Cutting Plane Method is Polynomial for Perfect Matchings. Math. Oper. Res. 41(1): 23-48 (2016) - [j13]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): 1729-1761 (2016) - [j12]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): 6:1-6:13 (2016) - 2015
- [j11]László A. Végh, Bernhard von Stengel:
Oriented Euler complexes and signed perfect matchings. Math. Program. 150(1): 153-178 (2015) - [j10]Georgios Piliouras, Tomás Valla, László A. Végh:
LP-Based Covering Games with Low Price of Anarchy. Theory Comput. Syst. 57(1): 238-260 (2015) - [j9]Dániel Marx, László A. Végh:
Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation. ACM Trans. Algorithms 11(4): 27:1-27:24 (2015) - 2014
- [j8]László A. Végh:
Concave Generalized Flows with Applications to Market Equilibria. Math. Oper. Res. 39(2): 573-596 (2014) - [j7]László A. Végh, Giacomo Zambelli:
A polynomial projection-type algorithm for linear programming. Oper. Res. Lett. 42(1): 91-96 (2014) - [j6]Joseph Cheriyan, László A. Végh:
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. SIAM J. Comput. 43(4): 1342-1362 (2014) - 2013
- [j5]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): 699-712 (2013) - 2011
- [j4]Erika R. Kovács, László A. Végh:
The constructive characterization of (κ, ℓ)-edge-connected digraphs. Comb. 31(2): 201-223 (2011) - [j3]László A. Végh:
Augmenting Undirected Node-Connectivity by One. SIAM J. Discret. Math. 25(2): 695-718 (2011) - 2008
- [j2]András Frank, László A. Végh:
An algorithm to increase the node-connectivity of a digraph by one. Discret. Optim. 5(4): 677-684 (2008) - [j1]László A. Végh, András A. Benczúr:
Primal-dual approach for directed vertex connectivity augmentation and generalizations. ACM Trans. Algorithms 4(2): 20:1-20:21 (2008)
Conference and Workshop Papers
- 2023
- [c39]Satoru Fujishige, Tomonari Kitahara, László A. Végh:
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem. IPCO 2023: 142-156 - [c38]Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh:
On the Correlation Gap of Matroids. IPCO 2023: 203-216 - [c37]Christoph Hertrich, Yixin Tao, László A. Végh:
Mode Connectivity in Auction Design. NeurIPS 2023 - [c36]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: 1298-1310 - 2022
- [c35]Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh:
Interior point methods are not worse than Simplex. FOCS 2022: 267-277 - [c34]Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh:
On Circuit Diameter Bounds via Circuit Imbalances. IPCO 2022: 140-153 - [c33]Edin Husic, Georg Loho, Ben Smith, László A. Végh:
On complete classes of valuated matroids. SODA 2022: 945-962 - [c32]Jugal Garg, Yixin Tao, László A. Végh:
Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. SODA 2022: 2269-2284 - [c31]Daniel Dadush, László A. Végh, Giacomo Zambelli:
On finding exact solutions of linear programs in the oracle model. SODA 2022: 2700-2722 - [c30]Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh:
Tractable Fragments of the Maximum Nash Welfare Problem. WINE 2022: 362-363 - 2021
- [c29]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: 36:1-36:15 - [c28]James B. Orlin, László A. Végh:
Directed Shortest Paths via Approximate Cost Balancing. SODA 2021: 235-254 - [c27]Jugal Garg, Edin Husic, László A. Végh:
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. STACS 2021: 33:1-33:19 - [c26]Jugal Garg, Edin Husic, László A. Végh:
Approximating Nash social welfare under rado valuations. STOC 2021: 1412-1425 - 2020
- [c25]Daniel Dadush, Bento Natura, László A. Végh:
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. FOCS 2020: 931-942 - [c24]Georg Loho, László A. Végh:
Signed Tropical Convexity. ITCS 2020: 24:1-24:35 - [c23]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: 761-774 - 2019
- [c22]Jugal Garg, László A. Végh:
A strongly polynomial algorithm for linear exchange markets. STOC 2019: 54-65 - 2018
- [c21]Daniel Dadush, László A. Végh, Giacomo Zambelli:
Geometric Rescaling Algorithms for Submodular Function Minimization. SODA 2018: 832-848 - [c20]Ola Svensson, Jakub Tarnawski, László A. Végh:
A constant-factor approximation algorithm for the asymmetric traveling salesman problem. STOC 2018: 204-213 - 2017
- [c19]Alina Ene, Huy L. Nguyen, László A. Végh:
Decomposable Submodular Function Minimization: Discrete and Continuous. NIPS 2017: 2870-2880 - [c18]Neil Olver, László A. Végh:
A simpler and faster strongly polynomial algorithm for generalized flow maximization. STOC 2017: 100-111 - 2016
- [c17]Matthias Mnich, Virginia Vassilevska Williams, László A. Végh:
A 7/3-Approximation for Feedback Vertex Sets in Tournaments. ESA 2016: 67:1-67:14 - [c16]Daniel Dadush, László A. Végh, Giacomo Zambelli:
Rescaled Coordinate Descent Methods for Linear Programming. IPCO 2016: 26-37 - [c15]Ola Svensson, Jakub Tarnawski, László A. Végh:
Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). IPCO 2016: 226-237 - 2014
- [c14]Mohit Singh, László A. Végh:
Approximating Minimum Cost Connectivity Orientation and Augmentation. SODA 2014: 1687-1701 - [c13]László A. Végh:
A strongly polynomial algorithm for generalized flow maximization. STOC 2014: 644-653 - [c12]Ruta Mehta, Nithum Thain, László A. Végh, Adrian Vetta:
To Save Or Not To Save: The Fisher Game. WINE 2014: 294-307 - 2013
- [c11]Joseph Cheriyan, László A. Végh:
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. FOCS 2013: 30-39 - [c10]Dániel Marx, László A. Végh:
Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation. ICALP (1) 2013: 721-732 - 2012
- [c9]László A. Végh:
Concave Generalized Flows with Applications to Market Equilibria. FOCS 2012: 150-159 - [c8]Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala:
The Cutting Plane Method Is Polynomial for Perfect Matchings. FOCS 2012: 571-580 - [c7]László A. Végh:
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. STOC 2012: 27-40 - [c6]Georgios Piliouras, Tomás Valla, László A. Végh:
LP-Based Covering Games with Low Price of Anarchy. WINE 2012: 184-197 - 2011
- [c5]Zsolt Lakatos, Lajos Bajzik, Tamás Kárász, Kristóf Bérczi, Erika R. Kovács, László A. Végh:
ILP based diverse path routing with node inclusion. ICUMT 2011: 1-8 - 2010
- [c4]Kristóf Bérczi, László A. Végh:
Restricted b-Matchings in Degree-Bounded Graphs. IPCO 2010: 43-56 - [c3]László A. Végh:
Augmenting undirected node-connectivity by one. STOC 2010: 563-572 - 2007
- [c2]Tobias Harks, László A. Végh:
Nonadaptive Selfish Routing with Online Demands. CAAN 2007: 27-45 - 2005
- [c1]László A. Végh, András A. Benczúr:
Primal-dual approach for directed vertex connectivity augmentation and generalizations. SODA 2005: 186-194
Editorship
- 2019
- [e1]Dimitris Achlioptas, László A. Végh:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. LIPIcs 145, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-125-2 [contents]
Informal and Other Publications
- 2024
- [i39]Jugal Garg, Yixin Tao, László A. Végh:
Approximating Competitive Equilibrium by Nash Welfare. CoRR abs/2402.09994 (2024) - 2023
- [i38]Christoph Hertrich, Yixin Tao, László A. Végh:
Mode Connectivity in Auction Design. CoRR abs/2305.11005 (2023) - [i37]Katharina Eickhoff, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh:
Faster Ascending Auctions via Polymatroid Sum. CoRR abs/2310.08454 (2023) - [i36]Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh:
A First Order Method for Linear Programming Parameterized by Circuit Imbalance. CoRR abs/2311.01959 (2023) - 2022
- [i35]Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh:
Interior point methods are not worse than Simplex. CoRR abs/2206.08810 (2022) - [i34]Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh:
On the Correlation Gap of Matroids. CoRR abs/2209.09896 (2022) - [i33]Jugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák:
Approximating Nash Social Welfare by Matching and Local Search. CoRR abs/2211.03883 (2022) - 2021
- [i32]Jugal Garg, Yixin Tao, László A. Végh:
Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. CoRR abs/2107.05700 (2021) - [i31]Edin Husic, Georg Loho, Ben Smith, László A. Végh:
On complete classes of valuated matroids. CoRR abs/2107.06961 (2021) - [i30]Farbod Ekbatani, Bento Natura, László A. Végh:
Circuit imbalance measures and linear programming. CoRR abs/2108.03616 (2021) - [i29]Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh:
On Circuit Diameter Bounds via Circuit Imbalances. CoRR abs/2111.07913 (2021) - [i28]Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh:
Tractable Fragments of the Maximum Nash Welfare Problem. CoRR abs/2112.10199 (2021) - 2020
- [i27]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 abs/2004.08634 (2020) - [i26]James B. Orlin, László A. Végh:
Directed Shortest Paths via Approximate Cost Balancing. CoRR abs/2007.07975 (2020) - [i25]Daniel Dadush, Bento Natura, László A. Végh:
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. CoRR abs/2009.04942 (2020) - [i24]Jugal Garg, Edin Husic, László A. Végh:
Approximating Nash Social Welfare under Rado Valuations. CoRR abs/2009.14793 (2020) - 2019
- [i23]Jugal Garg, Edin Husic, László A. Végh:
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands. CoRR abs/1908.07948 (2019) - [i22]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 abs/1912.06252 (2019) - 2018
- [i21]Jugal Garg, László A. Végh:
A Strongly Polynomial Algorithm for Linear Exchange Markets. CoRR abs/1809.06266 (2018) - 2017
- [i20]Alina Ene, Huy L. Nguyen, László A. Végh:
Decomposable Submodular Function Minimization: Discrete and Continuous. CoRR abs/1703.01830 (2017) - [i19]Daniel Dadush, László A. Végh, Giacomo Zambelli:
Geometric Rescaling Algorithms for Submodular Function Minimization. CoRR abs/1707.05065 (2017) - [i18]Ola Svensson, Jakub Tarnawski, László A. Végh:
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. CoRR abs/1708.04215 (2017) - 2016
- [i17]Neil Olver, László A. Végh:
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. CoRR abs/1611.01778 (2016) - [i16]Daniel Dadush, László A. Végh, Giacomo Zambelli:
Rescaling Algorithms for Linear Programming - Part I: Conic feasibility. CoRR abs/1611.06427 (2016) - [i15]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) - 2015
- [i14]Matthias Mnich, Virginia Vassilevska Williams, László A. Végh:
A 7/3-Approximation for Feedback Vertex Sets in Tournaments. CoRR abs/1511.01137 (2015) - [i13]Ola Svensson, Jakub Tarnawski, László A. Végh:
Constant Factor Approximation for ATSP with Two Edge Weights. CoRR abs/1511.07038 (2015) - 2013
- [i12]Dániel Marx, László A. Végh:
Fixed-parameter algorithms for minimum cost edge-connectivity augmentation. CoRR abs/1304.6593 (2013) - [i11]Mohit Singh, László A. Végh:
Approximating Minimum Cost Connectivity Orientation and Augmentation. CoRR abs/1307.4164 (2013) - [i10]László A. Végh, Giacomo Zambelli:
A polynomial projection-type algorithm for linear programming. CoRR abs/1307.4334 (2013) - [i9]László A. Végh:
Strongly polynomial algorithm for generalized flows. CoRR abs/1307.6809 (2013) - [i8]Nikhil R. Devanur, Jugal Garg, László A. Végh:
A Rational Convex Program for Linear Arrow-Debreu Markets. CoRR abs/1307.8037 (2013) - 2012
- [i7]Georgios Piliouras, Tomás Valla, László A. Végh:
LP-based Covering Games with Low Price of Anarchy. CoRR abs/1203.0050 (2012) - [i6]Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala:
The Cutting Plane Method is Polynomial for Perfect Matchings. CoRR abs/1207.5813 (2012) - [i5]Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh:
On Mimicking Networks Representing Minimum Terminal Cuts. CoRR abs/1207.6371 (2012) - [i4]László A. Végh, Bernhard von Stengel:
Oriented Euler Complexes and Signed Perfect Matchings. CoRR abs/1210.4694 (2012) - [i3]Joseph Cheriyan, László A. Végh:
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. CoRR abs/1212.3981 (2012) - 2011
- [i2]László A. Végh:
Concave Generalized Flows with Applications to Market Equilibria. CoRR abs/1109.3893 (2011) - [i1]László A. Végh:
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. CoRR abs/1110.4882 (2011)
Coauthor Index
Daniel Dadush
aka: Dan Dadush
aka: Dan Dadush
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
