We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search performance for data with more inherent sortedness. Given n points in the plane, it can answer range queries in O(k logn+m) time, where m is the number of points in the output and k is the minimum number of monotonic chains into whic...

Consider a set of n points in the plane, each one of which is colored either red, blue, or purple. A red-blue-purple spanning graph (RBP spanning graph) is a graph whose vertices are the points and whose edges connect the points such that the subgraph induced by the red and purple points is connected, and the subgraph induced by the blue and purple points is connected. The minimum RBP spanning ...

The antifungal activity and the chemical composition of essential oils (EOs) from some Mediterranean autochthonous plants were investigated against Malassezia pachydermatis, a fastidious opportunistic yeast usually involved in canine external otitis. Minimum inhibitory concentrations (MICs) of Anthemis nobilis, Citrus limon, Citrus paradisi, Illicium verum, Lavandula hybrida, Mentha piperita, O...

The Otolithes ruber is considered a valuable fish in the Indo-West Pacific. Estimates of the Q/B ratio and parameters of equations to ‘predict’ Q/B values for O. ruber in northwestern part of the Persian Gulf and the effects of different age-groups (age 1 to 6 year) on prey are presented. The age and food item of O. ruber were recorded on data collected from monthly samplings by bottom tra...

Ursolic acid is a very important compound due to its biological potential as an anti-inflammatory, trypanocidal, antirheumatic, antiviral, antioxidant and antitumoral agent. This study presents the HPLC analysis of ursolic acid (UA) content in eight different Ocimum species: O. americanum L., O. basilicum L, O. basilicum var purpurascens Benth, O. basilicum var. minimum L, O. gratissimum L, O. ...

In this paper, we study a minimum connected dominating set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pairwise shortest path should be included. Such a minimum CDS (we name this problem as SPCDS) is an important tache of some other algorithms for constructing a minimum CDS. We prove that finding such a minimum SPCDS can...

We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in general position has a minimum pseudo-triangulation whose maximum face degree is four (i.e. each interior face of this pseudo-triangulation has at most four vertices). Both degree bounds are tight. Minimum pseudo-trian...

We present an O(1.7548) algorithm finding a minimum feedback vertex set in a graph on n vertices.

Given a set of n colored points with a total of m > 3 colors in 2D, the problem of identifying the smallest color-spanning object is studied. We have considered two different shapes: (i) corridor, and (ii) rectangle of arbitrary orientation. Our proposed algorithm identifies the narrowest color-spanning corridor in O(n2 log n) time using O(n) space. Our proposed algorithm for identifying minimu...