Végh, László

Dr László Végh  

Department

Position held

Assistant Professor in Management Science

 

Experience keywords:

combinatorial optimisation; game theory; mathematical programming; network optimisation

Research summary > [Click to expand]

Dr Végh is interested in fundamental questions in combinatorial optimisation related to connectivity, flows, matchings and matroids, and also applications to areas such as mathematical economics, algorithmic game theory and network design.

Sectors and industries to which research relates:

Telecommunications

Languages:

Hungarian [Spoken: Fluent, Written: Fluent]

Contact Points

LSE phone number:

+44 (0)20 7955 7591

LSE email:

l.vegh@lse.ac.uk

Publications

2016

Mnich, Matthias and Williams, Virginia Vassilevska and Végh, László A. (2016) A 7/3-approximation for feedback vertex sets in tournaments Leibniz International Proceedings in Informatics (57). 67:1-67:14. ISSN 1868-8969

Devanur, Nikhil R. and Garg, Jugal and Végh, László A. (2016) A rational convex program for linear Arrow-Debreu markets ACM Transactions on Economics and Computation, 5 (1). 6. ISSN 2167-8375

Végh, László A. (2016) A strongly polynomial algorithm for generalized flow maximization Mathematics of Operations Research, 42 (1). 179-211. ISSN 0364-765X

Dadush, Daniel and Végh, László A. and Zambelli, Giacomo (2016) Rescaled coordinate descent methods for linear programming In: Louveaux, Quentin and Skutella, Martin, (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 9682. Springer, Cham, Switzerland, 26-37. ISBN 9783319334608

Végh, László A. (2016) A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives SIAM Journal on Computing, 45 (5). 1729-1761. ISSN 0097-5397

2015

Marx, Dániel and Végh, László A. (2015) Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation ACM Transactions on Algorithms, 11 (4). 27. ISSN 1549-6325

Chandrasekaran, Karthekeyan and Végh, László A. and Vempala, Santosh S. (2015) The cutting plane method is polynomial for perfect matchings Mathematics of Operations Research, 41 (1). 23-48. ISSN 0364-765X

Végh, László A. and von Stengel, Bernhard (2015) Oriented Euler complexes and signed perfect matchings Mathematical Programming, 150 (1). 153-178. ISSN 0025-5610

2014

Végh, László A. and Zambelli, Giacomo (2014) A polynomial projection-type algorithm for linear programming Operations Research Letters, 42 (1). 91-96. ISSN 0167-6377

Cheriyan, Joseph and Végh, László A. (2014) Approximating minimum-cost $k$-node connected subgraphs via independence-free graphs SIAM Journal on Computing, 43 (4). 1342-1362. ISSN 0097-5397

Piliouras, Georgios and Valla, Tomáš and Végh, László A. (2014) LP-based covering games with low price of anarchy Theory of Computing Systems, 57 (1). 238-260. ISSN 1432-4350

Végh, László A. (2014) Concave generalized flows with applications to market equilibria Mathematics of Operations Research, 39 (2). 573-596. ISSN 0364-765X

Singh, Mohit and Végh, László A. (2014) Approximating minimum cost connectivity orientation and augmentation. In: SODA 2014 - ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 2014, Portland, Oregon

2013

Cheriyan, Joseph and Végh, László A. (2013) Approximating minimum-cost k-node connected subgraphs via independence-free graphs. In: FOCS 2013 - 54th Annual Symposium on Foundations of Computer Science, 27-29 October 2013, Berkeley, CA

Marx, Dániel and Végh, László A. (2013) Fixed-parameter algorithms for minimum cost edge-connectivity augmentation In: Fomin, Fedor V. and Freivalds, Rūsiņš and Kwiatkowska, Marta and Peleg, David, (eds.) Automata, Languages, and Programming: 40th International Colloquium, Icalp 2013, Riga, Latvia, July 8-12, 2013. Lecture notes in computer science, 1 (7965). Springer-Verlag, Berlin, 721-732. ISBN 9783642392054

Chandrasekaran, Karthekeyan and Végh, László A. and Vempala, Santosh (2013) The cutting plane method is polynomial for perfect matchings In: Proceedings of the IEEE 53rd Symposium on Foundations of Computer Science (Focs) 2012. IEEE Computer Society, 571-580.

Végh, László A. (2013) Concave generalized flows with applications to market equilibria In: Proceedings of the IEEE 53rd Symposium on Foundations of Computer Science (Focs) 2012. IEEE Computer Society, 150-159.

2012

Végh, László A. (2012) Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. In: STOC 2012 - 44th ACM Symposium on Theory of Computing, 19th-22nd May 2012, New York, USA

Piliouras, Georgios and Valla, Tomas and Végh, László A. (2012) LP-based Covering Games with Low Price of Anarchy. In: WINE 2012 - Workshop on Internet & Network Economics, December 2012, Liverpool

2011

Kovács, Erika Renáta and Végh, László (2011) The constructive characterization of (k,l)-edge-connected digraphs Combinatorica, 31 (2). 201-223. ISSN 0209-9683

Végh, László A. (2011) Augmenting undirected node-connectivity by one SIAM Journal on Discrete Mathematics, 25 (2). 695-718. ISSN 0895-4801

2010

Kovács, Erika Renáta and Vegh, László (2010) Constructive characterization theorems in combinatorial optimization Rims Kôkyûroku Bessatsu, B23. 147-169. ISSN 1881-6193

Végh, László A. (2010) Augmenting undirected node-connectivity by one. In: STOC 2010 - 42nd ACM Symposium on Theory of Computing, 6th-8th June 2010, Cambridge, USA

Bérczi, Kristóf and Végh, László A. (2010) Restricted b-matchings in degree-bounded graphs. In: The 14th Conference on Integer Programming & Combinatorial Optimization (IPCO XIV), 9th-11th June 2010, Lausanne, Switzerland

2008

Frank, András and Végh, László A. (2008) An algorithm to increase the node-connectivity of a digraph by one Discrete Optimization, 5 (4). 677-684. ISSN 1572-5286

Végh, László A. and Benczúr, András A. (2008) Primal-dual approach for directed vertex connectivity augmentation and generalizations ACM Transactions on Algorithms, 4 (2). 20:1-20:21. ISSN 1549-6325

2007

Harks, Tobias and Végh, László A. (2007) Nonadaptive selfish routing with online demands. In: Fourth Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN), 14th August 2007, Dalhousie University, Halifax, Canada

Expert Image

Personal website

Awards

Danny Lewin Best Student Paper Award, Symposium on Theory of Computing (2010)

LSE Research Online|

Collection of LSE research outputs

LSE Consulting|

Service providing unique access
to LSE's expertise

Create or update your
online profile
|

[access restricted to staff]

Research highlights|

Short articles about LSE research