The following pages link to Vahab S. Mirrokni (Q547288):
Displaying 50 items.
- (Q401304) (redirect page) (← links)
- (Q1567285) (redirect page) (← links)
- On non-progressive spread of influence through social networks (Q401306) (← links)
- Convergence and approximation in potential games (Q441854) (← links)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- Approximating minimum-power degree and connectivity problems (Q547290) (← links)
- Permutation betting markets: singleton betting with extra information (Q547299) (← links)
- Competitive routing over time (Q719282) (← links)
- Secure overlay network design (Q848639) (← links)
- Power optimization for connectivity problems (Q877193) (← links)
- Subjective-cost policy routing (Q883998) (← links)
- The myth of the folk theorem (Q993783) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- On the simultaneous edge-coloring conjecture (Q1567288) (← links)
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges (Q1850550) (← links)
- Two-stage robust network design with exponential scenarios (Q1939662) (← links)
- Equilibrium pricing with positive externalities (Q1945927) (← links)
- PASS approximation: a framework for analyzing and designing heuristics (Q1950388) (← links)
- Distributed balanced partitioning via linear embedding (Q2005567) (← links)
- Clinching auctions with online supply (Q2206820) (← links)
- On spectrum sharing games (Q2377140) (← links)
- Traffic engineering of management flows by link augmentations on confluent trees (Q2471695) (← links)
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Design and analysis of bipartite experiments under a linear exposure-response model (Q2681751) (← links)
- Polyhedral Clinching Auctions and the AdWords Polytope (Q2796405) (← links)
- Tight Approximation Algorithms for Maximum Separable Assignment Problems (Q2884281) (← links)
- On the Non-progressive Spread of Influence through Social Networks (Q2894476) (← links)
- Advantage of Overlapping Clusters for Minimizing Conductance (Q2894491) (← links)
- (Q2921718) (← links)
- Concise Bid Optimization Strategies with Multiple Budget Constraints (Q2936992) (← links)
- Bicriteria Online Matching: Maximizing Weight and Cardinality (Q2937766) (← links)
- Randomized Composable Core-sets for Distributed Submodular Maximization (Q2941499) (← links)
- Online Submodular Welfare Maximization (Q2941586) (← links)
- Robust Hierarchical k-Center Clustering (Q2989032) (← links)
- Uncoordinated Two-Sided Matching Markets (Q2999856) (← links)
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints (Q3058545) (← links)
- Local Computation of PageRank Contributions (Q3078596) (← links)
- Maximizing Non-monotone Submodular Functions (Q3096096) (← links)
- Online Stochastic Weighted Matching: Improved Approximation Algorithms (Q3102585) (← links)
- Length-constrained path-matchings in graphs (Q3150130) (← links)
- Two-Stage Robust Network Design with Exponential Scenarios (Q3541119) (← links)
- (Q3549720) (← links)
- A Unified Approach to Congestion Games and Two-Sided Markets (Q3574305) (← links)
- Tight approximation algorithms for maximum general assignment problems (Q3581502) (← links)
- Online Stochastic Packing Applied to Display Ad Allocation (Q3586461) (← links)
- Power Optimization for Connectivity Problems (Q3596355) (← links)
- On the Stability of Web Crawling and Web Search (Q3596761) (← links)
- PASS Approximation (Q3638872) (← links)
- The facility location problem with general cost functions (Q4422623) (← links)
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
