Let $S$ be a set of imprecise points that is represented by axis-aligned pairwise disjoint squares in the plane. A precise instance of $S$ is a set of points, one from each region of $S$. In this paper, we study the optimal ...

Over the recent years, many research has been carried out on applying the optimization approach to science and engineering problems. Thereby, numerous metaheuristic algorithms have been developed for solving such type of ...

The tenacity of a graph $G$, $T(G)$, is defined by$T(G) = min{frac{mid Smid +tau(G-S)}{omega(G-S)}}$, where theminimum is taken over all vertex cutsets $S$ of $G$. We define$tau(G - S)$ to be the number ...

Analyzing eyes performance is essential for effective functioning of human. Therefore, following their motion could help doctors to make quick and accurate diagnoses for disorders like Autism, schizophrenia, or attention ...

vspace{0.2cm}Suppose $G$ is a simple and connected graph. The first and second Zagreb indices of $G$ are two degree-based graph invariants defined as $M_1(G) = sum_{v in V(G)}deg(v)^2$ and $M_2(G) = sum_{e=uv in ...

We study the problem of computing the diameter of a  set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ ...

An outer connected dominating(OCD) set of a graph $G=(V,E)$ is a set $tilde{D} subseteq V$ such that every vertex not in $S$ is adjacent to a vertex in $S$, and the induced subgraph of $G$ by $V setminus tilde{D}$, i.e. ...

vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ ...

vspace{0.2cm} Let $G$ be a graph and $f:V(G)rightarrow {1,2,3,.....left|V(G)right|}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and $ d_{uv}= begin{cases} left[frac{f(u)}{f(v)}right] ~~if~~ f(u) geq ...