Results 51 to 60 of about 19,138 (262)

Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue

open access: yesAlgorithms, 2016
We briefly report on the national workshops on Formal Languages and Automata Theory as well as on Algorithms and Complexity Theory held in early Autumn, 2015.
Henning Fernau
doaj   +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

On the Parameterized Complexity of Reconfiguration Problems [PDF]

open access: yesAlgorithmica, 2013
We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem $Q$ takes as input two feasible solutions $S$ and $T$ and determines if there is a sequence of {\em reconfiguration steps} that can be applied to transform $S$ into $T$ such that each step results in a ...
Amer E. Mouawad   +4 more
openaire   +2 more sources

Refinement of amino‐acid conformation vs. difference density maps in time‐resolved serial femtosecond crystallography data analysis

open access: yesFEBS Open Bio, EarlyView.
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong   +3 more
wiley   +1 more source

On the Parameterized Complexity of Pooling Design [PDF]

open access: yesJournal of Computational Biology, 2009
Pooling design is a very helpful tool for reducing the number of tests in DNA library screening, which is a key process to obtain high-quality DNA libraries for studying gene functions. Three basic problems in pooling design are, given an m x n binary matrix and a positive integer d, to decide whether the matrix is d-separable (d-separable, or d ...
Yongxi Cheng   +3 more
openaire   +2 more sources

Variable Stiffness Flexure Structures Enabled by Phase‐Change Gallium and Adhesive Interfacial Locking for Soft Robotic Applications

open access: yesAdvanced Engineering Materials, EarlyView.
A flexure‐based variable stiffness structure is developed by integrating phase‐change modulation and adhesive interfacial locking of gallium. The design enables a wide stiffness variability, transitioning from soft, flexible behavior to rigid, load‐supporting performance.
Sungjin Kim   +2 more
wiley   +1 more source

Parameter Ecology for Feedback Vertex Set

open access: yesTsinghua Science and Technology, 2014
This paper deals with the Feedback Vertex Set problem on undirected graphs, which asks for the existence of a vertex set of bounded size that intersects all cycles.
Bart M. P. Jansen   +2 more
doaj   +1 more source

A Lightweight Procedural Layer for Hybrid Experimental–Computational Workflows in Materials Science

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

Modeling Dislocation Cutting of γ′ Precipitates in Ni‐Base Superalloys: Linking Atomistic and Dislocation Dynamics Simulations

open access: yesAdvanced Engineering Materials, EarlyView.
Dislocation cutting of γ′ precipitates in Ni‐based superalloys is investigated by linking atomistic simulations with discrete dislocation dynamics. The critical cutting stress is shown to be governed by the antiphase boundary energy, while line tension effects promote edge‐preferred cutting.
Frédéric Houllé   +9 more
wiley   +1 more source

Social Choice Meets Graph Drawing: How to Get Subexponential Time Algorithms for Ranking and Drawing Problems

open access: yesTsinghua Science and Technology, 2014
We analyze a common feature of p-Kemeny AGGregation (p-KAGG) and p-One-Sided Crossing Minimization (p-OSCM) to provide new insights and findings of interest to both the graph drawing community and the social choice community.
Henning Fernau   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy