Search

BACKGROUND. The clinical effectiveness of primary prevention implantable cardioverter defibrillator (ICD) therapy is under debate. It is urgently needed to better identify patients who benefit from prophylactic ICD therapy. The EUropean Comparative Effectiveness Research to Assess the Use of Primary ProphylacTic Implantable Cardioverter Defibrillators (EU-CERT-ICD) completed in 2019 will assess this issue. SUMMARY. The EU-CERT-ICD is a prospective investigator-initiated non-randomized, controlled, multicenter observational cohort study done in 44 centers across 15 European countries. A total of 2327 patients with heart failure due to ischemic heart disease or dilated cardiomyopathy indicated for primary prophylactic ICD implantation were recruited between 2014 and 2018 (>1500 patients at first ICD implantation, >750 patients non-randomized non-ICD control group). The primary endpoint was all-cause mortality, first appropriate shock was co-primary endpoint. At baseline, all patients underwent 12-lead ECG and Holter-ECG analysis using multiple advanced methods for risk stratification as well as documentation of clinical characteristics and laboratory values. The EU-CERT-ICD data will provide much needed information on the survival benefit of preventive ICD therapy and expand on previous prospective risk stratification studies which showed very good applicability of clinical parameters and advanced risk stratifiers in order to define patient subgroups with above or below average ICD benefit. CONCLUSION. The EU-CERT-ICD study will provide new and current data about effectiveness of primary prophylactic ICD implantation. The study also aims for improved risk stratification and patient selection using clinical risk markers in general, and advanced ECG risk markers in particular., Comment: 22 pages, 3 figures

Deciding whether an arbitrary graph contains a sun was recently shown to be NP-complete. We show that whether a building-free graph contains a sun can be decided in O(min$\{m{n^3}, m^{1.5}n^2\}$) time and, if a sun exists, it can be found in the same time bound. The class of building-free graphs contains many interesting classes of perfect graphs such as Meyniel graphs which, in turn, contains classes such as hhd-free graphs, i-triangulated graphs, and parity graphs. Moreover, there are imperfect graphs that are building-free. The class of building-free graphs generalizes several classes of graphs for which an efficient test for the presence of a sun is known. We also present a vertex elimination scheme for the class of (building, gem)-free graphs. The class of (building, gem)-free graphs is a generalization of the class of distance hereditary graphs and a restriction of the class of (building, sun)-free graphs., Comment: 3 figures

We consider the class of (C4, diamond)-free graphs; graphs in this class do not contain a C4 or a diamond as an induced subgraph. We provide an efficient recognition algorithm for this class. We count the number of maximal cliques in a (C4, diamond)-free graph and the number of n-vertex, labeled (C4, diamond)-free graphs. We also give an efficient algorithm for finding a largest clique in the more general class of (house, diamond)-free graphs.

In an article [3] published recently in this journal, it was shown that when k >= 3, the problem of deciding whether the distinguishing chromatic number of a graph is at most k is NP-hard. We consider the problem when k = 2. In regards to the issue of solvability in polynomial time, we show that the problem is at least as hard as graph automorphism but no harder than graph isomorphism.