Laszlo A. Vegh

Identifiers

• name variant Laszlo A. Vegh 0.60 · backfill

Papers (5)

1. Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs cs.DM · 2012 · author #2
2. The Cutting Plane Method is Polynomial for Perfect Matchings cs.DS · 2012 · author #2
3. LP-based Covering Games with Low Price of Anarchy cs.GT · 2012 · author #3
4. Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives cs.DS · 2011 · author #1
5. Concave Generalized Flows with Applications to Market Equilibria cs.DS · 2011 · author #1

Mentions

• 1212.3981 #2 · backfill · confidence 0.70 Laszlo A. Vegh
• 1207.5813 #2 · backfill · confidence 0.70 Laszlo A. Vegh
• 1203.0050 #3 · backfill · confidence 0.70 Laszlo A. Vegh
• 1110.4882 #1 · backfill · confidence 0.70 Laszlo A. Vegh
• 1109.3893 #1 · backfill · confidence 0.70 Laszlo A. Vegh

Frequent Coauthors

• Georgios Piliouras 1 shared papers
• Joseph Cheriyan 1 shared papers
• Karthekeyan Chandrasekaran 1 shared papers
• Santosh Vempala 1 shared papers
• Tomas Valla 1 shared papers