default search action
Golnoosh Shahkarami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Eric Balkanski, Vasilis Gkatzelis, Golnoosh Shahkarami:
Randomized Strategic Facility Location with Predictions. NeurIPS 2024 - [i10]Eric Balkanski, Vasilis Gkatzelis
, Golnoosh Shahkarami:
Randomized Strategic Facility Location with Predictions. CoRR abs/2409.07142 (2024) - [i9]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
- [c6]Themistoklis Gouleakis
Learning-Augmented Algorithms for Online TSP on the Line. AAAI 2023: 11989-11996 - [c5]Evripidis Bampis, Bruno Escoffier, Themis Gouleakis
Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. ESA 2023: 12:1-12:17 - [c4]Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin, Golnoosh Shahkarami:
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. NeurIPS 2023 - [i8]Evripidis Bampis, Bruno Escoffier, Themis Gouleakis
Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else. CoRR abs/2305.02169 (2023) - [i7]Hannaneh Akrami, Masoud Seddighin
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. CoRR abs/2308.14545 (2023) - 2022
- [j1]Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev
Physarum-inspired multi-commodity flow dynamics. Theor. Comput. Sci. 920: 1-20 (2022) - [c3]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 - [c2]Antonios Antoniadis, Peyman Jabbarzade, Golnoosh Shahkarami:
A Novel Prediction Setup for Online Speed-Scaling. SWAT 2022: 9:1-9:20 - [i6]Themis Gouleakis
Learning-Augmented Algorithms for Online TSP on the Line. CoRR abs/2206.00655 (2022) - [i5]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
- [i4]Hannaneh Akrami, Bhaskar Ray Chaudhury, Kurt Mehlhorn, Golnoosh Shahkarami, Quentin Vermande:
Nash Social Welfare for 2-value Instances. CoRR abs/2106.14816 (2021) - [i3]Antonios Antoniadis, Peyman Jabbarzade, Golnoosh Shahkarami:
A Novel Prediction Setup for Online Speed-Scaling. CoRR abs/2112.03082 (2021) - 2020
- [c1]Saeed Akhoondian Amiri
Complexity of Computing the Anti-Ramsey Numbers for Paths. MFCS 2020: 6:1-6:14 - [i2]Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande:
Physarum Multi-Commodity Flow Dynamics. CoRR abs/2009.01498 (2020)
2010 – 2019
- 2018
- [i1]Saeed Akhoondian Amiri, Alexandru Popa, Golnoosh Shahkarami, Hossein Vahidi:
Complexity of computing the anti-Ramsey numbers. CoRR abs/1810.08004 (2018)
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-03-04 22:27 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: