László A. Végh
I am broadly interested in fundamental questions in algorithms and optimisation: exact and approximation algorithms for problems related to network design, flows, matchings, and equilibrium computation, with a particular focus on strongly polynomial computability.
I completed my PhD in mathematics at the Eötvös University in Budapest in 2010, under the supervision of András Frank, working in the Egerváry Research Group on Combinatorial Optimization. In 2011-12, I was a postdoctoral fellow at the Georgia Institute of Technology, in the School of Computer Science. I joined the Operations Research Group at LSE in 2012.
|1 Dec 2017||I will give a mini-course on strongly polynomial algorithms and generalized flows at the Hausdorff School on Combinatorial Optimization in Bonn between 20-24 August 2018.|
|24 Aug 2017||My research will be funded by an ERC Starting Grant for 5 years. I am looking for PhD students and postdocs. See more details on the project webpage, and email me if you are interested.|
|16 Aug 2017||I am in the Simons Institute in Berkeley for two months participating the semester program Bridging Continuous and Discrete Optimization.|
|14 Aug 2017||Our paper with Ola Svensson and Jakub Tarnawski giving a constant factor approximation algorithm for ATSP is posted on arXiv.|
|1 Aug 2017||Promotion to Associate Professor.|
Phone: +44 (0) 20 7955 7591
Office: COL 2.02