Although a pilot national live-donor kidney exchange program was recently launched in the US, the kidney shortage is increasing faster than ever. A new solution paradigm is able to incorporate compatible pairs in exchange. In this paper, we consider an exchange framework that has both compatible and incompatible pairs, and patients are indifferent over compatible pairs. Only two-way exchanges a...

We introduce the notion of compatible star decompositions of simple polygons. In general, given two polygons with a correspondence between their vertices, two polygonal decompositions of the two polygons are said to be compatible if there exists a one-to-one mapping between them such that the corresponding pieces are defined by corresponding vertices. For compatible star decompositions, we also...

In kidney paired donation (KPD), incompatible pairs exchange kidneys so that each recipient receives a compatible organ. This modality is underutilized partly because of the difficulty of finding a suitable match among incompatible pairs. Alternatively, recipients with compatible donors might enter KPD arrangements in order to be matched with a donor predicted to give greater allograft durabili...

In this paper, we shall introduce the fuzzyw-distance, then prove a common fixed point theorem with respectto fuzzy w-distance for two mappings under the condition ofweakly compatible in complete fuzzy metric spaces.

in this paper, we shall introduce the fuzzyw-distance, then prove a common fixed point theorem with respectto fuzzy w-distance for two mappings under the condition ofweakly compatible in complete fuzzy metric spaces.

Let G be a finite graph with p vertices and x its chromatic polynomial. A combinatorial interpretation is given to the positive integer (-l)px(-A), where h is a positive integer, in terms of acyclic orientations of G. In particular, (-l)Px(-1) is the number of acyclic orientations of G. An application is given to the enumeration of labeled acyclic digraphs. An algebra of full binomial type, in ...