Katalog der Deutschen Nationalbibliothek

Ergebnis der Suche nach: dcs=511*
im Bestand: Gesamter Bestand

1331 - 1340 von 1745

	1331	Circuit bases problems in binary matroids Bunke, Florentine. - München : Verl. Dr. Hut, 2007, 1. Aufl.
	1332	Collective graph exploration Dynia, Mirosław, 2007
	1333	Collective graph exploration Dynia, Mirosław, 2007
	1334	Complexity of computing functions by quantum branching programs Ablaev, Farid. - Bonn : Inst für Informatik, 2007
	1335	Complexity of the Hamiltonian cycle problem in triangular grid graphs Gordon, Valerij S.. - Magdeburg : Univ., Fak. für Mathematik, 2007
	1336	Complexity results for boolean constraint satisfaction problems Bauland, Michael. - Göttingen : Cuvillier, 2007, 1. Aufl.
	1337	Computability and complexity aspects of univariate complex analysis Rettinger, Robert. - Hagen, 25. September 2007
	1338	Computational geometry and graph theory Tokyo : Springer, 2007
	1339	Constrained planarity and augmentation problems Percan, Merijam, 2007
	1340	Constrained planarity and augmentation problems Percan, Merijam, 2007