Afrouz Jabal Ameli

Orcid: 0000-0001-5620-9039

According to our database1, Afrouz Jabal Ameli authored at least 11 papers between 2021 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Tight (3/2+ε )-Approximation for Skewed Strip Packing.
Algorithmica, October, 2023

Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree.
SIAM J. Comput., June, 2023

Node Connectivity Augmentation of Highly Connected Graphs.
CoRR, 2023

A PTAS for Triangle-Free 2-Matching.
CoRR, 2023

Improved Approximation for Two-Edge-Connectivity.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Finding Almost Tight Witness Trees.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

A 4/3 Approximation for 2-Vertex-Connectivity.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Choose your witnesses wisely.
CoRR, 2022

Breaching the 2-approximation barrier for the forest augmentation problem.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms.
Theory Comput. Syst., 2021

Approximation Algorithms for Demand Strip Packing.
Proceedings of the Approximation, 2021


  Loading...