Results 201 to 210 of about 149,182 (235)
This bioinspired acinus‐on‐a‐chip recapitulates VILI pathology, revealing that volutrauma drives P53/NF‐κB pathways while barotrauma triggers mitochondrial‐Wnt dysregulation. A fibrotic transitional cell cluster was identified. Pharmacological interventions targeting these pathways significantly ameliorated injury, establishing a mechanobiological ...
Heng Lu +10 more
wiley +1 more source
Data Science-Guided Development of Deoxyfluorination Reagents with Enhanced Reactivity, Practicality, and Safety. [PDF]
Ruos ME +11 more
europepmc +1 more source
Nonadiabatic Molecular Dynamics Simulations Provide Evidence for Coexistence of Planar and Nonplanar Intramolecular Charge Transfer Structures in Fluorazene. [PDF]
Kochman MA.
europepmc +1 more source
Extremophile survives the transient pressures associated with impact-induced ejection from Mars. [PDF]
Zhao L +3 more
europepmc +1 more source
Dormancy Versus Germination: 3D Protein Modeling and Evolutionary Analyses Define the Roles of Genetic Variants in the Barley MKK3 Enzyme. [PDF]
Hrmova M +5 more
europepmc +1 more source
Novel synthesized covalent organic framework and determination of its adsorption capacity for coumarin dyes. [PDF]
Özden E, Yiğit A, Bayraktutan T.
europepmc +1 more source
Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as k-level graphs [16, 15, 13, 14, 11, 12, 10, 6] and clustered graphs [7, 5].
Christian Bachmaier
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the twenty-first annual symposium on Computational geometry, 2005
Giuseppe di Battista
exaly +2 more sources
Giuseppe di Battista
exaly +2 more sources
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
For a clustered graph, i.e, a graph whose vertex set is recursively partitioned into clusters, the C-Planarity Testing problem asks whether it is possible to find a planar embedding of the graph and a representation of each cluster as a region ...
Michael Goodrich +2 more
exaly +2 more sources

