Abstract In the wake of Donald Trump’s presidency, a fierce discussion over expanding US Supreme Court erupted. However, expansion court’s membership is just one several court-packing techniques. Moreover, American debate peculiar due to unique features Court. The aim this article look at from comparative perspective, link debates on tinkering with courts’ composition both sides Atlantic, and b...

abdominal pregnancies are very uncommon and are misdiagnosed in half of the cases. we describe a case of abdominal pregnancy, which was misdiagnosed as pregnancy in a bicornuate uterus.the patient underwent operation urgently because of unstable hemodynamics. the spontaneously separated placenta and its bleeding site in the douglas pouch were seen. we could not use sutures for hemostasis so, th...

We estimate the packing measure of Cantor sets associated to nonincreasing sequences through their decay. This result, dual to one obtained by Besicovitch and Taylor, allows us to characterize the dimension functions recently found by Cabrelli et al for these sets.

Dual-feasible functions are valuable tools that can be used to compute both lower bounds for different combinatorial problems and valid inequalities for integer programs. Several families of functions have been used in the literature. Some of them were defined explicitly, and others not. One of the main objectives of this paper is to survey these functions, and to state results concerning their...

In this paper, we consider the variable sized bin packing problem where the objective is to minimize the total cost of used bins when the cost of unit size of each bin does not increase as the bin size increases. Two greedy algorithms are described, and analyzed in three special cases: (a) the sizes of items and bins are divisible, respectively, (b) only the sizes of bins are divisible, and (c)...

In this paper, we study the d-dimensional dynamic bin packing problem for general ddimensional boxes, for d ≥ 2. This problem is a generalization of the bin packing problem in which items may arrive and depart dynamically. Our main result is a 3-competitive online algorithm. We further study the 2and 3-dimensional problem closely and improve the competitive ratios. Technically speaking, our d-d...

It is shown how one can draw graphs on surfaces of negative Euler characteristic by using hyperbolic geometry and hyperbolic circle packing representations. The same approach applies to drawings of hyperbolic tessellations.