TiO2/TiOxNy hollow mushrooms-like nanocomposite photoanode for hydrogen electrogeneration. - In: Journal of porous materials, ISSN 1573-4854, Bd. 27 (2020), 1, S. 133-139
Im Titel sind "2", "x" und "y" tiefgestellt
https://doi.org/10.1007/s10934-019-00792-0
Tailoring conductive networks within hollow carbon nanospheres to host phosphorus for advanced sodium ion batteries. - In: Nano energy, ISSN 2211-2855, Bd. 70 (2020), 104569
https://doi.org/10.1016/j.nanoen.2020.104569
Automated parameter extraction of ScAlN MEMS devices using an extended Euler-Bernoulli beam theory. - In: Sensors, ISSN 1424-8220, Bd. 20 (2020), 4, 1001, insges. 19 S.
https://doi.org/10.3390/s20041001
Analytical Fresnel laws for curved dielectric interfaces. - In: Journal of optics, ISSN 2040-8986, Volume 22 (2020), number 1, 015605, Seite 1-6
https://doi.org/10.1088/2040-8986/ab5c42
Effects of pristine C60 fullerenes on liver and pancreas in α-naphthylisothiocyanate-induced cholangitis. - In: Digestive diseases and sciences, ISSN 1573-2568, Bd. 65 (2020), 1, S. 215-224
Im Titel ist "60" tiefgestellt
https://doi.org/10.1007/s10620-019-05730-3
Microsegmented flow-assisted miniaturized culturing for isolation and characterization of heavy metal-tolerant bacteria. - In: International journal of environmental science and technology, ISSN 1735-2630, Bd. 17 (2020), 1, S. 1-16
https://doi.org/10.1007/s13762-019-02424-1
Nanoelectrode design from microminiaturized honeycomb monolith with ultrathin and stiff nanoscaffold for high-energy micro-supercapacitors. - In: Nature Communications, ISSN 2041-1723, Bd. 11 (2020), 299, S. 1-10
https://doi.org/10.1038/s41467-019-14170-6
The k-server problem with parallel requests and the compound work function algorithm. - In: Baltic journal of modern computing, ISSN 2255-8950, Bd. 8 (2020), 1, S. 1-20
In this paper the compound work function algorithm for solving the generalized k-server problem is proposed. This problem is an online k-server problem with parallel requests where several servers can also be located on one point. In 1995 Koutsoupias and Papadimitriouhave proved that the well-known work function algorithm is competitive for the (usual) k-server problem. A proof, where a potential-like function argument is included, was given by Borodinand El-Yaniv in 1998. Unfortunately, certain techniques of these proofs cannot be applied to show that a natural generalization of the work function algorithm is competitive for the problem with parallel requests. Values of work functions, which are used by the compound work function algorithm are derived from a surrogate problem, where at most one server must be moved in servicing the request in each step. We can show that the compound work function algorithm is competitive with the same bound of the ratio as in the case of the usual problem.
https://doi.org/10.22364/bjmc.2020.8.1.01
Maximal ambiguously k-colorable graphs. - In: Journal of combinatorial theory, Bd. 140 (2020), S. 248-262
https://doi.org/10.1016/j.jctb.2019.05.007
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization. - Wiesbaden : Springer Spektrum, 2020. - VIII, 70 Seiten. - (BestMasters) ISBN 978-3-658-29148-8