Results 91 to 100 of about 29,342 (268)

Intrinsic Photoactive Star ZnPc–Poly(glutamate) Nanoplatforms for Multimodal Glioblastoma Therapy and Brain‐Targeted Delivery

open access: yesAdvanced Functional Materials, EarlyView.
An intrinsic photoactive star‐shaped zinc phtalocyanine‐poly(L‐glutamic acid) (ZnPc‐PGA) nanoplatform for multimodal glioblastoma (GBM) therapy and brain‐targeted elivery. A ZnPc‐PGA‐based multifunctional theranostic nanocarrier platform enables image‐guided, multimodal GBM therapy. ZnPc‐PGA nanocarriers support the integration of fluorescence imaging,
Amina Benaicha‐Fernández   +14 more
wiley   +1 more source

Flips in planar graphs

open access: yesComputational Geometry, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prosenjit Bose, Ferran Hurtado
openaire   +1 more source

Structure‐Guided Dynamical Mechanics in Bioinspired Double Twisted Laminated Thin Films

open access: yesAdvanced Functional Materials, EarlyView.
This work explores a dynamic mechanistic study of crack propagation and puncture testing via real‐time monitoring of crack initiation, propagation, and termination through nature‐inspired single and double twisted architectures fabricated from cellulose nanocrystals.
Justin Brackenridge   +4 more
wiley   +1 more source

From Geometry to Function: Programmable Mechanical Response in 3D‐Printed Adipose‐Inspired Soft Metamaterials

open access: yesAdvanced Functional Materials, EarlyView.
Geometry‐driven design of soft cellular metamaterials is systematically investigated by combining experiments, finite element modeling, and statistical prediction. The study quantifies how unit cell geometry and material properties govern stiffness, instability, densification, and energy absorption.
Alice Berardo   +4 more
wiley   +1 more source

Decomposing a Planar Graph into Degenerate Graphs

open access: yesJournal of Combinatorial Theory, Series B, 1995
A graph \(G\) is \(k\)-degenerate if every subgraph of \(G\) has a vertex of degree less than \(k\). The author proves that the vertex set of any planar graph can be decomposed into two sets such that one of them induces a 3-degenerate graph and the other induces a 2-degenerate graph.
openaire   +2 more sources

Biodegradable and Biocompatible Functional Polymers for Biomedical Applications

open access: yesAdvanced Functional Materials, EarlyView.
Biodegradable and biocompatible functional polymers integrate electrical, mechanical, and stimuli‐responsive functionalities while enabling programmed degradation under physiological conditions. This review introduces recent advances in conductive, shape‐memory, self‐healing, photocurable, and adhesive polymer systems, emphasizing material design ...
Won Bae Han   +5 more
wiley   +1 more source

OOPS: Optimized One-Planarity Solver via SAT

open access: yesJournal of Graph Algorithms and Applications
We present OOPS (Optimized One-Planarity Solver), a practical heuristic for recognizing 1-planar graphs and several important subclasses. A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once---a natural ...
Sergey Pupyrev
doaj   +1 more source

Catalytically Enhanced Near Room‐Temperature Hydrogen Sensing Using Pd‐ZnO Colloidal Crystals

open access: yesAdvanced Functional Materials, EarlyView.
Pd‐decorated ZnO colloidal crystal monolayers demonstrate excellent performance across a wide hydrogen concentration range at 33°C, with high selectivity and reproducible device fabrication. The sensors show strong responses even at low‐ppm H2 concentrations and an ultra‐low detection limit of 82 ppb, indicating their suitability for diverse hydrogen ...
Hamidah Alluhaybi   +13 more
wiley   +1 more source

Pathwidth of 2-Layer k-Planar Graphs

open access: yesComputing in Geometry and Topology
A bipartite graph G = (X ∪ Y, E) is a 2-layer k-planar graph if it admits a drawing on the plane such that the vertices in X and Y are placed on two parallel lines respectively, edges are drawn as straight-line segments, and every edge involves at most ...
Yuto Okada
doaj   +1 more source

Recognizing IC-Planar and NIC-Planar Graphs

open access: yesJournal of Graph Algorithms and Applications, 2018
We prove that triangulated IC-planar graphs and triangulated $K_5$-free or $X4W$-free NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge.
Franz Brandenburg
doaj   +1 more source

Home - About - Disclaimer - Privacy