Parameterized and Exact Computation

DOI10.1007/b100584zbMath1104.68516OpenAlexW2475962691MaRDI QIDQ5311519

No author found.

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100584

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) General topics in the theory of algorithms (68W01)

Related Items

A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing ⋮ The control complexity of \(r\)-Approval: from the single-peaked case to the general case ⋮ Polynomial kernels for proper interval completion and related problems ⋮ Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization ⋮ A parameterized algorithm for subset feedback vertex set in tournaments ⋮ Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters ⋮ Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems ⋮ Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs ⋮ Exact algorithms for restricted subset feedback vertex set in chordal and split graphs ⋮ What Is Known About Vertex Cover Kernelization? ⋮ Crown reductions for the minimum weighted vertex cover problem ⋮ Inclusion/exclusion meets measure and conquer ⋮ Improved upper bounds for vertex cover ⋮ Kernels for packing and covering problems ⋮ Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems ⋮ Linear kernelizations for restricted 3-Hitting Set problems ⋮ Hitting Forbidden Minors: Approximation and Kernelization ⋮ Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting ⋮ Iterative Compression for Exactly Solving NP-Hard Minimization Problems ⋮ Cluster Editing in Multi-Layer and Temporal Graphs. ⋮ Improved parameterized set splitting algorithms: A Probabilistic approach