Results 71 to 80 of about 150,456 (276)
The Parameterized Complexity of Centrality Improvement in Networks
, 2017 The centrality of a vertex v in a network intuitively captures how important v is for communication in the network. The task of improving the centrality of a vertex has many applications, as a higher centrality often implies a larger impact on the ...
A Boral +19 more
core +1 more source
On Parameterized Exponential Time Complexity
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Jianer, Kanj, Iyad A., Xia, Ge
openaire +1 more source
A Lightweight Procedural Layer for Hybrid Experimental–Computational Workflows in Materials Science
Advanced Engineering Materials, EarlyView.We unveil a prototype hybrid‐workflow framework that fuses automatedcomputation with hands‐on experiments. Built atop pyiron, a lightweight, parameterized layer translates procedure descriptions into executable manual steps, syncing instrument settings, human interventions, and data capture in real‐time today.
Steffen Brinckmann +8 more
wiley +1 more source
Ural Mathematical Journal, 2016 The Hitting Set Problem (HSP) is the well known extremal problem adopting research interest in the fields of combinatorial optimization, computational geometry, and statistical learning theory for decades.
Daniel M. Khachay, Michael Yu. Khachay
doaj +1 more source
Control of Polarization and Polar Helicity in BiFeO3 by Epitaxial Strain and Interfacial Chemistry
Advanced Functional Materials, EarlyView.In BiFeO3 thin films, the interplay of interfacial chemistry, electrostatics, and epitaxial strain is engineered to stabilize homohelicity in polarization textures at the domain scale. The synergistic use of a Bi2O2‐terminated Aurivillius buffer layer and a highly anisotropic compressive epitaxial strain offers new routes to control the polar‐texture ...
Elzbieta Gradauskaite +5 more
wiley +1 more source
Approximation and Parameterized Complexity of Minimax Approval Voting
, 2016 We present three results on the complexity of Minimax Approval Voting. First, we study Minimax Approval Voting parameterized by the Hamming distance $d$ from the solution to the votes. We show Minimax Approval Voting admits no algorithm running in time $\
Cygan, Marek +3 more
core +1 more source
Predicting Atomic Charges in MOFs by Topological Charge Equilibration
Advanced Functional Materials, EarlyView.An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi +2 more
wiley +1 more source
Magnetic Force Microscopy Signatures of Higher‐Order Skyrmions and Antiskyrmions
Advanced Functional Materials, EarlyView.Magnetic force microscopy operated under vacuum conditions enables the qualitative identification of higher‐order skyrmions and antiskyrmions in Co/Ni multilayers at room temperature. Distinct stray‐field contrast signatures arise from vertical Bloch lines and complex domain‐wall configurations.
Sabri Koraltan +8 more
wiley +1 more source
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability
Algorithms, 2012 The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph has been recently introduced in literature, motivated by applications in social network analysis.
Yuri Pirola +2 more
doaj +1 more source
On the complexity of computing the $k$-restricted edge-connectivity of a graph
, 2016 The \emph{$k$-restricted edge-connectivity} of a graph $G$, denoted by $\lambda_k(G)$, is defined as the minimum size of an edge set whose removal leaves exactly two connected components each containing at least $k$ vertices.
A Holtkamp +20 more
core +1 more source