László A. Végh

128 papers A* 26A 5B 8Journal 81Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximating competitive equilibrium by Nash welfare. Games Econ. Behav. Jugal Garg, Yixin Tao, László A. Végh
2026	A*	`conf`	From Incremental Transitive Cover to Strongly Polynomial Maximum Flow. SODA Daniel Dadush, James B. Orlin, Aaron Sidford, László A. Végh
2026	A*	`conf`	Matroids are Equitable. SODA Hannaneh Akrami, Roshan Raj, László A. Végh
2026	J	`jnl`	Mode Connectivity in Auction Design. Math. Oper. Res. Christoph Hertrich, Yixin Tao, László A. Végh
2025	A	`conf`	A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk). STACS Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
2025	B	`conf`	An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding. IPCO Sharat Ibrahimpur, László A. Végh
2025	J	`jnl`	An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding. CoRR Sharat Ibrahimpur, László A. Végh
2025	J	`jnl`	An update-and-stabilize framework for the minimum-norm-point problem. Math. Program. Satoru Fujishige, Tomonari Kitahara, László A. Végh
2025	A*	`conf`	Approximating Competitive Equilibrium by Nash Welfare. SODA Jugal Garg, Yixin Tao, László A. Végh
2025	J	`jnl`	Faster Dynamic Auctions via Polymatroid Sum. ACM Trans. Economics and Comput. Katharina Eickhoff, Meike Neuwohner, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh
2025	J	`jnl`	From Incremental Transitive Cover to Strongly Polynomial Maximum Flow. CoRR Daniel Dadush, James B. Orlin, Aaron Sidford, László A. Végh
2025	J	`jnl`	IFORS' Operational Research Hall of Fame: Ailsa Land. Int. Trans. Oper. Res. Jonathan Rosenhead, László A. Végh
2025	J	`jnl`	Interior Point Methods Are Not Worse than Simplex. SIAM J. Comput. Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh
2025	J	`jnl`	Matroids are Equitable. CoRR Hannaneh Akrami, Roshan Raj, László A. Végh
2025	J	`jnl`	On the correlation gap of matroids. Math. Program. Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh
2025	J	`jnl`	Tight Efficiency Bounds for the Probabilistic Serial Mechanism under Cardinal Preferences. CoRR Jugal Garg, Yixin Tao, László A. Végh
2024	B	`conf`	A First Order Method for Linear Programming Parameterized by Circuit Imbalance. IPCO Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh
2024	A*	`conf`	A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. STOC Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
2024	J	`jnl`	A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Math. Program. Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2024	J	`jnl`	Approximating Competitive Equilibrium by Nash Welfare. CoRR Jugal Garg, Yixin Tao, László A. Végh
2024	J	`jnl`	On circuit diameter bounds via circuit imbalances. Math. Program. Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2024	J	`jnl`	On complete classes of valuated matroids. TheoretiCS Edin Husic, Georg Loho, Ben Smith, László A. Végh
2023	J	`jnl`	A First Order Method for Linear Programming Parameterized by Circuit Imbalance. CoRR Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh
2023	J	`jnl`	A Strongly Polynomial Algorithm for Linear Exchange Markets. Oper. Res. Jugal Garg, László A. Végh
2023	J	`jnl`	An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. Math. Oper. Res. Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2023	J	`jnl`	An Auction Algorithm for Market Equilibrium with Weak Gross Substitute Demands. ACM Trans. Economics and Comput. Jugal Garg, Edin Husic, László A. Végh
2023	B	`conf`	An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem. IPCO Satoru Fujishige, Tomonari Kitahara, László A. Végh
2023	A*	`conf`	Approximating Nash Social Welfare by Matching and Local Search. STOC Jugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák
2023	J	`jnl`	Directed Shortest Paths via Approximate Cost Balancing. J. ACM James B. Orlin, László A. Végh
2023	J	`jnl`	Faster Ascending Auctions via Polymatroid Sum. CoRR Katharina Eickhoff, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh
2023	A*	`conf`	Mode Connectivity in Auction Design. NeurIPS Christoph Hertrich, Yixin Tao, László A. Végh
2023	J	`jnl`	Mode Connectivity in Auction Design. CoRR Christoph Hertrich, Yixin Tao, László A. Végh
2023	B	`conf`	On the Correlation Gap of Matroids. IPCO Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh
2022	A*	`conf`	Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. SODA Jugal Garg, Yixin Tao, László A. Végh
2022	J	`jnl`	Approximating Nash Social Welfare by Matching and Local Search. CoRR Jugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák
2022	A*	`conf`	Interior point methods are not worse than Simplex. FOCS Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh
2022	J	`jnl`	Interior point methods are not worse than Simplex. CoRR Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh
2022	B	`conf`	On Circuit Diameter Bounds via Circuit Imbalances. IPCO Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2022	A*	`conf`	On complete classes of valuated matroids. SODA Edin Husic, Georg Loho, Ben Smith, László A. Végh
2022	A*	`conf`	On finding exact solutions of linear programs in the oracle model. SODA Daniel Dadush, László A. Végh, Giacomo Zambelli
2022	J	`jnl`	On the Correlation Gap of Matroids. CoRR Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh
2022	—	`conf`	Tractable Fragments of the Maximum Nash Welfare Problem. WINE Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh
2021	A	`conf`	An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. ESA Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2021	J	`jnl`	Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets. CoRR Jugal Garg, Yixin Tao, László A. Végh
2021	A*	`conf`	Approximating Nash social welfare under rado valuations. STOC Jugal Garg, Edin Husic, László A. Végh
2021	J	`jnl`	Approximating nash social welfare under rado valuations. SIGecom Exch. Jugal Garg, Edin Husic, László A. Végh
2021	A	`conf`	Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. STACS Jugal Garg, Edin Husic, László A. Végh
2021	J	`jnl`	Circuit imbalance measures and linear programming. CoRR Farbod Ekbatani, Bento Natura, László A. Végh
2021	A*	`conf`	Directed Shortest Paths via Approximate Cost Balancing. SODA James B. Orlin, László A. Végh
2021	J	`jnl`	Geometric Rescaling Algorithms for Submodular Function Minimization. Math. Oper. Res. Dan Dadush, László A. Végh, Giacomo Zambelli
2021	J	`jnl`	On Circuit Diameter Bounds via Circuit Imbalances. CoRR Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2021	J	`jnl`	On complete classes of valuated matroids. CoRR Edin Husic, Georg Loho, Ben Smith, László A. Végh
2021	J	`jnl`	Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. Theory Comput. Noga Ron-Zewi, Ivona Bezáková, László A. Végh
2021	J	`jnl`	Tractable Fragments of the Maximum Nash Welfare Problem. CoRR Jugal Garg, Edin Husic, Aniket Murhekar, László A. Végh
2020	J	`jnl`	A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. J. ACM Ola Svensson, Jakub Tarnawski, László A. Végh
2020	J	`jnl`	A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. J. ACM Neil Olver, László A. Végh
2020	J	`jnl`	A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality. CoRR Zhuan Khye Koh, Bento Natura, László A. Végh
2020	A*	`conf`	A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. STOC Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2020	J	`jnl`	Approximating Nash Social Welfare under Rado Valuations. CoRR Jugal Garg, Edin Husic, László A. Végh
2020	J	`jnl`	Directed Shortest Paths via Approximate Cost Balancing. CoRR James B. Orlin, László A. Végh
2020	J	`jnl`	Rescaling Algorithms for Linear Conic Feasibility. Math. Oper. Res. Daniel Dadush, László A. Végh, Giacomo Zambelli
2020	A*	`conf`	Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. FOCS Daniel Dadush, Bento Natura, László A. Végh
2020	J	`jnl`	Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers. CoRR Daniel Dadush, Bento Natura, László A. Végh
2020	A	`conf`	Signed Tropical Convexity. ITCS Georg Loho, László A. Végh
2019	J	`jnl`	A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. CoRR Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2019	A*	`conf`	A strongly polynomial algorithm for linear exchange markets. STOC Jugal Garg, László A. Végh
2019	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20-22, 2019 APPROX-RANDOM Dimitris Achlioptas, László A. Végh
2019	J	`jnl`	Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands. CoRR Jugal Garg, Edin Husic, László A. Végh
2019	J	`jnl`	On Submodular Search and Machine Scheduling. Math. Oper. Res. Robbert Fokkink, Thomas Lidbetter, László A. Végh
2018	J	`jnl`	A Strongly Polynomial Algorithm for Linear Exchange Markets. CoRR Jugal Garg, László A. Végh
2018	A*	`conf`	A constant-factor approximation algorithm for the asymmetric traveling salesman problem. STOC Ola Svensson, Jakub Tarnawski, László A. Végh
2018	J	`jnl`	Approximating Minimum Cost Connectivity Orientation and Augmentation. SIAM J. Comput. Mohit Singh, László A. Végh
2018	J	`jnl`	Constant factor approximation for ATSP with two edge weights. Math. Program. Ola Svensson, Jakub Tarnawski, László A. Végh
2018	A*	`conf`	Geometric Rescaling Algorithms for Submodular Function Minimization. SODA Daniel Dadush, László A. Végh, Giacomo Zambelli
2017	J	`jnl`	A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. CoRR Ola Svensson, Jakub Tarnawski, László A. Végh
2017	J	`jnl`	A Strongly Polynomial Algorithm for Generalized Flow Maximization. Math. Oper. Res. László A. Végh
2017	A*	`conf`	A simpler and faster strongly polynomial algorithm for generalized flow maximization. STOC Neil Olver, László A. Végh
2017	—	`conf`	Decomposable Submodular Function Minimization: Discrete and Continuous. NIPS Alina Ene, Huy L. Nguyen, László A. Végh
2017	J	`jnl`	Decomposable Submodular Function Minimization: Discrete and Continuous. CoRR Alina Ene, Huy L. Nguyen, László A. Végh
2017	J	`jnl`	Geometric Rescaling Algorithms for Submodular Function Minimization. CoRR Daniel Dadush, László A. Végh, Giacomo Zambelli
2016	A	`conf`	A 7/3-Approximation for Feedback Vertex Sets in Tournaments. ESA Matthias Mnich, Virginia Vassilevska Williams, László A. Végh
2016	J	`jnl`	A Rational Convex Program for Linear Arrow-Debreu Markets. ACM Trans. Economics and Comput. Nikhil R. Devanur, Jugal Garg, László A. Végh
2016	J	`jnl`	A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. CoRR Neil Olver, László A. Végh
2016	J	`jnl`	A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives. SIAM J. Comput. László A. Végh
2016	B	`conf`	Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). IPCO Ola Svensson, Jakub Tarnawski, László A. Végh
2016	J	`jnl`	Current Trends in Combinatorial Optimization (NII Shonan Meeting 2016-7). NII Shonan Meet. Rep. Takuro Fukunaga, R. Ravi, László A. Végh
2016	B	`conf`	Rescaled Coordinate Descent Methods for Linear Programming. IPCO Daniel Dadush, László A. Végh, Giacomo Zambelli
2016	J	`jnl`	Rescaling Algorithms for Linear Programming - Part I: Conic feasibility. CoRR Daniel Dadush, László A. Végh, Giacomo Zambelli
2016	J	`jnl`	The Cutting Plane Method is Polynomial for Perfect Matchings. Math. Oper. Res. Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
2015	J	`jnl`	A 7/3-Approximation for Feedback Vertex Sets in Tournaments. CoRR Matthias Mnich, Virginia Vassilevska Williams, László A. Végh
2015	J	`jnl`	Constant Factor Approximation for ATSP with Two Edge Weights. CoRR Ola Svensson, Jakub Tarnawski, László A. Végh
2015	J	`jnl`	Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation. ACM Trans. Algorithms Dániel Marx, László A. Végh
2015	J	`jnl`	LP-Based Covering Games with Low Price of Anarchy. Theory Comput. Syst. Georgios Piliouras, Tomás Valla, László A. Végh
2015	J	`jnl`	Oriented Euler complexes and signed perfect matchings. Math. Program. László A. Végh, Bernhard von Stengel
2014	J	`jnl`	A polynomial projection-type algorithm for linear programming. Oper. Res. Lett. László A. Végh, Giacomo Zambelli
2014	A*	`conf`	A strongly polynomial algorithm for generalized flow maximization. STOC László A. Végh
2014	A*	`conf`	Approximating Minimum Cost Connectivity Orientation and Augmentation. SODA Mohit Singh, László A. Végh
2014	J	`jnl`	Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. SIAM J. Comput. Joseph Cheriyan, László A. Végh
2014	J	`jnl`	Concave Generalized Flows with Applications to Market Equilibria. Math. Oper. Res. László A. Végh
2014	—	`conf`	To Save Or Not To Save: The Fisher Game. WINE Ruta Mehta, Nithum Thain, László A. Végh, Adrian Vetta
2013	J	`jnl`	A Rational Convex Program for Linear Arrow-Debreu Markets. CoRR Nikhil R. Devanur, Jugal Garg, László A. Végh
2013	J	`jnl`	A polynomial projection-type algorithm for linear programming. CoRR László A. Végh, Giacomo Zambelli
2013	J	`jnl`	Algorithms for multiplayer multicommodity flow problems. Central Eur. J. Oper. Res. 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
2013	J	`jnl`	Approximating Minimum Cost Connectivity Orientation and Augmentation. CoRR Mohit Singh, László A. Végh
2013	A*	`conf`	Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. FOCS Joseph Cheriyan, László A. Végh
2013	—	`conf`	Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation. ICALP (1) Dániel Marx, László A. Végh
2013	J	`jnl`	Fixed-parameter algorithms for minimum cost edge-connectivity augmentation CoRR Dániel Marx, László A. Végh
2013	J	`jnl`	Strongly polynomial algorithm for generalized flows. CoRR László A. Végh
2012	J	`jnl`	Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs CoRR Joseph Cheriyan, László A. Végh
2012	A*	`conf`	Concave Generalized Flows with Applications to Market Equilibria. FOCS László A. Végh
2012	—	`conf`	LP-Based Covering Games with Low Price of Anarchy. WINE Georgios Piliouras, Tomás Valla, László A. Végh
2012	J	`jnl`	LP-based Covering Games with Low Price of Anarchy CoRR Georgios Piliouras, Tomás Valla, László A. Végh
2012	J	`jnl`	On Mimicking Networks Representing Minimum Terminal Cuts CoRR Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh
2012	J	`jnl`	Oriented Euler Complexes and Signed Perfect Matchings CoRR László A. Végh, Bernhard von Stengel
2012	A*	`conf`	Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. STOC László A. Végh
2012	A*	`conf`	The Cutting Plane Method Is Polynomial for Perfect Matchings. FOCS Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
2012	J	`jnl`	The Cutting Plane Method is Polynomial for Perfect Matchings CoRR Karthekeyan Chandrasekaran, László A. Végh, Santosh S. Vempala
2011	J	`jnl`	Augmenting Undirected Node-Connectivity by One. SIAM J. Discret. Math. László A. Végh
2011	J	`jnl`	Concave Generalized Flows with Applications to Market Equilibria CoRR László A. Végh
2011	—	`conf`	ILP based diverse path routing with node inclusion. ICUMT Zsolt Lakatos, Lajos Bajzik, Tamás Kárász, Kristóf Bérczi, Erika R. Kovács, László A. Végh
2011	J	`jnl`	Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives CoRR László A. Végh
2011	J	`jnl`	The constructive characterization of ( Comb. Erika R. Kovács, László A. Végh
2010	A*	`conf`	Augmenting undirected node-connectivity by one. STOC László A. Végh
2010	B	`conf`	Restricted IPCO Kristóf Bérczi, László A. Végh
2008	J	`jnl`	An algorithm to increase the node-connectivity of a digraph by one. Discret. Optim. András Frank, László A. Végh
2008	J	`jnl`	Primal-dual approach for directed vertex connectivity augmentation and generalizations. ACM Trans. Algorithms László A. Végh, András A. Benczúr
2007	—	`conf`	Nonadaptive Selfish Routing with Online Demands. CAAN Tobias Harks, László A. Végh
2005	A*	`conf`	Primal-dual approach for directed vertex connectivity augmentation and generalizations. SODA László A. Végh, András A. Benczúr