| 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 | 108 | 2020 |
| Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives LA Végh Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 104 | 2012 |
| Augmenting undirected node-connectivity by one LA Végh Proceedings of the forty-second ACM symposium on Theory of computing, 563-572, 2010 | 56 | 2010 |
| A strongly polynomial algorithm for generalized flow maximization LA Végh Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 47 | 2014 |
| 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 | 46 | 2019 |
| 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 | 40 | 2016 |
| Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation D Marx, LA Végh ACM Transactions on Algorithms (TALG) 11 (4), 1-24, 2015 | 38 | 2015 |
| On mimicking networks representing minimum terminal cuts A Khan, P Raghavendra Information Processing Letters 114 (7), 365-371, 2014 | 38 | 2014 |
| Concave generalized flows with applications to market equilibria LA Végh Mathematics of Operations Research 39 (2), 573-596, 2014 | 38 | 2014 |
| Approximating Nash social welfare under Rado valuations J Garg, E Husić, LA Végh Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 37 | 2021 |
| A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix D Dadush, S Huiberts, B Natura, LA Végh Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 35 | 2020 |
| 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 | 35 | 2020 |
| Approximating Minimum-Cost -Node Connected Subgraphs via Independence-Free Graphs J Cheriyan, LA Végh SIAM Journal on Computing 43 (4), 1342-1362, 2014 | 35 | 2014 |
| Decomposable submodular function minimization: discrete and continuous A Ene, H Nguyen, LA Végh Advances in neural information processing systems 30, 2017 | 32 | 2017 |
| A 7/3-approximation for feedback vertex sets in tournaments M Mnich, VV Williams, LA Végh arXiv preprint arXiv:1511.01137, 2015 | 29 | 2015 |
| Geometric rescaling algorithms for submodular function minimization D Dadush, LA Végh, G Zambelli Mathematics of Operations Research 46 (3), 1081-1108, 2021 | 28 | 2021 |
| Restricted b-Matchings in Degree-Bounded Graphs K Bérczi, LA Végh International Conference on Integer Programming and Combinatorial …, 2010 | 28 | 2010 |
| 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 | 28 | 2008 |
| Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers D Dadush, B Natura, LA Végh 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 26 | 2020 |
| On submodular search and machine scheduling R Fokkink, T Lidbetter, LA Végh Mathematics of Operations Research 44 (4), 1431-1449, 2019 | 25 | 2019 |
Daniel DadushCentrum Wiskunde & Informaticacwi.nl의 이메일 확인됨
