Zobrazeno 1 - 10
of 243
pro vyhledávání: '"Sritharan R"'
Publikováno v:
In Discrete Applied Mathematics 31 December 2024 359:419-424
Autor:
Zabel, M., Schlögl, S., Lubinski, A., Svendsen, J. H., Bauer, A., Arbelo, E., Brusich, S., Conen, D., Cygankiewicz, I., Dommasch, M., Flevari, P., Galuszka, J., Hansen, J., Hasenfuß, G., Hatala, R., Huikuri, H. V., Kenttä, T., Kuczejko, T., Haarmann, H., Harden, M., Iovev, S., Kääb, S., Kaliska, G., Katsimardos, A., Kasprzak, J. D., Qavoq, D., Lüthje, L., Malik, M., Novotny, T., Pavlovic, N., Perge, P., Röver, C., Schmidt, G., Shalganov, T., Sritharan, R., Svetlosak, M., Sallo, Z., Szavits-Nossan, J., Traykov, V., Vandenberk, B., Velchec, V., Vos, M. A., Willich, S. N., Friede, T., Willems, R., Merkely, B., Sticherling, C., investigators, the EU-CERT-ICD study
Publikováno v:
Journal of Electrocardiology, 2019
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 E
Externí odkaz:
http://arxiv.org/abs/1909.05571
Autor:
Eschen, Elaine M., Sritharan, R.
Publikováno v:
In Discrete Applied Mathematics 15 September 2022 318:97-112
Autor:
Busch, Arthur, Sritharan, R.
Publikováno v:
In Discrete Applied Mathematics 15 September 2019 268:21-34
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
Externí odkaz:
http://arxiv.org/abs/0910.1808
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)-
Externí odkaz:
http://arxiv.org/abs/0909.4719
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 o
Externí odkaz:
http://arxiv.org/abs/0907.0691
Autor:
Artigas, D., Sritharan, R.
Publikováno v:
In Discrete Applied Mathematics 20 August 2018 245:148-154
Publikováno v:
In Discrete Applied Mathematics 31 May 2017 223:39-51
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.