Results 71 to 80 of about 1,864,097 (296)

Parameterized Valiant’s Classes [PDF]

open access: yes, 2019
We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate reductions and ...
Bläser, Markus, Engels, Christian
core   +1 more source

An Integrated Oxygen‐Supplying Device and Predictive Multiphysics Model for Extended Ambient Transport of Insulin‐Producing Cells

open access: yesAdvanced 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

Parameterized Complexity of Sparse Linear Complementarity Problems [PDF]

open access: yes, 2015
In this paper, we study the parameterized complexity of the linear complementarity problem (LCP), which is one of the most fundamental mathematical optimization problems.
Makino, Kazuhisa   +2 more
core   +1 more source

Parameterized Complexity of Simultaneous Planarity

open access: yes, 2023
Given $k$ input graphs $G_1, \dots ,G_k$, where each pair $G_i$, $G_j$ with $i \neq j$ shares the same graph $G$, the problem Simultaneous Embedding With Fixed Edges (SEFE) asks whether there exists a planar drawing for each input graph such that all drawings coincide on $G$.
Simon D. Fink   +2 more
openaire   +2 more sources

Thermodynamic Limits to Molecular Doping in Conjugated Polymers: A Perspective on Phase Behavior and Miscibility

open access: yesAdvanced Materials, EarlyView.
Molecular doping of conjugated polymers is fundamentally constrained by thermodynamic phase behavior. This Perspective reframes doping efficiency and stability in terms of miscibility limits, binodals, and solvus boundaries, highlighting the role of effective interaction parameters and charge transfer.
Somayeh Kashani   +10 more
wiley   +1 more source

The Parameterized Complexity Of Extending Stack Layouts

open access: yesJournal of Graph Algorithms and Applications
An $\ell$-page stack layout (also known as an $\ell$-page book embedding) of a graph is a linear order of the vertex set together with a partition of the edge set into $\ell$ stacks (or pages), such that the endpoints of no two edges on the same stack ...
Thomas Depian   +3 more
doaj   +1 more source

Improving Vertex Cover as a Graph Parameter [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however,
Robert Ganian
doaj   +1 more source

On the Parameterized Complexity of Clique Elimination Distance [PDF]

open access: yes, 2020
Bulian and Dawar [Algorithmica, 2016] introduced the notion of elimination distance in an effort to define new tractable parameterizations for graph problems and showed that deciding whether a given graph has elimination distance at most k to any minor ...
Agrawal, Akanksha, Ramanujan, M. S.
core   +1 more source

Organic Materials of Tomorrow: Horizons of Artificial Intelligence

open access: yesAdvanced Materials, EarlyView.
This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena   +3 more
wiley   +1 more source

Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey

open access: yesAlgorithms, 2019
Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science.
Robert Ganian, Sebastian Ordyniak
doaj   +1 more source

Home - About - Disclaimer - Privacy