default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAfrouz Jabal Ameli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità:
Improved Approximations for Flexible Network Design. ESA 2024: 74:1-74:14- [i11]Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità:
Improved Approximations for Flexible Network Design. CoRR abs/2404.08972 (2024) - [i10]Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli:
A 5/4 Approximation for Two-Edge-Connectivity. CoRR abs/2408.07019 (2024) - [i9]Afrouz Jabal Ameli, Faezeh Motiei, Morteza Saghafian
:
The Complexity of Maximizing the MST-ratio. CoRR abs/2409.11079 (2024) - 2023
- [j3]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau:
A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Algorithmica 85(10): 3088-3109 (2023) - [j2]Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli:
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. SIAM J. Comput. 52(3): 718-739 (2023) - [c8]Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli:
A 4/3 Approximation for 2-Vertex-Connectivity. ICALP 2023: 29:1-29:13 - [c7]Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità:
Finding Almost Tight Witness Trees. ICALP 2023: 79:1-79:16 - [c6]Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli:
Improved Approximation for Two-Edge-Connectivity. SODA 2023: 2368-2410 - [i8]Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli:
A 4/3 Approximation for 2-Vertex-Connectivity. CoRR abs/2305.02240 (2023) - [i7]Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli:
A PTAS for Triangle-Free 2-Matching. CoRR abs/2311.11869 (2023) - [i6]Waldo Gálvez, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità:
Node Connectivity Augmentation of Highly Connected Graphs. CoRR abs/2311.17010 (2023) - 2022
- [c5]Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub:
Breaching the 2-approximation barrier for the forest augmentation problem. STOC 2022: 1598-1611 - [i5]Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli:
Improved Approximation for Two-Edge-Connectivity. CoRR abs/2209.10265 (2022) - [i4]Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità:
Choose your witnesses wisely. CoRR abs/2211.12431 (2022) - 2021
- [j1]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat:
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory Comput. Syst. 65(6): 985-1008 (2021) - [c4]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi:
Approximation Algorithms for Demand Strip Packing. APPROX-RANDOM 2021: 20:1-20:24 - [i3]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi:
Approximation Algorithms for Demand Strip Packing. CoRR abs/2105.08577 (2021) - [i2]Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub:
Breaching the 2-Approximation Barrier for the Forest Augmentation Problem. CoRR abs/2112.11799 (2021) - 2020
- [c3]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau:
A Tight (3/2+ε) Approximation for Skewed Strip Packing. APPROX-RANDOM 2020: 44:1-44:18 - [c2]Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli:
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. STOC 2020: 815-825
2010 – 2019
- 2019
- [c1]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat:
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. WAOA 2019: 138-153 - [i1]Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli:
Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree. CoRR abs/1911.02259 (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-16 21:24 CEST 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:
