dblp.uni-trier.dewww.uni-trier.de

Jan Vondrák

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
18EEVahab S. Mirrokni, Michael Schapira, Jan Vondrák: Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. ACM Conference on Electronic Commerce 2008: 70-77
17EEJan Vondrák: Optimal approximation for the submodular welfare problem in the value oracle model. STOC 2008: 67-74
16EEBenny Sudakov, Jan Vondrák: How many random edges make a dense hypergraph non-2-colorable? Random Struct. Algorithms 32(3): 290-306 (2008)
2007
15EEUriel Feige, Vahab S. Mirrokni, Jan Vondrák: Maximizing Non-Monotone Submodular Functions. FOCS 2007: 461-471
14EEGruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). IPCO 2007: 182-196
13EEJan Vondrák: Shortest-path metric approximation for random subgraphs. Random Struct. Algorithms 30(1-2): 95-104 (2007)
2006
12EEUriel Feige, Jan Vondrák: Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. FOCS 2006: 667-676
11EEMichel X. Goemans, Jan Vondrák: Stochastic Covering and Adaptivity. LATIN 2006: 532-543
10EEJános Pach, Rados Radoicic, Jan Vondrák: Nearly equal distances and Szemerédi's regularity lemma. Comput. Geom. 34(1): 11-19 (2006)
9EEJános Pach, Rados Radoicic, Jan Vondrák: On the diameter of separated point sets with many nearly equal distances. Eur. J. Comb. 27(8): 1321-1332 (2006)
8EENoga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák: A Ramsey-type result for the hypercube. Journal of Graph Theory 53(3): 196-208 (2006)
7EEMichel X. Goemans, Jan Vondrák: Covering minimum spanning trees of random subgraphs. Random Struct. Algorithms 29(3): 257-276 (2006)
2005
6EEBrian C. Dean, Michel X. Goemans, Jan Vondrák: Adaptivity and approximation for stochastic packing problems. SODA 2005: 395-404
2004
5EEBrian C. Dean, Michel X. Goemans, Jan Vondrák: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. FOCS 2004: 208-217
4EEMichel X. Goemans, Jan Vondrák: Covering minimum spanning trees of random subgraphs. SODA 2004: 934-941
2003
3EEMartin Loebl, Jan Vondrák: Towards a theory of frustrated degeneracy. Discrete Mathematics 271(1-3): 179-193 (2003)
2001
2EERobert Sámal, Jan Vondrák: The limit checker number of a graph. Discrete Mathematics 235(1-3): 343-347 (2001)
1999
1EERobert Babilon, Helena Nyklová, Ondrej Pangrác, Jan Vondrák: Visibility Representations of Complete Graphs. Graph Drawing 1999: 333-340

Coauthor Index

1Noga Alon [8]
2Robert Babilon [1]
3Gruia Calinescu [14]
4Chandra Chekuri [14]
5Brian C. Dean [5] [6]
6Uriel Feige [12] [15]
7Michel X. Goemans [4] [5] [6] [7] [11]
8Martin Loebl [3]
9Vahab S. Mirrokni (Seyed Vahab Mirrokni) [15] [18]
10Helena Nyklová [1]
11János Pach [9] [10]
12Martin Pál (Martin Pal) [14]
13Ondrej Pangrác [1]
14Rados Radoicic [8] [9] [10]
15Robert Sámal [2]
16Michael Schapira [18]
17Benny Sudakov [8] [16]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)