Results 91 to 100 of about 30,269 (267)
Advanced Functional Materials, EarlyView.This study advances SafeWax, a bio‐inspired, fatty‐acids‐based superhydrophobic coating, by identifying an agriculturally compliant solvent and revealing how solvent‐controlled Fatty acid crystallization governs the coating's microscopic structure and performance.
Niv Ben‐Arie +13 more
wiley +1 more source
Advanced Functional Materials, EarlyView.A gas‐fed, zero‐gap, PEM CO2 electrolyzer is realized by incorporating PDDA+ ions onto the carbonaceous Co/N‐C electrocatalyst, with gaseous H2 and CO2 fed into the anode and cathode, respectively. Operating without an aqueous electrolyte, the system sustains a peak FECO of 65.1% at 100 mA cm−2. ABSTRACT Electrochemical carbon dioxide reduction (ECO2R)
Yuen Leong Chow +6 more
wiley +1 more source
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elaine M. Eschen +2 more
openaire +1 more source
Journal of Graph Algorithms and Applications, 2017 We introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular grid, such that each row and column of the grid supports exactly one node.
David Auber +3 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Cell therapies typically rely on cold‐chain logistics and cryopreservation, limiting access and compromising cell quality. Here, a dual‐chamber device separates an oxygen‐supplying chamber from a hyaluronic acid cargo chamber, sustaining oxygen delivery for over 70 h and enabling ambient‐temperature shipment.
Daniel A. Domingo‐Lopez +9 more
wiley +1 more source
International Joint Conference on Autonomous Agents and Multiagent SystemsWe study the computational complexity of the map redistricting problem (gerrymandering). Mathematically, the electoral district designer (gerrymanderer) attempts to partition a weighted graph into k connected components (districts) such that its candidate (party) wins as many districts as possible. Prior work has principally concerned the special cases
Dippel, J. +4 more
openaire +5 more sources
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
Journal of Graph Algorithms and Applications, 2016 Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is a drawing of the two graphs where each graph is drawn planar, no two edges overlap, and edges of one graph can cross edges of the other graph only ...
Michael Bekos +3 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Advanced ink systems for solution‐processed textile triboelectric nanogenerators are systematically summarized, spanning conductive, tribo‐negative, and tribo‐positive layers. By connecting ink chemistry, deposition methods, and device function, the present review reveals the key governing principles of solution development and highlights practical ...
Xinlong Sun, Stephen Beeby
wiley +1 more source
On the Synthesis of Planar Graphs with Given Properties
Кібернетика та комп'ютерні технологіїThe problem of studying the structural properties of planar subgraphs G\v, where v is an arbitrary vertex of a graph G of undirected genus, is considered, using cell chains that connect limit cycles with points of a given set M of the graph G\v.
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj +1 more source
1-Planarity of Graphs with a Rotation System
Journal of Graph Algorithms and Applications, 2015 A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and for near-planar graphs in which an edge is added to a planar
Christopher Auer +3 more
doaj +1 more source