A. Ahadi

activity

20092026

most citedAlgorithmic complexity of proper labeling problems

42 citations · 120 across the 18 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.DS2026

Remote Matching: Exact-Cardinality Approximation and Tight UGC Hardness

Arash Ahadi, Morteza Alimi, Sharareh Alipour +1

In the unrestricted max--min metric $T$ -join problem, one seeks an even terminal set $T$ maximizing the cost of a minimum $T$ -join. Iwata and Ravi gave a factor- $3/2$ approximation…

math.CO2026

Multiset Colorings of Random Graphs Across Density Regimes

Arash Ahadi, Sharareh Alipour

We show that almost every graph admits a partition of its vertex set into three parts such that no two adjacent vertices have the same number of neighbors in each of the three part…

math.CO2026

Extremal List Gaps and Inapproximability in Additive Graph Labeling

Arash Ahadi, Sharareh Alipour

We study a vertex-labeling analogue of the $1$ - $2$ - $3$ problem and its list version. For a labeling $ℓ : V (G) \to N$ , let $S_{ℓ} (v) = \sum_{w \in N (v)} ℓ (w)$ . The additive n…