Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "László A. Végh" ( http://dblp.L3S.de/Authors/László_A._Végh )

  Author page on DBLP  Author page in RDF  Community of László A. Végh in ASPL-2

Publication years (Num. hits)
2005-2012 (13)
Publication types (Num. hits)
article(7) inproceedings(6)
Venues (Conferences, Journals, ...)
CoRR(3) STOC(2) ACM Transactions on Algorithms(1) CAAN(1) Combinatorica(1) Discrete Optimization(1) ICUMT(1) IPCO(1) SIAM J. Discrete Math.(1) SODA(1)
Authors
László A. Végh(13) András A. Benczúr(2) Erika R. Kovács(2) Kristóf Bérczi(2) András Frank(1) Georgios Piliouras(1) L. Bajzik(1) T. Karasz(1) Tobias Harks(1) Tomás Valla(1) Zs. Lakatos(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1 occurrences of 1 keywords
Results
Found 13 publication records. Showing 13 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Georgios Piliouras, Tomás Valla, László A. Végh LP-based Covering Games with Low Price of Anarchy Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1László A. Végh Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. Search on Bibsonomy STOC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Erika R. Kovács, László A. Végh The constructive characterization of (κ, ℓ)-edge-connected digraphs. Search on Bibsonomy Combinatorica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1László A. Végh Concave Generalized Flows with Applications to Market Equilibria Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1László A. Végh Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1László A. Végh Augmenting Undirected Node-Connectivity by One. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zs. Lakatos, L. Bajzik, T. Karasz, Kristóf Bérczi, Erika R. Kovács, László A. Végh ILP based diverse path routing with node inclusion. Search on Bibsonomy ICUMT The full citation details ... 2011 DBLP  BibTeX  RDF
1Kristóf Bérczi, László A. Végh Restricted b-Matchings in Degree-Bounded Graphs. Search on Bibsonomy IPCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1László A. Végh Augmenting undirected node-connectivity by one. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1András Frank, László A. Végh An algorithm to increase the node-connectivity of a digraph by one. Search on Bibsonomy Discrete Optimization The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1László A. Végh, András A. Benczúr Primal-dual approach for directed vertex connectivity augmentation and generalizations. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Vertex connectivity augmentation, combinatorial algorithm
1Tobias Harks, László A. Végh Nonadaptive Selfish Routing with Online Demands. Search on Bibsonomy CAAN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1László A. Végh, András A. Benczúr Primal-dual approach for directed vertex connectivity augmentation and generalizations. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #13 of 13 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.