Publication:5389996
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2009.1843zbMath1236.68087MaRDI QIDQ5389996
Henning Fernau, Fedor V. Fomin, Saket Saurabh, Daniel Lokshtanov, Yngve Villanger, Daniel Raible
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_202a.html
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)