Parameterized and Exact Computation
From MaRDI portal
Publication:5311505
DOI10.1007/b100584zbMath1104.68519OpenAlexW2475962691MaRDI QIDQ5311505
Naomi Nishimura, Dimitrios M. Thilikos, Prabhakar Ragde
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
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of algorithms (68W01)
Related Items (5)
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction ⋮ Polynomial kernels for 3-leaf power graph modification problems ⋮ Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints ⋮ Towards optimal and expressive kernelization for \(d\)-hitting set ⋮ A kernelization algorithm for \(d\)-hitting set
This page was built for publication: Parameterized and Exact Computation
