Results 51 to 60 of about 28,812 (264)

Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows

Advanced Engineering Materials, EarlyView.
A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba, Sang‐Hyeok Lee, Christina Gasper, Martina Freund, Sandra Korte‐Kerzel, Ulrich Kerzel   +5 more
wiley   +1 more source

1-planarity of complete multipartite graphs

Discrete Applied Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Július Czap, Dávid Hudák
openaire   +2 more sources

Tailoring Functional Properties of Ti–Ni–Cu Shape Memory Alloy Thin Films for MEMS Actuators

Advanced Engineering Materials, EarlyView.
A comprehensive study of critical parameters required to develop well‐performing Ti–Ni–Cu thin film shape memory alloy microactuators is provided. Materials science and device integration aspects are integrated by addressing structural and physical relationships using complementary characterization techniques as well as a practical fabrication solution
Elaheh Akbarnejad, Aleksander Kostka, Gowtham Arivanandhan, Yujiao Li, Alan Savan, Manfred Kohl, Alfred Ludwig   +6 more
wiley   +1 more source

The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings

AKCE International Journal of Graphs and Combinatorics
A graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices
Guiping Wang
doaj   +1 more source

Improvements on the density of maximal 1‐planar graphs [PDF]

Journal of Graph Theory, 2017
AbstractA graph is 1‐planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1‐planar drawing is called 1‐plane. A graph is maximal 1‐planar (1‐plane), if we cannot add any missing edge so that the resulting graph is still 1‐planar (1‐plane). Brandenburg et al.
János Barát, Géza Tóth 0001
openaire   +4 more sources

Recycling of NiTi Shape Memory Alloys: Fundamental and Technological Aspects of a Vacuum Induction Melting Processing Route

Advanced Engineering Materials, EarlyView.
The present study investigates recycling of NiTi shape memory alloys via vacuum induction melting. An ingot was synthesized from elemental Ni and Ti and subjected to three subsequent remelting cycles. Remelting increases process durations and impurity levels and adversely affects microstructures and functional properties.
Sakia Sophia Noorzayee, Son Tung Mai, Sarath Menon, Braulio Gadiel Sánchez Ortega, Ralf Drautz, Alexander Kauffmann, Gunther Eggeler, Jan Frenzel   +7 more
wiley   +1 more source

Graph Stories in Small Area

Journal of Graph Algorithms and Applications, 2020
We study the problem of drawing a dynamic graph, where each vertex appears in the graph at a certain time and remains in the graph for a fixed amount of time, called the window size.
Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani   +4 more
doaj   +1 more source

The Basis Number of 1-Planar Graphs

Annals of Combinatorics
Let $B$ be a set of Eulerian subgraphs of a graph $G$. We say $B$ forms a $k$-basis if it is a minimum set that generates the cycle space of $G$, and any edge of $G$ lies in at most $k$ members of $B$. The basis number of a graph $G$, denoted by $b(G)$, is the smallest integer such that $G$ has a $k$-basis. A graph is called 1-planar (resp.
Saman Bazargani, Therese Biedl, Prosenjit Bose, Anil Maheshwari, Babak Miraftab   +4 more
openaire   +2 more sources

On properties of maximal 1-planar graphs

Discussiones Mathematicae Graph Theory, 2012
Department of Mathematics, Faculty of ScienceNiigata University8050, Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-2181, Japane-mail: y-suzuki@math.sc.niigata-u.ac.jpAbstractA graph is called 1-planar if there exists a drawing in the plane so thateach edge contains at most one crossing.
Dávid Hudák, Tomás Madaras, Yusuke Suzuki   +2 more
openaire   +1 more source

Workflow for Design of Experiments‐Based Modeling of Species Transport and Growth Kinetics in GaN Hydride Vapor Phase Epitaxy

Advanced Engineering Materials, EarlyView.
A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič, G. Lukin, H. Torkashvand, A. Kerschbaum, M. Müller, S. Besendörfer, J. Heitmann, J. Friedrich   +7 more
wiley   +1 more source