Results 311 to 320 of about 4,335,157 (373)

3D Hyperbolic Kirigami Metamaterials With Tunable Auxeticity and Multistability. [PDF]

Adv Sci (Weinh)
Lei Y, Wang Y, Cui R, Huang X, Zhang L, Jin Y, Gao J, Deng B.   +7 more
europepmc   +1 more source

Effect of transverse magnetic field on hot electron and ion fluxes generated by laser interactions with disc-double-coil targets. [PDF]

Sci Rep
Pisarczyk T, Renner O, Domański J, Dudzak R, Rusiniak Z, Chodukowski T, Rosinski M, Badziak J, Zaraś-Szydłowska A, Krasa J, Krupka M, Tchórz P, Cikhardt J, Cikhardtová B, Klir D, Singh S, Agarwal S, Devi P, Gajdos P, Ettel D, Rafalak W, Santos JJ, Fefeu N, Marchenko H, Borodziuk S, Kustosz M, Miklaszewski R, Dostal J, Krus M, Morace A, Juha L.   +30 more
europepmc   +1 more source

In Vitro Activity of Cefiderocol Against Multi-Drug-Resistant Gram-Negative Clinical Isolates in Romania. [PDF]

Antibiotics (Basel)
Baicus A, Sisu VD, Tatar AD, Gherghel A, Iacob DG, Pop CS, Cirstoiu CF.   +6 more
europepmc   +1 more source

Comparison of VITEK REVEAL fast antimicrobial susceptibility testing to antibiotic disk diffusion for gram-negative bloodstream infections. [PDF]

J Clin Microbiol
Bui TI, Brown AP, Muenks CE, Dumm RE.
europepmc   +1 more source

Unit Disk Visibility Graphs [PDF]

, 2021
We study unit disk visibility graphs, where the visibility relation between a pair of geometric entities is defined by not only obstacles, but also the distance between them.
Onur cCaugirici, Deniz Augaouglu
semanticscholar   +4 more sources

Strongly Hyperbolic Unit Disk Graphs

Symposium on Theoretical Aspects of Computer Science, 2021
The class of Euclidean unit disk graphs is one of the most fundamental and well-studied graph classes with underlying geometry. In this paper, we identify this class as a special case in the broader class of hyperbolic unit disk graphs and introduce ...
Thomas Bläsius, T. Friedrich, Maximilian Katzmann, Daniel Stephan   +3 more
semanticscholar   +9 more sources

Some of the next articles are maybe not open access.

Related searches:

Reverse Shortest Path Problem for Unit-Disk Graphs

Workshop on Algorithms and Data Structures, 2021
Given a set P of n points in the plane, the unit-disk graph G_{r}(P) with respect to a parameter r is an undirected graph whose vertex set is P such that an edge connects two points p, q \in P if the Euclidean distance between p and q is at most r (the ...
Haitao Wang, Yiming Zhao
semanticscholar   +1 more source