In: Endocrine, 2022, no. 75, p. 33–39
Purpose: The sensitivity of cytology after fine needle aspiration (FNA-cytology) in detecting medullary thyroid carcinoma (MTC) is low. To overcome this problem, measuring calcitonin (CT) in washout fluid of FNA (FNA-CT) has been largely diffused and showed good performance. However, no evidence-based study exists comparing systematically the sensitivity of FNA-cytology and FNA-CT. This study...
|
In: Physical Review B, 2020, vol. 102, no. 20, p. 205108
This work is a study of dynamical conductivity of a quasi-two-dimensional heterostructure Li(BN)8. The conducting electrons have a free-electron-like parabolic dispersion and are assumed to scatter only on acoustic phonons. The approach used to derive the generalized Drude relation with frequency and temperature dependent relaxation consists of defining the induced current density as a...
|
In: Physical Review B, 2020, vol. 102, no. 4, p. 045201
TaIrTe4 is an example of a candidate Weyl type-II semimetal with a minimal possible number of Weyl nodes. Four nodes are reported to exist in a single plane in k space. The existence of a conical dispersion linked toWeyl nodes has yet to be shown experimentally. Here, we use optical spectroscopy as a probe of the band structure on a low-energy scale. Studying optical conductivity allows us to...
|
In: 30th International Symposium on Algorithms and Computation (ISAAC) - Leibniz International Proceedings in Informatics, 2019, vol. 149, no. 21, p. 1-14
In this paper, we consider the following problem: given a connected graph G, can we reduce the domination number of G by one by using only one edge contraction? We show that the problem is NP-hard when restricted to {P6, P4 + P2}-free graphs and that it is coNP-hard when restricted to subcubic claw-free graphs and 2P3-free graphs. As a consequence, we are able to establish a complexity dichotomy...
|
In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) - LIPICS Vol. 138, 2019, p. 41:1-41:13
In this paper, we study the following problem: given a connected graph G, can we reduce the domination number of G by at least one using k edge contractions, for some fixed integer k >= 0? We show that for k <= 2, the problem is coNP-hard. We further prove that for k=1, the problem is W[1]-hard parameterized by the size of a minimum dominating set plus the mim-width of the input graph, and that...
|
In: Intensive Care Medicine, 2014, vol. 40, no. 10, p. 1429-1448
|
In: Nature Communications, 2019, vol. 10, no. 1, p. 264
Permafrost warming has the potential to amplify global climate change, because when frozen sediments thaw it unlocks soil organic carbon. Yet to date, no globally consistent assessment of permafrost temperature change has been compiled. Here we use a global data set of permafrost temperature time series from the Global Terrestrial Network for Permafrost to evaluate temperature change across...
|
In: European Child & Adolescent Psychiatry, 2006, vol. 15, p. i25-i29
|
In: Intensive Care Medicine, 1998, vol. 24, no. 8, p. 769-776
|
In: International Archives of Occupational and Environmental Health, 2012, vol. 85, no. 3, p. 261-271
|