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