SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257zbMath1175.68193OpenAlexW2756057450MaRDI QIDQ5897978

Rolf Niedermeier, Jochen Alber, Britta Dorn

Publication date: 14 November 2006

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Regularized mixed variational-like inequalities ⋮ Parameterized algorithmics for linear arrangement problems ⋮ The parameterized complexity of the induced matching problem ⋮ Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor

This page was built for publication: SOFSEM 2006: Theory and Practice of Computer Science