Afrouz Jabal Ameli

According to our database, Afrouz Jabal Ameli authored at least 21 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph.

Afrouz Jabal Ameli, Tomohiro Koana, Jesper Nederlof, Shengzhe Wang

CoRR, April, 2026

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics.

Afrouz Jabal Ameli, Jesper Nederlof, Shengzhe Wang

CoRR, April, 2026

On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum.

Afrouz Jabal Ameli, Faezeh Motiei, Morteza Saghafian

Proceedings of the WALCOM: Algorithms and Computation, 2026

2025

Learning-Augmented Online Covering Problems.

Afrouz Jabal Ameli, Laura Sanità, Moritz Venzin

CoRR, July, 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 5/4-Approximation for Two-Edge Connectivity.

Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

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, Fabrizio Grandoni, Afrouz Jabal Ameli

CoRR, 2024

Approximation Algorithms for k-Scenario Matching.

Danny Blom, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Bart Smeulders

Proceedings of the Approximation and Online Algorithms - 22nd International Workshop, 2024

Improved Approximations for Flexible Network Design.

Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Node Connectivity Augmentation of Highly Connected Graphs.

Waldo Gálvez, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità

CoRR, 2023

A PTAS for Triangle-Free 2-Matching.

Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli

CoRR, 2023

Improved Approximation for Two-Edge-Connectivity.

Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Finding Almost Tight Witness Trees.

Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

A 4/3 Approximation for 2-Vertex-Connectivity.

Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Choose your witnesses wisely.

Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità

CoRR, 2022

Breaching the 2-approximation barrier for the forest augmentation problem.

Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

Approximation Algorithms for Demand Strip Packing.

Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi

Proceedings of the Approximation, 2021

2020

Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree.

Jaroslaw Byrka, Fabrizio Grandoni, Afrouz Jabal Ameli

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

A Tight (3/2+ε) Approximation for Skewed Strip Packing.

Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau

Proceedings of the Approximation, 2020

2019

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms.

Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019