Results 91 to 100 of about 149,306 (281)

Parameterized complexity of machine scheduling: 15 open problems

open access: yes, 2018
Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms.
Mnich, Matthias, van Bevern, René
core   +1 more source

Wound Geometry Determines Whether Aligned‐Fiber Scaffolds Accelerate or Impede Diabetic Wound Healing: A Biased Random Walk Analysis

open access: yesAdvanced Healthcare Materials, EarlyView.
Wound closure is governed by geometry‐orientation coupling: aligned fibers speed migration along their axis but hinder perpendicular advance. In vivo diabetic wound experiments with composition‐matched fibrin, combined with an anisotropic diffusion (biased random‐walk) model, quantify this trade‐off and generate a healing landscape.
Yin‐Yuan Huang   +13 more
wiley   +1 more source

Randomized Parameterized Algorithms for the Kidney Exchange Problem

open access: yesAlgorithms, 2019
In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries.
Mugang Lin   +3 more
doaj   +1 more source

Self‐Cooling Molecular Spin Qudits

open access: yesAdvanced Materials, EarlyView.
A material made of [GdEr] molecular dimers can encode a qudit and perform as a magnetic refrigerant. Microwave resonant pulses coherently manipulate its 16 spin states, while direct demagnetization measurements cool the material and a device down to temperatures below 1 K.
Elías Palacios   +12 more
wiley   +1 more source

Harnessing Chain Mobility via Protonation for Tough and Isotropic Hydrogel

open access: yesAdvanced Materials, EarlyView.
A protonation‐guided strategy enables ultra‐tough, isotropic PVA hydrogels by temporarily unlocking chain mobility via acidification and fixing homogeneous networks through salting‐out. The resulting materials simultaneously achieve high strength, extreme stretchability, and record‐level toughness, offering a generalizable route toward robust hydrogels
Pengju Shi   +14 more
wiley   +1 more source

Electric‐Current‐Assisted Nucleation of Zero‐Field Hopfion Rings

open access: yesAdvanced Materials, EarlyView.
This work reports a novel and efficient nucleation protocol for 3D localized topological magnetic solitons‐hopfion rings in chiral magnets using pulsed electric currents. By using Lorentz transmission electron microscopy and topological analysis, we report characteristic features and extraordinary stability of hopfion rings in zero or inverted external
Xiaowen Chen   +12 more
wiley   +1 more source

The Parameterized Complexity of Centrality Improvement in Networks

open access: yes, 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

Self‐Regulating Sodium‐Ion Battery Materials: From Phase Reconstruction to Functional Activation

open access: yesAdvanced Materials, EarlyView.
Self‐regulating sodium‐ion batteries hinge on programmable phase behavior in layered oxides, interphases that renew without growth, and electrolytes that steer solvation and chemistry. This review distills mechanisms into design rules that span composition, site and entropy tuning, and self‐buffering anodes, linking operando evidence to choices and ...
Hong Gao   +10 more
wiley   +1 more source

Searching and Indexing Genomic Databases via Kernelization

open access: yesFrontiers in Bioengineering and Biotechnology, 2015
The rapid advance of DNA sequencing technologies has yielded databases of thousands of genomes. To search and index these databases effectively, it is important that we take advantage of the similarity between those genomes.
Travis eGagie, Simon ePuglisi
doaj   +1 more source

Parameterized Complexity of Untangling Knots

open access: yesSIAM Journal on Computing
Deciding whether a diagram of a knot can be untangled with a given number of moves (as a part of the input) is known to be NP-complete. In this paper we determine the parameterized complexity of this problem with respect to a natural parameter called defect.
Legrand-Duchesne, Clément   +2 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy