Strong dierential subordination and superordination properties are determined for some familiesanalytic functions in the open unit disk which are associated with the Komatu operator by investigatingappropriate classes of admissible functions. New strong dierential sandwich-type results arealso obtained.

In this paper, we consider a new class of analytic functions in the unit disk using polynomials of order alpha. We give some sufficient conditions for functions belonging to this class.

in this paper we introduce and investigate a certain subclass of univalentfunctions which are analytic in the unit disk u.such results as coecientinequalities. the results presented here would provide extensions of those givenin earlier works.

If F is a family of mod 2 k-cycles in the unit n-ball, we lower bound the maximal volume of any cycle in F in terms of the homology class of F in the space of all cycles. We give examples to show that these lower bounds are fairly sharp. This paper is about minimax estimates for the volumes of cycles in complicated families. The simplest example of a minimax problem is a classical result about ...

In this paper we introduce and investigate a certain subclass of univalentfunctions which are analytic in the unit disk U.Such results as coecientinequalities. The results presented here would provide extensions of those givenin earlier works.

A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics ’90]. Since then, it has been an intriguing open question whether or not tractability can be extended to general disk graphs. We show the rather surprisin...

We consider a well-studied generalization of the maximum clique problem which is defined as follows. Given graph G on n vertices and fixed parameter $$d\ge 1$$ , in diameter-bounded subgraph (MaxDBS for short) goal to find (vertex) diameter at most d. For $$d=1$$ this equivalent thus it NP-hard approximate within factor $$n^{1-\epsilon }$$ any $$\epsilon >0$$ . Moreover, known that, 2$$ MaxDBS ...