Végh, László
Dr László Végh
|
|
|
|
|
Experience keywords:
network optimisation; game theory; combinatorial optimisation; mathematical programming
|
|
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]
|
|
|
|
|
|
|
|
The following references are sourced from LSE Research Online|. References that are linked lead to the full text.
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, pp. 150-159. 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, pp. 571-580. Végh, László A. (2012) Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. In:. Végh, László A. (2011) Augmenting undirected node-connectivity by one. SIAM journal on discrete mathematics, 25 (2). pp. 695-718. ISSN 0895-4801 Kovács, Erika Renáta and Végh, László (2011) The constructive characterization of (k,l)-edge-connected digraphs. Combinatorica, 31 (2). pp. 201-223. ISSN 0209-9683 Kovács , Erika Renáta and Vegh, László (2010) Constructive characterization theorems in combinatorial optimization. RIMS Kôkyûroku Bessatsu, B23 pp. 147-169. ISSN 1881-6193 Bérczi, Kristóf and Végh, László A. (2010) Restricted b-matchings in degree-bounded graphs. In:. Végh , László A. (2010) Augmenting undirected node-connectivity by one. In:. 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). pp. 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). pp. 1-20. ISSN 1549-6325 Harks, Tobias and Végh, László A. (2007) Nonadaptive selfish routing with online demands. In:.
LSE Research Online is the primary resource for references to publications. For queries or updates please email the LSE Research Online team at lseresearchonline@lse.ac.uk|.
|
|
|
|
|
|
|
|
|
|
AwardsDanny Lewin Best Student Paper Award, Symposium on Theory of Computing (2010)
|
|
|
|
|
|
|
|
|
Browse the Experts Directory:
|
Collection of LSE research outputs
Service providing unique access
to LSE's expertise
[access restricted to staff]
Short articles about LSE research
|