Given a graph $$G=(V,E)$$ and an integer k, the Minimum Membership Dominating Set (MMDS) problem seeks to find dominating set $$S \subseteq V$$ of G such that for each $$v \in , $$\vert N[v] \cap S\vert $$ is at most k. We investigate parameterized complexity obtain following results MMDS problem. First, we show NP-hard even on planar bipartite graphs. Next, W[1]-hard parameter pathwidth (and t...

In this paper we continue to investigate the important parameter of global warming a heat wave that has no unique definition and represents the constellation of different factors such as e.g., heat index (temperature + humidity), time periods of excessive heat, etc. We find typical characteristics of heat indexes during different time periods, using most typical fuzzy expected values. Trapezoid...

In this paper, the texture feature ”coarseness” is modelled by means of a fuzzy partition on the domain of coarseness measures. The number of linguistic labels to be used, and the parameters of the membership functions associated to each fuzzy set are calculated relating representative coarseness measures (our reference set) with the human perception of this texture property. A wide variety of ...