default search action
Hannaneh Akrami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Hannaneh Akrami, Jugal Garg:
Breaking the 3/4 Barrier for Approximate Maximin Share. SODA 2024: 74-91 - [i12]Hannaneh Akrami, Nidhi Rathi:
Epistemic EFX Allocations Exist for Monotone Valuations. CoRR abs/2405.14463 (2024) - [i11]Hannaneh Akrami, Nidhi Rathi:
Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously. CoRR abs/2409.01963 (2024) - 2023
- [c6]Hannaneh Akrami, Jugal Garg, Eklavya Sharma, Setareh Taki:
Simplification and Improvement of MMS Approximation. IJCAI 2023: 2485-2493 - [c5]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
Fair and Efficient Allocation of Indivisible Chores with Surplus. IJCAI 2023: 2494-2502 - [c4]Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin, Golnoosh Shahkarami:
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. NeurIPS 2023 - [c3]Hannaneh Akrami, Noga Alon, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. EC 2023: 61 - [i10]Hannaneh Akrami, Jugal Garg, Eklavya Sharma, Setareh Taki:
Simplification and Improvement of MMS Approximation. CoRR abs/2303.16788 (2023) - [i9]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
Fair and Efficient Allocation of Indivisible Chores with Surplus. CoRR abs/2305.04788 (2023) - [i8]Hannaneh Akrami, Jugal Garg:
Breaking the 3/4 Barrier for Approximate Maximin Share. CoRR abs/2307.07304 (2023) - [i7]Hannaneh Akrami, Jugal Garg, Setareh Taki:
Improving Approximation Guarantees for Maximin Share. CoRR abs/2307.12916 (2023) - [i6]Hannaneh Akrami, Masoud Seddighin, Kurt Mehlhorn, Golnoosh Shahkarami:
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. CoRR abs/2308.14545 (2023) - 2022
- [c2]Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn, Marco Schmalhofer, Golnoosh Shahkarami, Giovanna Varricchio, Quentin Vermande, Ernest van Wijland:
Maximizing Nash Social Welfare in 2-Value Instances. AAAI 2022: 4760-4767 - [c1]Hannaneh Akrami, Rojin Rezvan, Masoud Seddighin:
An EF2X Allocation Protocol for Restricted Additive Valuations. IJCAI 2022: 17-23 - [i5]Hannaneh Akrami, Rojin Rezvan, Masoud Seddighin:
An EF2X Allocation Protocol for Restricted Additive Valuations. CoRR abs/2202.13676 (2022) - [i4]Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
EFX Allocations: Simplifications and Improvements. CoRR abs/2205.07638 (2022) - [i3]Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn, Marco Schmalhofer, Golnoosh Shahkarami, Giovanna Varricchio, Quentin Vermande, Ernest van Wijland:
Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case. CoRR abs/2207.10949 (2022) - 2021
- [i2]Hannaneh Akrami, Bhaskar Ray Chaudhury, Kurt Mehlhorn, Golnoosh Shahkarami, Quentin Vermande:
Nash Social Welfare for 2-value Instances. CoRR abs/2106.14816 (2021)
2010 – 2019
- 2019
- [j1]Hannaneh Akrami, Kurt Mehlhorn, Tommy Odland:
Ratio-balanced maximum flows. Inf. Process. Lett. 150: 13-17 (2019) - [i1]Hannaneh Akrami, Kurt Mehlhorn, Tommy Odland:
Ratio-Balanced Maximum Flows. CoRR abs/1902.11047 (2019)
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 2024-10-07 01:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint