REPORTS IN INFORMATICS

First Page		Document Content
Date: 2007-08-06 05:58:33 NP-complete problems Dominating set Graph coloring Travelling salesman problem Approximation algorithm Algorithm Feedback vertex set Time complexity Set cover problem Theoretical computer science Computational complexity theory Mathematics		REPORTS IN INFORMATICS Add to Reading List Source URL: www.ii.uib.no Download Document from Source Website File Size: 308,12 KB Share Document on Facebook

	Algorithmica DOIs00453Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms Athanassios Koutsonas · Dimitrios M. Thilikos DocID: 1t5yD - View Document
	Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,? , Pim van ’t Hof1,? , Marcin Kami´ nski2,?? , and Dani¨el Paulusma3,? ? ? 1 DocID: 1qTAq - View Document
	The Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,∗ , Pim van ’t Hof1,∗ , Marcin Kami´ nski2 , and 3,† Dani¨el Paulusma 1 DocID: 1pwfu - View Document
	Outerplanar Obstructions for the Feedback Vertex Set Juanjo Ru´e 1,4 Departament de Matem` atica Aplicada 2, Universitat Polit`ecnica de Catalunya, Barcelona, Spain DocID: 1nHyo - View Document
	A 4k 2 kernel for feedback vertex set St´ephan Thomass´e∗ Universit´e Montpellier II - CNRS, LIRMM, 161 rue Ada, 34392 Montpellier Cedex, France DocID: 1mGmv - View Document