Katalog der Deutschen Nationalbibliothek

Ergebnis der Suche nach: "115476032"
im Bestand: Gesamter Bestand

51 - 60 von 224

	51	8/7-approximation algorithm for (1,2)-TSP Berman, Piotr. - Bonn : Inst. für Informatik, 2005
	52	Algorithms for construction of optimal and almost optimal length restricted codes Karpiński, Marek. - Bonn : Inst. für Informatik, 2005
	53	Dynamic planar orthogonal range reporting Karpiński, Marek. - Bonn : Inst. für Informatik, 2005
	54	Fast data structures for orthogonal range reporting Karpiński, Marek. - Bonn : Inst. für Informatik, 2005
	55	Metric construction, stopping times and path coupling Bordewich, Magnus. - Bonn : Inst. für Informatik, 2005
	56	On the complexity of global constraint satisfaction Bazgan, Cristina. - Bonn : Inst. für Informatik, 2005
	57	Path coupling using stopping times and counting independent sets and colouring in hypergraphs Bonn : Inst. für Informatik, 2005
	58	Predecessor queries in constant time? Karpiński, Marek. - Bonn : Inst. für Informatik, 2005
	59	TSP with bounded metrics: approximation hardness for the (1,2) case Engebretsen, Lars. - Bonn : Inst. für Informatik, 2005
	60	TSP with bounded metrics: stronger approximation hardness Engebretsen, Lars. - Bonn : Inst. für Informatik, 2005