Cookies?
Library Header Image
LSE Research Online LSE Library Services

"Vegh, Laszlo"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 21.

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

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

Végh , László A. and von Stengel, Bernhard (2014) Oriented Euler complexes and signed perfect matchings. Mathematical Programming, Online . ISSN 0025-5610 (In Press)

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.

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). pp. 1342-1362. ISSN 0097-5397

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

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. (In Press)

Marx, Dániel and Végh , László A. (2013) Fixed-parameter algorithms for minimum cost edge-connectivity augmentation. In: Fomin, Fedor V., Freivalds, Rūsiņš, 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, pp. 721-732. ISBN 9783642392054

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.

Chandrasekaran, Karthekeyan, 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: STOC 2012 - 44th ACM Symposium on Theory of Computing, 19th-22nd May 2012, New York, USA.

Piliouras, Georgios, 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.

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

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.

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). 20:1-20:21. ISSN 1549-6325

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.

Bérczi, Kristóf, Csikvári, Péter, Kovács, Erika Renáta and Végh, László A. Splitting property via shadow systems. In: 8th Japanese Hungarian Symposium on Discrete Mathematics and its Applications , 4-7 June 2013, Veszprem, Hungary .

This list was generated on Sat Dec 20 13:51:40 2014 GMT.