Jan Vondrák Vis

*	2009
22	EE	Jon Lee, Maxim Sviridenko, Jan Vondrák: Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. APPROX-RANDOM 2009: 244-257
21	EE	Chandra Chekuri, Jan Vondrák: Randomized Pipage Rounding for Matroid Polytopes and Applications CoRR abs/0909.4348: (2009)
20	EE	Lalitha Sankar, Jan Vondrák, H. Vincent Poor: K-User Fading Interference Channels: The Ergodic Very Strong Case CoRR abs/0910.4874: (2009)
	2008
19	EE	Vahab 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
18	EE	Jan Vondrák: Optimal approximation for the submodular welfare problem in the value oracle model. STOC 2008: 67-74
17	EE	Brian C. Dean, Michel X. Goemans, Jan Vondrák: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. Math. Oper. Res. 33(4): 945-964 (2008)
16	EE	Benny Sudakov, Jan Vondrák: How many random edges make a dense hypergraph non-2-colorable? Random Struct. Algorithms 32(3): 290-306 (2008)
	2007
15	EE	Uriel Feige, Vahab S. Mirrokni, Jan Vondrák: Maximizing Non-Monotone Submodular Functions. FOCS 2007: 461-471
14	EE	Gruia 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
13	EE	Jan Vondrák: Shortest-path metric approximation for random subgraphs. Random Struct. Algorithms 30(1-2): 95-104 (2007)
	2006
12	EE	Uriel Feige, Jan Vondrák: Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. FOCS 2006: 667-676
11	EE	Michel X. Goemans, Jan Vondrák: Stochastic Covering and Adaptivity. LATIN 2006: 532-543
10	EE	János Pach, Rados Radoicic, Jan Vondrák: Nearly equal distances and Szemerédi's regularity lemma. Comput. Geom. 34(1): 11-19 (2006)
9	EE	Já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)
8	EE	Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák: A Ramsey-type result for the hypercube. Journal of Graph Theory 53(3): 196-208 (2006)
7	EE	Michel X. Goemans, Jan Vondrák: Covering minimum spanning trees of random subgraphs. Random Struct. Algorithms 29(3): 257-276 (2006)
	2005
6	EE	Brian C. Dean, Michel X. Goemans, Jan Vondrák: Adaptivity and approximation for stochastic packing problems. SODA 2005: 395-404
	2004
5	EE	Brian C. Dean, Michel X. Goemans, Jan Vondrák: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. FOCS 2004: 208-217
4	EE	Michel X. Goemans, Jan Vondrák: Covering minimum spanning trees of random subgraphs. SODA 2004: 934-941
	2003
3	EE	Martin Loebl, Jan Vondrák: Towards a theory of frustrated degeneracy. Discrete Mathematics 271(1-3): 179-193 (2003)
	2001
2	EE	Robert Sámal, Jan Vondrák: The limit checker number of a graph. Discrete Mathematics 235(1-3): 343-347 (2001)
	1999
1	EE	Robert Babilon, Helena Nyklová, Ondrej Pangrác, Jan Vondrák: Visibility Representations of Complete Graphs. Graph Drawing 1999: 333-340

Coauthor Index

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

Colors in the list of coauthors