The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Vondrák: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. Michel X. Goemans, Jan Vondrák
    Stochastic Covering and Adaptivity. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:532-543 [Conf]
  5. 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]
  6. Michel X. Goemans, Jan Vondrák
    Covering minimum spanning trees of random subgraphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:934-941 [Conf]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]

  14. Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. [Citation Graph (, )][DBLP]


  15. Maximizing Non-Monotone Submodular Functions. [Citation Graph (, )][DBLP]


  16. Symmetry and Approximability of Submodular Maximization Problems. [Citation Graph (, )][DBLP]


  17. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. [Citation Graph (, )][DBLP]


  18. Optimal approximation for the submodular welfare problem in the value oracle model. [Citation Graph (, )][DBLP]


  19. Matroid matching: the power of local search. [Citation Graph (, )][DBLP]


  20. Randomized Pipage Rounding for Matroid Polytopes and Applications [Citation Graph (, )][DBLP]


  21. K-User Fading Interference Channels: The Ergodic Very Strong Case [Citation Graph (, )][DBLP]


  22. A note on concentration of submodular functions [Citation Graph (, )][DBLP]


  23. Submodular Maximization by Simulated Annealing [Citation Graph (, )][DBLP]


  24. Is submodularity testable? [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002