The following pages link to Jan Vondrák (Q185367):
Displaying 50 items.
- Is submodularity testable? (Q472463) (← links)
- A randomized embedding algorithm for trees (Q555509) (← links)
- On the diameter of separated point sets with many nearly equal distances (Q850083) (← links)
- Towards a theory of frustrated degeneracy. (Q1408874) (← links)
- Wide partitions, Latin tableaux, and Rota's basis conjecture (Q1415381) (← links)
- On variants of the matroid secretary problem (Q2017872) (← links)
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions (Q2290687) (← links)
- Nearly equal distances and Szemerédi's regularity lemma (Q2489544) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas (Q2816303) (← links)
- Symmetry and Approximability of Submodular Maximization Problems (Q2839179) (← links)
- Matroid Matching: The Power of Local Search (Q2839182) (← links)
- Matroid matching (Q2875164) (← links)
- (Q2921694) (← links)
- (Q2969615) (← links)
- Exchangeability and Realizability: De Finetti Theorems on Graphs (Q2969661) (← links)
- On Multiplicative Weight Updates for Concave and Submodular Function Maximization (Q2989031) (← links)
- (Q2999661) (← links)
- (Q3002824) (← links)
- Disjoint bases in a polymatroid (Q3055784) (← links)
- Maximizing Non-monotone Submodular Functions (Q3096096) (← links)
- (Q3153132) (← links)
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity (Q3169009) (← links)
- Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations (Q3177762) (← links)
- (Q3190915) (← links)
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint (Q3225171) (← links)
- Covering minimum spanning trees of random subgraphs (Q3419593) (← links)
- Shortest‐path metric approximation for random subgraphs (Q3419615) (← links)
- A Ramsey-type result for the hypercube (Q3419711) (← links)
- How many random edges make a dense hypergraph non-2-colorable? (Q3503605) (← links)
- Stochastic Covering and Adaptivity (Q3525789) (← links)
- (Q3549686) (← links)
- (Q3950020) (← links)
- (Q4501710) (← links)
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature (Q4595963) (← links)
- Sperner’s Colorings and Optimal Partitioning of the Simplex (Q4604392) (← links)
- Computing the Independence Polynomial: from the Tree Threshold down to the Roots (Q4607991) (← links)
- (Q4645666) (← links)
- An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
- When Are Welfare Guarantees Robust (Q5002625) (← links)
- Stability and Recovery for Independence Systems (Q5111712) (← links)
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes (Q5112585) (← links)
- In memoriam: Maryam Mirzakhani (Q5122994) (← links)
- Symmetry and Approximability of Submodular Maximization Problems (Q5171225) (← links)
- Multiway cut, pairwise realizable distributions, and descending thresholds (Q5259608) (← links)
- Sperner's Colorings, Hypergraph Labeling Problems and Fair Division (Q5363096) (← links)
- (Q5365101) (← links)
- (Q5365102) (← links)
- Fast algorithms for maximizing submodular functions (Q5384072) (← links)
- From query complexity to computational complexity (Q5415538) (← links)
