|
Search the dblp DataBase
Jan Vondrák:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Brian C. Dean, Michel X. Goemans, Jan Vondrák
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. [Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:208-217 [Conf]
- Uriel Feige, Jan Vondrák
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. [Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:667-676 [Conf]
- Robert Babilon, Helena Nyklová, Ondrej Pangrác, Jan Vondrák
Visibility Representations of Complete Graphs. [Citation Graph (0, 0)][DBLP] Graph Drawing, 1999, pp:333-340 [Conf]
- Michel X. Goemans, Jan Vondrák
Stochastic Covering and Adaptivity. [Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:532-543 [Conf]
- Brian C. Dean, Michel X. Goemans, Jan Vondrák
Adaptivity and approximation for stochastic packing problems. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:395-404 [Conf]
- Michel X. Goemans, Jan Vondrák
Covering minimum spanning trees of random subgraphs. [Citation Graph (0, 0)][DBLP] SODA, 2004, pp:934-941 [Conf]
- János Pach, Rados Radoicic, Jan Vondrák
Nearly equal distances and Szemerédi's regularity lemma. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:34, n:1, pp:11-19 [Journal]
- Martin Loebl, Jan Vondrák
Towards a theory of frustrated degeneracy. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:271, n:1-3, pp:179-193 [Journal]
- Robert Sámal, Jan Vondrák
The limit checker number of a graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:235, n:1-3, pp:343-347 [Journal]
- János Pach, Rados Radoicic, Jan Vondrák
On the diameter of separated point sets with many nearly equal distances. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2006, v:27, n:8, pp:1321-1332 [Journal]
- Michel X. Goemans, Jan Vondrák
Covering minimum spanning trees of random subgraphs. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2006, v:29, n:3, pp:257-276 [Journal]
- Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák
A Ramsey-type result for the hypercube. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:53, n:3, pp:196-208 [Journal]
- Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). [Citation Graph (0, 0)][DBLP] IPCO, 2007, pp:182-196 [Conf]
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. [Citation Graph (, )][DBLP]
Maximizing Non-Monotone Submodular Functions. [Citation Graph (, )][DBLP]
Symmetry and Approximability of Submodular Maximization Problems. [Citation Graph (, )][DBLP]
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. [Citation Graph (, )][DBLP]
Optimal approximation for the submodular welfare problem in the value oracle model. [Citation Graph (, )][DBLP]
Matroid matching: the power of local search. [Citation Graph (, )][DBLP]
Randomized Pipage Rounding for Matroid Polytopes and Applications [Citation Graph (, )][DBLP]
K-User Fading Interference Channels: The Ergodic Very Strong Case [Citation Graph (, )][DBLP]
A note on concentration of submodular functions [Citation Graph (, )][DBLP]
Submodular Maximization by Simulated Annealing [Citation Graph (, )][DBLP]
Is submodularity testable? [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs
|