Results 151 to 160 of about 22,687 (289)
An upward planar drawing of a directed graph (digraph) is a planar drawing such that all the edges are represented by curves monotonically increasing in the vertical direction. In this paper we introduce and study the concept of quasi-upward planarity.
Di Battista G, Bertolazzi P, Didimo W
core
Load Distributing Metamaterials Via Discrete Optimization
Mechanical metamaterials are computationally optimized to homogenize transmitted forces by minimizing the spread of reaction forces. The resulting architectures transform localized loading into broader, more uniform force distributions and experimentally demonstrate robust load spreading under quasi‐static and impact loading.
Andrea Detry +6 more
wiley +1 more source
Exchange‐Coupled Two‐Dimensional MOFs
Graphene mediates ferromagnetic coupling between two‐dimensional metal‐organic frameworks and cobalt. Fe‐tetracyanobenzene develops a remanent magnetic response whose orientation follows the cobalt magnetization direction and persists up to room temperature, whereas Ni‐TCNB remains only field‐polarized.
Iulia Cojocariu +5 more
wiley +1 more source
A planarity test via construction sequences
Linear-time algorithms for testing the planarity of a graph are well known for over 35 years. However, these algorithms are quite involved and recent publications still try to give simpler linear-time tests.
Schmidt, Jens M.
core +1 more source
Ultra‐narrow green multi‐resonance thermally activated delayed fluorescence emitters have been developed by linear π‐extension strategy using tetracyclic naphtho[2,3‐b]benzofuran unit. The resulting phosphorescence‐sensitized OLEDs achieve a maximum external quantum efficiency of 37.7% in the bottom‐emitting architecture, while the complementary top ...
Eo Jin Jeon +7 more
wiley +1 more source
I give a self-contained exposition of a linear-time planarity algorithm of Shih and ...
Robin Thomas
core
Constrained Planarity Algorithms in Theory and Practice
In the constrained planarity setting, we ask whether a graph admits a crossing-free drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity ...
Fink, Simon Dominik
core +1 more source
A sequential dual‐alignment strategy independently programs the orientation of conductive metal‐organic framework (c‐MOF) microrods and liquid crystals within a composite film. This approach creates an asymmetric bilayer structure that enables precise, multi‐responsive actuation.
Taegyun Hong +5 more
wiley +1 more source
Graph Planarity Testing Algorithms
Navedeni kriteriji planarnosti grafa. Naveden popis postojećih algoritama za testiranje. Analizirani i implementirani Demoucronov algoritam kvadratne vremenske složenosti i vertex addition algoritam linearne vremenske složenosti.
Vranjić, Ivan
core
Pressure‐Assisted Dimensional Transformation of 2D Hydrogenated Borophene into 0D Boron Quantum Dots
Hydrogenated borophene (HB) is transformed into distinct boron nanostructures through a solvent‐free thermal process. Under flowing nitrogen, hydrogen escape promotes reconstruction into B2O3 nanoplatelets, whereas hydrogen‐induced pressure under sealed conditions facilitates fragmentation into boron quantum dots.
Ozden Gunes Yildiz +11 more
wiley +1 more source

