Parameterized exact computation first (2 résultats)

Etat : good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction.- Online Problems, Pathwidth, and Persistence.- Chordless Paths Through Three Vertices.- Computing Small Search Numbers in Linear Time.- Bounded Fixed-Parameter Tractability: The Case 2poly( k).- Refined Memorisation for Vertex Cover.- Parameterized Graph Separation Problems.- Parameterized Coloring Problems on Chordal Graphs.- On Decidability of MSO Theories of Representable Matroids.- On Miniaturized Problems in Parameterized Complexity Theory.- Smaller Kernels for Hitting Set Problems of Constant Arity.- Packing Edge Disjoint Triangles: A Parameterized View.- Looking at the Stars.- Moving Policies in Cyclic Assembly-Line Scheduling.- A Structural View on Parameterizing Problems: Distance from Triviality.- Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable.- Simplifying the Weft Hierarchy.- The Minimum Weight Triangulation Problem with Few Inner Points.- A Direct Algorithm for the Parameterized Face Cover Problem.- On Finding Short Resolution Refutations and Small Unsatisfiable Subsets.- Parameterized Algorithms for Feedback Vertex Set.- Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms.- Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments.- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover.- Space and Time Complexity of Exact Algorithms: Some Open Problems.- Practical FPT Implementations and Applications. …