STACS 2005
From MaRDI portal
Publication:5710681
DOI10.1007/b106485zbMath1118.68506OpenAlexW4230940848MaRDI QIDQ5710681
Henning Fernau, Ge Xia, Iyad A. Kanj, Jian'er Chen
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Parameterized dominating set problem in chordal graphs: Complexity and lower bound ⋮ Experiments on data reduction for optimal domination in networks ⋮ Subexponential parameterized algorithms ⋮ Vertex and edge covers with clustering properties: Complexity and algorithms ⋮ On problems without polynomial kernels
This page was built for publication: STACS 2005
