Results 61 to 70 of about 5,303 (261)

Hitting long directed cycles is fixed-parameter tractable

open access: yesCoRR, 2020
In the Directed Long Cycle Hitting Set} problem we are given a directed graph $G$, and the task is to find a set $S$ of at most $k$ vertices/arcs such that $G-S$ has no cycle of length longer than $\ell$. We show that the problem can be solved in time $2^{\mathcal O(\ell k^3\log k + k^5\log k\log\ell)}\cdot n^{\mathcal O(1)}$, that is, it is fixed ...
Alexander Göke   +2 more
openaire   +7 more sources

Finding topological subgraphs is fixed-parameter tractable [PDF]

open access: yesProceedings of the forty-third annual ACM symposium on Theory of computing, 2011
We show that for every fixed undirected graph $H$, there is a $O(|V(G)|^3)$ time algorithm that tests, given a graph $G$, if $G$ contains $H$ as a topological subgraph (that is, a subdivision of $H$ is subgraph of $G$). This shows that topological subgraph testing is fixed-parameter tractable, resolving a longstanding open question of Downey and ...
Martin Grohe   +3 more
openaire   +3 more sources

Trions as Fundamental Species in Chemically Doped Polymer Semiconductors

open access: yesAdvanced Materials, EarlyView.
This work shows that exciton–charge carrier coupling in doped polymer semiconductors gives rise to multi‐particle states, including trions—quasiparticles consisting of two holes and one electron under p‐doping—and bound exciton‐hole pairs, as identified through spectroscopic and theoretical analysis.
Hongmo Li   +23 more
wiley   +1 more source

Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

open access: yesJournal of Graph Algorithms and Applications
In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$, where the number of bends on such polylines is typically restricted in some way.
Cornelius Brand   +3 more
doaj   +1 more source

Unit Interval Editing is Fixed-Parameter Tractable [PDF]

open access: yesInformation and Computation, 2015
Given a graph~$G$ and integers $k_1$, $k_2$, and~$k_3$, the unit interval editing problem asks whether $G$ can be transformed into a unit interval graph by at most $k_1$ vertex deletions, $k_2$ edge deletions, and $k_3$ edge additions. We give an algorithm solving this problem in time $2^{O(k\log k)}\cdot (n+m)$, where $k := k_1 + k_2 + k_3$, and $n, m$
openaire   +4 more sources

Mechanical Mapping of Thin Elastic Films and Living Cells With Spherical Tip Atomic Force Microscopy Probes at Large Indentations

open access: yesAdvanced Materials Interfaces, EarlyView.
A new explicit semi‐analytical model for elasticity determination by AFM is presented using spherical probes. The model, validated with numerical simulations, is applied to the study of polyacrylamide hydrogel films and macrophage cells, showing excellent agreement with the experimental data. It is foreseen its wide applicability to obtain quantitative
Gabriel Gomila   +9 more
wiley   +1 more source

A U‐shaped Microfluidic Platform for Culturing Vascularized Colorectal Cancer Spheroids Reveals Tumor–Endothelial Crosstalk and Invasion‐Associated Remodeling

open access: yesAdvanced Materials Technologies, EarlyView.
A closed U‐shaped microfluidic platform symmetrically embeds a single, size‐controlled HT29 colorectal cancer spheroid within a GFP‐HUVEC‐laden fibrin matrix. HT29 spheroids are associated with hyper‐branched endothelial network remodeling, while vascularized co‐culture is accompanied by anisotropic protrusive growth and EMT‐like marker changes in the ...
G. Cretti   +4 more
wiley   +1 more source

Parameterized algorithms for block-structured integer programs with large entries [PDF]

open access: yesTheoretiCS
We study two classic variants of block-structured integer programming. Two-stage stochastic programs are integer programs of the form $\{A_i \mathbf{x} + D_i \mathbf{y}_i = \mathbf{b}_i\textrm{ for all }i=1,\ldots,n\}$, where $A_i$ and $D_i$ are bounded ...
Jana Cslovjecsek   +4 more
doaj   +1 more source

Modification to Planarity is Fixed Parameter Tractable.

open access: yes, 2019
A replacement action is a function L that maps each k-vertex labeled graph to another k-vertex graph. We consider a general family of graph modification problems, called L-Replacement to C, where the input is a graph G and the question is whether it is possible to replace in G some k-vertex subgraph H of it by L(H) so that the new graph belongs to the ...
Fedor V. Fomin   +2 more
openaire   +4 more sources

Programmable Variable‐Stiffness Multilayer Elastomer Composites With High‐Aspect‐Ratio Low‐Melting‐Point Alloy Inclusions

open access: yesAdvanced Materials Technologies, EarlyView.
High‐aspect‐ratio low‐melting‐point alloy inclusions are embedded within multilayer silicone laminates to create thermally programmable stiffness. Sequential activation of alloy‐rich layers produces four distinct mechanical states and reconfigures tendon‐driven actuator trajectories under the same load.
Palpolage Don Shehan Hiroshan Gunawardane   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy