A recent trend in parameterized algorithms is the application of polytope tools to FPT algorithms (e.g., Cygan et al., 2011; Narayanaswamy et al., 2012). Although this approach has yielded significant speedups for a range of important problems, it requires the underlying polytope to have very restrictive properties, including half-integrality and Nemhauser-Trotter-style persistence properties. ...

A minimization problem is called fixed parameter ρinapproximable, for a function ρ ≥ 1, if there does not exist an algorithm that given a problem instance I with optimum value opt and an integer k, either finds a feasible solution of value at most ρ(k) ·k or finds a certificate that k < opt in time t(k) · |I| for some function t. For maximization problem the definition is similar. We motivate t...

This study presents the results of T. mentagrophytes inoculation in the cheek pouch of the hamster, an immunologically privileged site. Forty two animals were used: 21 inoculated with 10(6) fungi in the cheek pouch (group 1) and 21 inoculated initially with 10(6) fungi in the foot pad and 15 days later in the cheek pouch, with the same amount of fungi (group 2). Animals were sacrificed at 20 ho...

In the context of CSPs, a strong backdoor is a subset of variables such that every complete assignment yields a residual instance guaranteed to have a specified property. If the property allows efficient solving, then a small strong backdoor provides a reasonable decomposition of the original instance into easy instances. An important challenge is the design of algorithms that can find quickly ...

Path-width of matroids naturally generalizes better known path-width of graphs, and is NP-hard by a reduction from the graph case. While the term matroid path-width was formally introduced by Geelen–Gerards–Whittle [JCTB 2006] in pure matroid theory, it was soon recognized by Kashyap [SIDMA 2008] that it is the same concept as long-studied so called trellis complexity in coding theory, later na...

Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one way of obtaining strongly uniform FPT algorithms, but that all of FPT may be captured in this way. Our new characterization of FPT has a strong connection to...

Following colostrum management training, a randomized field trial was conducted on a California dairy to determine the effect of supplementing pooled colostrum with either colostrum-derived replacer (CDR) or second-milking colostrum (transition milk) on failure of passive transfer (FPT) and preweaning morbidity risks. A total of 166 calves were randomly assigned to 4L first-milking pooled colos...

We study the parameterized complexity of several NP-Hard graph completion problems: The MINIMUM FILL-IN problem is to decide if a graph can be triangulated by adding at most k edges. We develop an O(k 5 mn + f(k)) algorithm for the problem on a graph with n vertices and m edges. In particular, this implies that the problem is xed parameter tractable (FPT). PROPER INTERVAL GRAPH COMPLETION probl...

We study the complexity of a group of distance-constrained graph labeling problems when parameterized by the neighborhood diversity (nd), which is a natural graph parameter between vertex cover and clique width. Neighborhood diversity has been used to generalize and speed up FPT algorithms previously parameterized by vertex cover, as is also demonstrated by our paper. We show that the Uniform C...

Clustering with outliers is one of the most fundamental problems in Computer Science. Given a set X n points and two numbers k m, clustering aims to exclude m from X, partition remaining into clusters that minimizes certain cost function. In this paper, we give general approach for solving outliers, which results fixed-parameter tractable (FPT) algorithm (i.e., an running time form f(k, m) * po...