Afrouz Jabal Ameli

MaRDI QIDQ2193088zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A \(4/3\) approximation for \(2\)-vertex-connectivity TheoretiCS	2025-10-22	Paper
The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds Discrete Applied Mathematics	2025-01-27	Paper
Breaching the 2-approximation barrier for the forest augmentation problem Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	2023-12-08	Paper
Approximation Algorithms for Demand Strip Packing (available as arXiv preprint)	2023-11-20	Paper
A Tight (3/2+ε) Approximation for Skewed Strip Packing.	2023-10-31	Paper
A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing Algorithmica	2023-10-06	Paper
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree SIAM Journal on Computing	2023-06-09	Paper
Finding Almost Tight Witness Trees	2022-11-22	Paper
Improved Approximation for Two-Edge-Connectivity	2022-09-21	Paper
On the cycle augmentation problem: hardness and approximation algorithms Theory of Computing Systems	2021-09-28	Paper
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	2021-01-19	Paper
On the Cycle Augmentation Problem: hardness and approximation algorithms	2020-08-24	Paper
The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Afrouz Jabal Ameli