Titlebook: Parameterized and Exact Computation; 9th International Sy Marek Cygan,Pinar Heggernes Conference proceedings 2014 Springer International Pu

CANT

Gregory Gutin,Stefan Kratsch,Magnus Wahlström Inhalt des Werkes werden die architektonischen Kerngedanken ihres ”Bauplans“ für die Physik vor dem Hintergrund der Newtonschen Herausforderung des . vorgestellt und analysiert. Im deutlichen Bruch zu Newton erachtete du Châtelet Hypothesen als ein unverzichtbares Werkzeug und Hilfsmittel der Wisse

Intervention

gastritis

Goblet-Cells

On Polynomial Kernelization of ,-,,y induced copy of .. In [.], it is shown that the problem is fixed-parameter tractable if . is of finite cardinality. However, it is proved in [.] that if . is a singleton set containing ., for a large class of ., there exists no polynomial kernel unless .. In this paper, we present a polynomial ker

冲突

Solving Linear Equations Parameterized by Hamming Weight,parameterized complexity of these problems with . as parameter. A special aspect of our study is to show how the maximum multiplicity . of variable occurrences in . influences the complexity of the problem. We show a sharp dichotomy: for each . the first two problems are .-hard (which strengthens an

平

The Role of Planarity in Connectivity Problems Parameterized by Treewidth,arse graph classes, where . stands for the treewidth of the .-vertex input graph. This was recently disproved by Cygan .. [FOCS 2011], Bodlaender .. [ICALP 2013], and Fomin .. [SODA 2014], who provided single-exponential algorithms on general graphs for most connectivity problems that were known to

Opponent

空洞

The ,-Distinct Language: Parameterized Automata Constructions,n the .. language ., defined as the set of words of length . whose symbols are all distinct. This language is implicitly related to several breakthrough techniques, developed during the last two decades, to design parameterized algorithms for fundamental problems such as .. and ..... Building upon t

费解

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration,dified into . by recoloring vertices one at a time, while maintaining a .-coloring throughout and using at most . such recoloring steps? This problem is weakly PSPACE-hard for every constant .. We show that the problem is also strongly NP-hard for every constant . and W[1]-hard (but in XP) when para

bleach

Quantified Conjunctive Queries on Partially Ordered Sets,connective) is true in a finite poset (a reflexive, antisymmetric, and transitive directed graph). We prove that the problem is already .-hard on a certain fixed poset, and investigate structural properties of posets yielding fixed-parameter tractability when the problem is parameterized by the quer