We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arboricity, i.e., graphs with no dense subgraphs, like for example planar graphs. Brodal and Fagerberg [WADS’99] described a very simple linear-size data structure which processes queries in constant worst-case time and perform...

Penna (2011) asks whether subjects with different follow-up times can be analysed through binomial regression. The answer to this question is “yes”. If the rate for a particular person is λ and they have been observed for a period of time (t), then the probability (p) of having an event during that time is equal to 1-e-λt. The equation can be re-arranged to give log[log(1-p)] = log(λ)+log(t). T...

We consider a linear complementarity problem (LCP) arisen from the Arrow-Debreu-Leontief competitive economy equilibrium where the LCP coefficient matrix is symmetric. We prove that the decision problem, to decide whether or not there exists a complementary solution, is NP-complete. Under certain conditions, an LCP solution is guaranteed to exist and we present a fully polynomial-time approxima...

Compared with tender offers, bidders can easily obtain target firms in the scheme of arrangements. This study investigates impact deal and characteristics on 803 firms’ survival to be taken over by a arrangement or offer UK takeover market, during 1995 2018 period, through applying analysis, including continuous (PH Cox, Weibull) discrete-time (complementary log-log) hazard models. The findings...

background: the classical supportive therapy for î² -thalassemia major consists of regular blood transfusion, iron-chelation therapy and specific treatment of the related complications. a balance between the maintenance of the highest possible level of haemoglobin and lowest possible level of iron accumulation in heart and liver give the best chance of survival and the best quality of life. met...