Approximation Algorithms for Demand Strip Packing. - Waldo Gálvez; Fabrizio Grandoni 001; Afrouz Jabal Ameli; Kamyar Khodamoradi (APPROX-RANDOM, 2021)

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. - Waldo Gálvez; Fabrizio Grandoni 001; Afrouz Jabal Ameli; Krzysztof Sornat (Theory Comput. Syst., 2021)

Breaching the 2-approximation barrier for the forest augmentation problem. - Fabrizio Grandoni 001; Afrouz Jabal Ameli; Vera Traub (STOC, 2022)

Choose your witnesses wisely. - Dylan Hyatt-Denesik; Afrouz Jabal Ameli; Laura Sanità (CoRR, 2022)

Finding Almost Tight Witness Trees. - Dylan Hyatt-Denesik; Afrouz Jabal Ameli; Laura Sanità (ICALP, 2023)

Improved Approximation for Two-Edge-Connectivity. - Mohit Garg 003; Fabrizio Grandoni 001; Afrouz Jabal Ameli (SODA, 2023)

A PTAS for Triangle-Free 2-Matching. - Miguel Bosch-Calvo; Fabrizio Grandoni 001; Afrouz Jabal Ameli (CoRR, 2023)

Node Connectivity Augmentation of Highly Connected Graphs. - Waldo Gálvez; Dylan Hyatt-Denesik; Afrouz Jabal Ameli; Laura Sanità (CoRR, 2023)

Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree. - Jaroslaw Byrka; Fabrizio Grandoni 001; Afrouz Jabal Ameli (SIAM J. Comput., 2023)

A Tight (3/2+ε )-Approximation for Skewed Strip Packing. - Waldo Gálvez; Fabrizio Grandoni 001; Afrouz Jabal Ameli; Klaus Jansen; Arindam Khan 001; Malin Rau (Algorithmica, 2023)

Improved Approximations for Flexible Network Design. - Dylan Hyatt-Denesik; Afrouz Jabal Ameli; Laura Sanità (ESA, 2024)

Approximation Algorithms for k-Scenario Matching. - Danny Blom; Dylan Hyatt-Denesik; Afrouz Jabal Ameli; Bart Smeulders (WAOA, 2024)

A 5/4 Approximation for Two-Edge-Connectivity. - Miguel Bosch-Calvo; Fabrizio Grandoni 001; Afrouz Jabal Ameli (CoRR, 2024)

The Complexity of Maximizing the MST-ratio. - Afrouz Jabal Ameli; Faezeh Motiei; Morteza Saghafian (CoRR, 2024)

A 5/4-Approximation for Two-Edge Connectivity. - Miguel Bosch-Calvo; Mohit Garg 003; Fabrizio Grandoni 001; Felix Hommelsheim; Afrouz Jabal Ameli; Alexander Lindermayr (STOC, 2025)

The clique number of the exact distance t-power graph: Complexity and eigenvalue bounds. - Aida Abiad; Afrouz Jabal Ameli; Luuk Reijnders (Discret. Appl. Math., 2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity. - Miguel Bosch-Calvo; Fabrizio Grandoni 001; Afrouz Jabal Ameli (TheoretiCS, 2025)

Learning-Augmented Online Covering Problems. - Afrouz Jabal Ameli; Laura Sanità; Moritz Venzin (CoRR, 2025)