Publication:3113682

DOI10.4230/LIPIcs.STACS.2011.177zbMath1230.68092arXiv1012.4701MaRDI QIDQ3113682

Hans L. Bodlaender, Bart M. P. Jansen

Publication date: 23 January 2012

Full work available at URL: https://arxiv.org/abs/1012.4701

zbMATH Keywords

lower bounds; parameterized complexity; kernelization

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)