Covering Orthogonal Polygons with Sliding k-Transmitters. - Salma Sadat Mahdavi; Saeed Seddighin; Mohammad Ghodsi (CCCG, 2014)

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract). - Rajesh Hemant Chitnis; Hossein Esfandiari; MohammadTaghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Saeed Seddighin (IPEC, 2014)

How effectively can we form opinions? - AmirMahdi Ahmadinejad; Sina Dehghani; MohammadTaghi Hajiaghayi; Hamid Mahini; Saeed Seddighin; Sadra Yazdanbod (WWW (Companion Volume), 2014)

Some bounds for the signed edge domination number of a graph. - Saieed Akbari; Hossein Esfandiari; E. Barzegary; Saeed Seddighin (Australas. J Comb., 2014)

Revenue Maximization for Selling Multiple Correlated Items. - MohammadHossein Bateni; Sina Dehghani; MohammadTaghi Hajiaghayi; Saeed Seddighin (ESA, 2015)

Forming external behaviors by leveraging internal opinions. - AmirMahdi Ahmadinejad; Sina Dehghani; MohammadTaghi Hajiaghayi; Hamid Mahini; Saeed Seddighin; Sadra Yazdanbod (INFOCOM, 2015)

Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. - Sina Dehghani; Soheil Ehsani; Mohammad Taghi Hajiaghayi; Vahid Liaghat; Harald Räcke; Saeed Seddighin (ICALP, 2016)

Price of Competition and Dueling Games. - Sina Dehghani; Mohammad Taghi Hajiaghayi; Hamid Mahini; Saeed Seddighin (ICALP, 2016)

From Duels to Battefields: Computing Equilibria of Blotto and Other Games. - Mahdi Ahmadinejad; Sina Dehghani; MohammadTaghi Hajiaghayi; Brendan Lucier; Hamid Mahini; Saeed Seddighin (CoRR, 2016)

A Study of Compact Reserve Pricing Languages. - MohammadHossein Bateni; Hossein Esfandiari; Vahab S. Mirrokni; Saeed Seddighin (AAAI, 2017)

Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. - Soheil Behnezhad; Sina Dehghani; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Saeed Seddighin (AAAI, 2017)

Stochastic k-Server: How Should Uber Work?. - Sina Dehghani; Soheil Ehsani; MohammadTaghi Hajiaghayi; Vahid Liaghat; Saeed Seddighin (ICALP, 2017)

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. - Rajesh Chitnis; Hossein Esfandiari; Mohammad Taghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Saeed Seddighin (Algorithmica, 2017)

Fair Allocation of Indivisible Goods: Improvement and Generalization. - Mohammad Ghodsi; Mohammad Taghi Hajiaghayi; Masoud Seddighin; Saeed Seddighin; Hadi Yami (CoRR, 2017)

Greedy Algorithms for Online Survivable Network Design. - Sina Dehghani; Soheil Ehsani; MohammadTaghi Hajiaghayi; Vahid Liaghat; Saeed Seddighin (ICALP, 2018)

Spatio-Temporal Games Beyond One Dimension. - Soheil Behnezhad; Mahsa Derakhshan; Mohammad Taghi Hajiaghayi; Saeed Seddighin (EC, 2018)

Fair Allocation of Indivisible Goods: Improvements and Generalizations. - Mohammad Ghodsi; Mohammad Taghi Hajiaghayi; Masoud Seddighin; Saeed Seddighin; Hadi Yami (EC, 2018)

Frugal Auction Design for Set Systems: Vertex Cover and Knapsack. - Mohammad Taghi Hajiaghayi; Mohammad Reza Khani; Saeed Seddighin (EC, 2018)

From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. - Soheil Behnezhad; Avrim Blum; Mahsa Derakhshan; Mohammad Taghi Hajiaghayi; Mohammad Mahdian; Christos H. Papadimitriou; Ronald L. Rivest; Saeed Seddighin; Philip B. Stark (SODA, 2018)

Fast algorithms for knapsack via convolution and prediction. - MohammadHossein Bateni; MohammadTaghi Hajiaghayi; Saeed Seddighin; Cliff Stein 001 (STOC, 2018)

Optimal Strategies of Blotto Games: Beyond Convexity. - Soheil Behnezhad; Avrim Blum; Mahsa Derakhshan; Mohammad Taghi Hajiaghayi; Christos H. Papadimitriou; Saeed Seddighin (EC, 2019)

Approximation Algorithms for LCS and LIS with Truly Improved Running Times. - Aviad Rubinstein; Saeed Seddighin; Zhao Song 002; Xiaorui Sun (FOCS, 2019)

Computing Stackelberg Equilibria of Large General-Sum Games. - Avrim Blum; Nika Haghtalab; MohammadTaghi Hajiaghayi; Saeed Seddighin (SAGT, 2019)

Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence. - MohammadTaghi Hajiaghayi; Saeed Seddighin; Xiaorui Sun (SODA, 2019)

Approximating LCS in Linear Time: Beating the √n Barrier. - MohammadTaghi Hajiaghayi; Masoud Seddighin; Saeed Seddighin; Xiaorui Sun (SODA, 2019)

Improved MPC Algorithms for Edit Distance and Ulam Distance. - Mahdi Boroujeni; Saeed Seddighin (SPAA, 2019)

1+ε approximation of tree edit distance in quadratic time. - Mahdi Boroujeni; Mohammad Ghodsi; MohammadTaghi Hajiaghayi; Saeed Seddighin (STOC, 2019)

MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond. - MohammadTaghi Hajiaghayi; Silvio Lattanzi; Saeed Seddighin; Cliff Stein 001 (CoRR, 2019)

Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems. - Mahdi Boroujeni; Sina Dehghani; Soheil Ehsani; Mohammad Taghi Hajiaghayi; Saeed Seddighin (CoRR, 2019)

Massively Parallel Algorithms for String Matching with Wildcards. - MohammadTaghi Hajiaghayi; Hamed Saleh; Saeed Seddighin; Xiaorui Sun (CoRR, 2019)

Fair Allocation of Indivisible Goods to Asymmetric Agents. - Alireza Farhadi 001; Mohammad Ghodsi; Mohammad Taghi Hajiaghayi; Sébastien Lahaie; David M. Pennock; Masoud Seddighin; Saeed Seddighin; Hadi Yami (J. Artif. Intell. Res., 2019)

From Duels to Battlefields: Computing Equilibria of Blotto and Other Games. - AmirMahdi Ahmadinejad; Sina Dehghani; MohammadTaghi Hajiaghayi; Brendan Lucier; Hamid Mahini; Saeed Seddighin (Math. Oper. Res., 2019)

Improved Algorithms for Edit Distance and LCS: Beyond Worst Case. - Mahdi Boroujeni; Masoud Seddighin; Saeed Seddighin (SODA, 2020)

Dynamic algorithms for LIS and distance to monotonicity. - Michael Mitzenmacher; Saeed Seddighin (STOC, 2020)

Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS. - Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Aviad Rubinstein; Saeed Seddighin (CoRR, 2020)

Erdös-Szekeres Partitioning Problem. - Michael Mitzenmacher; Saeed Seddighin (CoRR, 2020)

Covering orthogonal polygons with sliding k-transmitters. - Salma Sadat Mahdavi; Saeed Seddighin; Mohammad Ghodsi (Theor. Comput. Sci., 2020)

Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable. - Sina Dehghani; Hamed Saleh; Saeed Seddighin; Shang-Hua Teng (AAAI, 2021)

Learning Complexity of Simulated Annealing. - Avrim Blum; Chen Dan 001; Saeed Seddighin (AISTATS, 2021)

Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. - Kuan Cheng; Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Zhengzhong Jin; Xin Li 006; Aviad Rubinstein; Saeed Seddighin; Yu Zheng 014 (ICALP, 2021)

Improved Sublinear Time Algorithm for Longest Increasing Subsequence. - Michael Mitzenmacher; Saeed Seddighin (SODA, 2021)

String Matching with Wildcards in the Massively Parallel Computation Model. - MohammadTaghi Hajiaghayi; Hamed Saleh; Saeed Seddighin; Xiaorui Sun (SPAA, 2021)

Improved dynamic algorithms for longest increasing subsequence. - Tomasz Kociumaka; Saeed Seddighin (STOC, 2021)

Dynamic Longest Increasing Subsequence and the Erdös-Szekeres Partitioning Problem. - Michael Mitzenmacher; Saeed Seddighin (CoRR, 2021)

Optimal Space and Time for Streaming Pattern Matching. - Tung Mai; Anup B. Rao; Ryan A. Rossi; Saeed Seddighin (CoRR, 2021)

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. - Mahdi Boroujeni; Soheil Ehsani; Mohammad Ghodsi; MohammadTaghi Hajiaghayi; Saeed Seddighin (J. ACM, 2021)

Fair Allocation of Indivisible Goods: Improvement. - Mohammad Ghodsi; Mohammad Taghi Hajiaghayi; Masoud Seddighin; Saeed Seddighin; Hadi Yami (Math. Oper. Res., 2021)

Improved MPC Algorithms for Edit Distance and Ulam Distance. - Mahdi Boroujeni; Mohammad Ghodsi; Saeed Seddighin (IEEE Trans. Parallel Distributed Syst., 2021)

3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time. - Masoud Seddighin; Saeed Seddighin (ITCS, 2022)

Fair allocation of indivisible goods: Beyond additive valuations. - Mohammad Ghodsi; Mohammad Taghi Hajiaghayi; Masoud Seddighin; Saeed Seddighin; Hadi Yami (Artif. Intell., 2022)

Dynamic Subset Sum with Truly Sublinear Processing Time. - Hamed Saleh; Saeed Seddighin (CoRR, 2022)

On Complexity of 1-Center in Various Metrics. - Amir Abboud; MohammadHossein Bateni; Vincent Cohen-Addad; Karthik C. S. 001; Saeed Seddighin (APPROX/RANDOM, 2023)

Location-Sensitive String Problems in MPC. - Jacob Gilbert; MohammadTaghi Hajiaghayi; Hamed Saleh; Saeed Seddighin (SPAA, 2023)

Fast and Simple Solutions of Blotto Games. - Soheil Behnezhad; Sina Dehghani; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Saeed Seddighin (Oper. Res., 2023)

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. - François Le Gall; Saeed Seddighin (Algorithmica, 2023)

Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem. - Masoud Seddighin; Saeed Seddighin (Artif. Intell., 2024)