42 citations · 120 across the 18 of their papers we have counts for
21 papers
Remote Matching: Exact-Cardinality Approximation and Tight UGC Hardness
Arash Ahadi, Morteza Alimi, Sharareh Alipour +1
In the unrestricted max--min metric -join problem, one seeks an even terminal set maximizing the cost of a minimum -join. Iwata and Ravi gave a factor- approximation…
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…
Extremal List Gaps and Inapproximability in Additive Graph Labeling
Arash Ahadi, Sharareh Alipour
We study a vertex-labeling analogue of the -- problem and its list version. For a labeling , let . The additive n…
Improved Wake-Up Time For Euclidean Freeze-Tag Problem
Sharareh Alipour, Arash Ahadi, Kajal Baghestani
The Freeze-Tag Problem (FTP) involves activating a set of initially asleep robots as quickly as possible, starting from a single awake robot. Once activated, a robot can assist in…
Geometric Freeze-Tag Problem
Sharareh Alipour, Kajal Baghestani, Mahdis Mirzaei +1
We study the Freeze-Tag Problem (FTP), introduced by Arkin et al. (SODA'02), where the goal is to wake up a group of robots, starting from a single active robot. Our focus is o…
Optimal Sensor Deception to Deviate from an Allowed Itinerary
Hazhar Rahmani, Arash Ahadi, Jie Fu
In this work, we study a class of deception planning problems in which an agent aims to alter a security monitoring system's sensor readings so as to disguise its adversarial itine…
On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard
Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan
The simplicial rook graph is the graph whose vertices are vectors in such that for each vector the summation of its coordinates is and…
On the algorithmic complexity of decomposing graphs into regular/irregular structures
Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi +1
A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is…
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
A Not-All-Equal (NAE) decomposition of a graph is a decomposition of the vertices of into two parts such that each vertex in has at least one neighbor in each part. Als…
Is there any polynomial upper bound for the universal labeling of graphs?
Arash Ahadi, Ali Dehghan, Morteza Saghafian
A {\it universal labeling} of a graph is a labeling of the edge set in such that in every orientation of for every two adjacent vertices and , the sum of…
Algorithmic complexity of proper labeling problems
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex co…
Algorithmic Complexity of Weakly Semiregular Partitioning and the Representation Number
Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei
A graph is {\it weakly semiregular} if there are two numbers , such that the degree of every vertex is or . The {\it weakly semiregular number} of a graph , deno…
Examples of interacting particle systems on as Pfaffian point processes: coalescing branching random walks and annihilating random walks with immigration
Barnaby Garrod, Roger Tribe, Oleg Zaboronski
Two classes of interacting particle systems on are shown to be Pfaffian point processes at fixed times, and for all deterministic initial conditions. The first compris…
On the complexity of deciding whether the regular number is at most two
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
The regular number of a graph G denoted by reg(G) is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is re…
Sigma Partitioning: Complexity and Random Graphs
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
A of a graph is a partition of the vertices into sets such that for every two adjacent vertices and there is an index $…
The inapproximability for the (0,1)-additive number
Arash Ahadi, Ali Dehghan
An {\it additive labeling} of a graph is a function , such that for every two adjacent vertices and of , $ \sum_{w \sim v}\el…
The Complexity of the Proper Orientation Number
Arash Ahadi, Ali Dehghan
Graph orientation is a well-studied area of graph theory. A proper orientation of a graph is an orientation of such that for every two adjacent vertices $ v…
On the Lucky labeling of Graphs
Arash Ahadi, Ali Dehghan, Esmael Mollaahmadi
Suppose the vertices of a graph were labeled arbitrarily by positive integers, and let denote the sum of labels over all neighbors of vertex . A labeling is lucky i…
Silver block intersection graphs of Steiner 2-designs
A. Ahadi, Nazli Besharati, E. S. Mahmoodian +1
For a block design , a series of {\sf block intersection graphs} , or -{\rm BIG}(), is defined in which the vertices are the blocks of $\cal…
On Rainbow Connection of Strongly Regular Graphs
Arash Ahadi, Ali Dehghan
An edge-colored graph is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph ,…
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
Arash Ahadi, Ali Dehghan
A 2-hued coloring of a graph (also known as conditional -coloring and dynamic coloring) is a coloring such that for every vertex of degree at least , the…