The following pages link to Saeed Seddighin (Q524377):
Displaying 29 items.
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- Computing Stackelberg equilibria of large general-sum games (Q2292620) (← links)
- Covering orthogonal polygons with sliding \(k\)-transmitters (Q2310756) (← links)
- Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- (Q2875482) (← links)
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← links)
- Revenue Maximization for Selling Multiple Correlated Items (Q3452771) (← links)
- Price of Competition and Dueling Games (Q4598154) (← links)
- Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering (Q4598180) (← links)
- (Q4607964) (← links)
- (Q4608043) (← links)
- Fair Allocation of Indivisible Goods to Asymmetric Agents (Q4611397) (← links)
- Fair Allocation of Indivisible Goods: Improvement (Q4958554) (← links)
- (Q5002841) (← links)
- Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce (Q5056409) (← links)
- From Duels to Battlefields: Computing Equilibria of Blotto and Other Games (Q5108243) (← links)
- (Q5111458) (← links)
- Dynamic algorithms for LIS and distance to monotonicity (Q5144953) (← links)
- Improved Algorithms for Edit Distance and LCS: Beyond Worst Case (Q5146877) (← links)
- 1+ <i>ε</i> approximation of tree edit distance in quadratic time (Q5212811) (← links)
- Fast algorithms for knapsack via convolution and prediction (Q5230380) (← links)
- Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (Q5236256) (← links)
- Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence (Q5236284) (← links)
- (Q6126342) (← links)
- (Q6126361) (← links)
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem (Q6152666) (← links)
- Fast and Simple Solutions of Blotto Games (Q6192834) (← links)
- On complexity of 1-center in various metrics (Q6663010) (← links)
