Results 251 to 260 of about 23,983 (294)

Flanking-Group Engineering Unlocks Emerging Functionalities in Diketopyrrolopyrrole Semiconductors. [PDF]

Adv Sci (Weinh)
Wu X, Zhou S, Li M, Kyaw AKK, Shi XL, Liu Q.   +5 more
europepmc   +1 more source

Entropy-mediated solidification stabilizes and enhances energetic release in amorphous energetic materials. [PDF]

Nat Commun
Zhou X, Wang Z, Huang H, Liu Y, Li S, Qian W, Huang S, Xu J.   +7 more
europepmc   +1 more source

Precise Structure Regulation Induced Morphological Ordering Enables All-Polymer Solar Cells With 20.29% Efficiency and Extreme Mechanical Robustness. [PDF]

Angew Chem Int Ed Engl
Gao H, Sun L, Sun Y, Wang L, Ma X, Zu M, Zou X, Kan Y, Wang X, Yang R, Wan X, Feng Y, Gao K, Chen Y.   +13 more
europepmc   +1 more source

Decoding non-fullerene acceptors for organic solar cells: a theoretical structure-property-performance perspective. [PDF]

RSC Adv
Murtaza HU, Sultan N, Janjua MRSA.
europepmc   +1 more source

Thermally activated delayed fluorescence in neutral and cationic stages of aza-nanographene decorated with 6.6.6 defects. [PDF]

Chem Sci
Suku RV, Serdiuk IE, Dzieszkowski K, Orzeł Ł, Kijewska M, Muzioł TM, Siczek M, Pawlicki M.   +7 more
europepmc   +1 more source

Beyond Level Planarity: Cyclic, Torus, and Simultaneous Level Planarity

Theoretical Computer Science, 2020
In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to surfaces different from the plane. Namely, we show that the problems of testing the existence of a level embedding of a
Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter   +2 more
exaly   +2 more sources

Beyond Level Planarity

Lecture Notes in Computer Science, 2016
In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to surfaces different from the plane. Namely, we show that the problems of testing the existence of a level embedding of a
Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Planar Separators

SIAM Journal on Discrete Mathematics, 1994
The authors give a short proof of a theorem of Lipton and Tarjan, that, for every planar graph with $n > 0$ vertices, there is a partition $( A,B,C )$ of its vertex set such that $|A|,|B| < \frac{2}{3}n,|C| \leq 2( 2n )^{1/2} $, and no vertex in A is adjacent to any vertex in B Secondly, they apply the same technique more carefully to deduce that,
Noga Alon, Paul D. Seymour, Robin Thomas 0001   +2 more
openaire   +2 more sources