László A. Végh
László A. Végh
Verified email at lse.ac.uk - Homepage
Title
Cited by
Cited by
Year
A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
LA Végh
SIAM Journal on Computing 45 (5), 1729-1761, 2016
662016
Augmenting undirected node-connectivity by one
LA Végh
SIAM Journal on Discrete Mathematics 25 (2), 695-718, 2011
452011
A constant-factor approximation algorithm for the asymmetric traveling salesman problem
O Svensson, J Tarnawski, LA Végh
Journal of the ACM (JACM) 67 (6), 1-53, 2020
382020
Concave generalized flows with applications to market equilibria
LA Végh
Mathematics of Operations Research 39 (2), 573-596, 2014
312014
A strongly polynomial algorithm for generalized flow maximization
LA Végh
Mathematics of Operations Research 42 (1), 179-211, 2017
282017
Approximating Minimum-Cost -Node Connected Subgraphs via Independence-Free Graphs
J Cheriyan, LA Végh
SIAM Journal on Computing 43 (4), 1342-1362, 2014
282014
Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation
D Marx, LA Végh
ACM Transactions on Algorithms (TALG) 11 (4), 1-24, 2015
252015
A rational convex program for linear Arrow-Debreu markets
NR Devanur, J Garg, LA Végh
ACM Transactions on Economics and Computation (TEAC) 5 (1), 1-13, 2016
232016
On mimicking networks representing minimum terminal cuts
A Khan, P Raghavendra
Information Processing Letters 114 (7), 365-371, 2014
232014
Primal-dual approach for directed vertex connectivity augmentation and generalizations
LA Végh, AA Benczúr
ACM Transactions on Algorithms (TALG) 4 (2), 20, 2008
212008
A 7/3-approximation for feedback vertex sets in tournaments
M Mnich, VV Williams, LA Végh
arXiv preprint arXiv:1511.01137, 2015
192015
Nonadaptive selfish routing with online demands
T Harks, LA Végh
Workshop on Combinatorial and Algorithmic Aspects of Networking, 27-45, 2007
192007
The cutting plane method is polynomial for perfect matchings
K Chandrasekaran, LA Végh, SS Vempala
Mathematics of Operations Research 41 (1), 23-48, 2016
172016
Restricted b-Matchings in Degree-Bounded Graphs
K Bérczi, LA Végh
International Conference on Integer Programming and Combinatorial …, 2010
172010
On submodular search and machine scheduling
R Fokkink, T Lidbetter, LA Végh
Mathematics of Operations Research 44 (4), 1431-1449, 2019
162019
A simpler and faster strongly polynomial algorithm for generalized flow maximization
N Olver, LA Végh
Journal of the ACM (JACM) 67 (2), 1-26, 2020
152020
Decomposable submodular function minimization: discrete and continuous
A Ene, HL Nguyen, LA Végh
arXiv preprint arXiv:1703.01830, 2017
142017
A strongly polynomial algorithm for linear exchange markets
J Garg, LA Végh
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
132019
An algorithm to increase the node-connectivity of a digraph by one
A Frank, LA Végh
Discrete Optimization 5 (4), 677-684, 2008
112008
A polynomial projection-type algorithm for linear programming
LA Végh, G Zambelli
Operations Research Letters 42 (1), 91-96, 2014
102014
The system can't perform the operation now. Try again later.
Articles 1–20