default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasoud Seddighin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Masoud Seddighin, Saeed Seddighin:
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem. Artif. Intell. 327: 104049 (2024)- [c18]Amirreza Bagheridelouee, Marzie Nilipour, Masoud Seddighin, Maziar Shamsipour:
Metric Distortion Under Public-Spirited Voting. AAMAS 2024: 2144-2146 - [i12]Alireza Kaviani
, Masoud Seddighin, AmirMohammad Shahrezaei:
Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations. CoRR abs/2407.05139 (2024) - [i11]Negar Babashah, Hasti Karimi, Masoud Seddighin, Golnoosh Shahkarami:
Distortion of Multi-Winner Elections on the Line Metric: The Polar Comparison Rule. CoRR abs/2411.13720 (2024) - 2023
- [c17]Shayan Chashm Jahan, Masoud Seddighin, Seyed Mohammad Seyed Javadi, Mohammad Sharifi:
Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap. IJCAI 2023: 2572-2580 - [c16]Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin, Golnoosh Shahkarami:
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. NeurIPS 2023 - [i10]Hannaneh Akrami, Masoud Seddighin, Kurt Mehlhorn, Golnoosh Shahkarami:
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. CoRR abs/2308.14545 (2023) - 2022
- [j7]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair allocation of indivisible goods: Beyond additive valuations. Artif. Intell. 303: 103633 (2022) - [j6]MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeedreza Seddighin, Xiaorui Sun:
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier. SIAM J. Comput. 51(4): 1341-1367 (2022) - [c15]Masoud Seddighin, Saeed Seddighin:
Improved Maximin Guarantees for Subadditive and Fractionally Subadditive Fair Allocation Problem. AAAI 2022: 5183-5190 - [c14]Hannaneh Akrami, Rojin Rezvan, Masoud Seddighin:
An EF2X Allocation Protocol for Restricted Additive Valuations. IJCAI 2022: 17-23 - [c13]Masoud Seddighin, Saeed Seddighin:
3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time. ITCS 2022: 115:1-115:22 - [i9]Hannaneh Akrami, Rojin Rezvan, Masoud Seddighin:
An EF2X Allocation Protocol for Restricted Additive Valuations. CoRR abs/2202.13676 (2022) - [i8]Shayan Chashm Jahan, Masoud Seddighin, Seyed Mohammad Seyed Javadi, Mohammad Sharifi:
Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap. CoRR abs/2212.09482 (2022) - 2021
- [j5]Masoud Seddighin, Mohamad Latifian, Mohammad Ghodsi:
On the Distortion Value of Elections with Abstention. J. Artif. Intell. Res. 70: 567-595 (2021) - [j4]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods: Improvement. Math. Oper. Res. 46(3): 1038-1053 (2021) - [j3]Masoud Seddighin, Hamed Saleh, Mohammad Ghodsi:
Maximin share guarantee for goods with positive externalities. Soc. Choice Welf. 56(2): 291-324 (2021) - [c12]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami:
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. AAAI 2021: 5355-5362 - [c11]Amin Ghiasi, Masoud Seddighin:
Approximate Competitive Equilibrium with Generic Budget. SAGT 2021: 236-250 - 2020
- [c10]Mahdi Boroujeni, Masoud Seddighin, Saeed Seddighin:
Improved Algorithms for Edit Distance and LCS: Beyond Worst Case. SODA 2020: 1601-1620 - [i7]MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun:
Approximating LCS in Linear Time: Beating the √n Barrier. CoRR abs/2003.07285 (2020) - [i6]Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami:
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. CoRR abs/2007.07027 (2020)
2010 – 2019
- 2019
- [j2]Masoud Seddighin, Majid Farhadi, Mohammad Ghodsi, Reza Alijani, Ahmad S. Tajik:
Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts. Algorithmica 81(4): 1728-1755 (2019) - [j1]Alireza Farhadi, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. J. Artif. Intell. Res. 64: 1-20 (2019) - [c9]Mohammad Ghodsi, Mohamad Latifian, Masoud Seddighin:
On the Distortion Value of the Elections with Abstention. AAAI 2019: 1981-1988 - [c8]MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun:
Approximating LCS in Linear Time: Beating the √n Barrier. SODA 2019: 1181-1200 - [c7]Masoud Seddighin, Hamed Saleh, Mohammad Ghodsi:
Externalities and Fairness. WWW 2019: 538-548 - 2018
- [c6]Mohammad Ghodsi, Mohamad Latifian, Arman Mohammadi, Sadra Moradian, Masoud Seddighin:
Rent Division Among Groups. COCOA 2018: 577-591 - [c5]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods: Improvements and Generalizations. EC 2018: 539-556 - [i5]Mohammad Ghodsi, Hamed Saleh, Masoud Seddighin:
Fair Allocation of Indivisible Items With Externalities. CoRR abs/1805.06191 (2018) - [i4]Mohammad Ghodsi, Mohamad Latifian, Masoud Seddighin:
On the Distortion Value of the Elections with Abstention. CoRR abs/1812.09851 (2018) - 2017
- [c4]Reza Alijani, Majid Farhadi, Mohammad Ghodsi, Masoud Seddighin, Ahmad S. Tajik:
Envy-Free Mechanisms with Minimum Number of Cuts. AAAI 2017: 312-318 - [c3]Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohammad Ghodsi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. AAMAS 2017: 1535-1537 - [c2]Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin:
Approximate Minimum Diameter. COCOON 2017: 237-249 - [i3]Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. CoRR abs/1703.01649 (2017) - [i2]Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin:
Approximate Minimum Diameter. CoRR abs/1703.10976 (2017) - [i1]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods: Improvement and Generalization. CoRR abs/1704.00222 (2017) - 2015
- [c1]Ehsan Emamjomeh-Zadeh, Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin:
Unit Covering in Color-Spanning Set Model. WALCOM 2015: 44-52
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
