A specific mechanism for the intracellular translocation of nonvesicle-associated proteins is proposed. This movement machinery is based on the assumption that the cytoskeleton represents an interconnected network of filamentous macromolecules, which extends over the entire cytoplasm. Diffusion along the filaments provides an efficient way for movement and with this, for signal transduction, be...

In this experimental study we evaluate the performance of a recent fixed parameter tractable (FPT) algorithm for the directed feedback node set problem (DFVS) by Chen et al. Lacking suitable real world data, all tests are performed on random graphs. To speed up the FPT algorithm we propose several new data reduction rules for DFVS, and then use various heuristics to accelerate the FPT search. O...

BACKGROUND Several studies suggest the association of specific language impairment (SLI) to deficits in auditory processing. It has been evidenced that children with SLI present deficit in brief stimuli discrimination. Such deficit would lead to difficulties in developing phonological abilities necessary to map phonemes and to effectively and automatically code and decode words and sentences. H...

The Workflow Satisfiability Problem (WSP) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by business rules. We are required to decide whether there exists a plan – an assignment of tasks to authorized users – such that all constraints are satisfied. It is natural to see the WSP as a subclass of the Constrain...

A classic result of Lenstra [Math. Oper. Res. 1983] says that an integer linear program can be solved in fixed-parameter tractable (FPT) time for the parameterization by the number of variables. We extend this result by incorporating piecewise linear convex or concave functions to our (mixed) integer programs. This general technique allows us to analyze the parameterized complexity of a number ...

The k-Even Set problem is a parameterized variant of theMinimum Distance Problem of linear codes over F2, which can be stated as follows: given a generator matrix A and an integer k, determine whether the code generated by A has distance at most k. Here, k is the parameter of the problem. The question of whether k-Even Set is fixed parameter tractable (FPT) has been repeatedly raised in literat...

Lubiw showed that several variants of Graph Isomorphism are NPcomplete, where the solutions are required to satisfy certain additional constraints [14]. One of these, called Isomorphism With Restrictions, is to decide for two given graphs X1 = (V,E1) and X2 = (V,E2) and a subset R ⊆ V × V of forbidden pairs whether there is an isomorphism π from X1 to X2 such that i π 6= j for all (i, j) ∈ R. W...

Edge k-Clique Partition (k-ECP) is the problem of dividing the edge set of an undirected graph into a set of at most k edgedisjoint cliques, where k ≥ 1 is an input parameter. The problem is NP-hard but in FPT. We propose several improved FPT algorithms for k-ECP on K4-free graphs, planar graphs, and cubic graphs.

In this work, we study the socially fair k-median/k-means problem. We are given a set of points P in metric space X with distance function d(.,.). There ℓ groups: P1,…,Pℓ⊆P. also F feasible centers X. The goal k-median problem is to find C⊆F k that minimizes maximum average cost over all groups. That is, C objective Φ(C,P)≡maxj⁡{∑x∈Pjd(C,x)/|Pj|}, where d(C,x) x closest center C. k-means define...