A knockout (or single-elimination) tournament is a format of competition that very popular in practice (particularly sports, elections and decision making), which has been extensively intensively studied from theoretical point view for more than decade. Particular attention devoted to the Tournament Fixing problem, where, roughly speaking, objective determine whether we can conduct way makes ou...

We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T , this problem asks if it is possible to delete characters from T to obtain P . Since even the unary version of APS is NP-hard, we used the framework of parameterized complexity, focusing on a parameterization of this problem where the parameter is the number of deletions ...

Topological (2D) Fuzzy Pharmacophore Triplets (2DFPT), using the number of interposed bonds to measure separation between the atoms representing pharmacophore types, were employed to establish and validate Quantitative Structure-Activity Relationships (QSAR). Thirteen data sets for which state-of-the-art QSAR models were reported in literature were revisited in order to benchmark 2D-FPT biologi...

We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of graphs that exclude Ki,j as a subgraph, for any fixed i, j ≥ 1. This strictly includes every class of graphs for which this problem has been previously shown to have FPT algorithms and/or polynomial kernels. In particular, our result implies that the problem restricted to bo...

We present an almost complete classification of the parameterized complexity of all operator fragments of the satisfiability problem in computation tree logic CTL. The investigated parameterization is the sum of temporal depth and structural pathwidth. The classification shows a dichotomy between W[1]-hard and fixed-parameter tractable fragments. The only real operator fragment which is confirm...

A parameterized problem hL; ki belongs to W [t] if there exists k computed from k such that hL; ki reduces to the weight-k satis ability problem for weft-t circuits. We relate the fundamental question of whether the W [t] hierarchy is proper to parameterized problems for constant-depth circuits. We de ne classes G[t] as the analogues of AC depth-t for parameterized problems, and N [t] by weight...

Klinikte fonksiyonel performans testleri (FPT) (örneğin atlama, denge vb.), genellikle fizyoterapistler ve spor bilimciler tarafından bir sporcunun performansını, yaralanma risk profilini, sonrası durumunu, rehabilitasyon sürecini spora geri dönmeye hazır olup olmadığını belirlemek için kullanılır. FPT yalnızca fiziksel performansı ölçmekle sınırlandırılmıştır. Oysaki aktiviteleri sadece perfor...