06639nam0 22007333i 450 BVEE01639520170908093204.0hene n'ol diro cona (3) 1590 (R)fei19991012d1590 ||||0itac50 baitaitz01i xxxe z01nHistoria della guerra di Napoli di Gio. Giouiano Pontano, la quale abbraccia i fatti di Ferdinando d'Aragona primo re di Napoli di questo nome, & i modi, ch'ei tenne in peruenire all'acquisto del regno, tradotta da m. Giacomo MauroIn Napoliappresso Gioseppe Cacchi1590In Napoliappresso Gioseppe Cacchi1590[8], 298, [10] p.4ºMarca (Z106) sul frontCors. ; romSegn.: *⁴ A-2P⁴ 2Q²Iniziali e fregi xil.1 v. - ex libris Gino DoriaIT-NA0079, F.DORIA 7. 2181 v. - Mutilo in fine delle p. [9- 10]. - Sul front. timbro del Museo di S. Martino - Napoli- Bibiloteca e due note mss. ex libris Eustachij Caracciolj ; Tomaso CostoIT-NA0079, F.DORIA 7. 2181 v. - Sul front. timbro RB e nota ms: Coll. Neap. Catal. inscript.IT-NA0079, F.DORIA 7. 2181 esemplareIT-NA0079, F.DORIA 7. 2181 esemplareIT-NA0070, RARI 01571 esemplare. - Altro esempl.: RARI 0157IT-NA0070, RARI 01571 v. Legatura in pergamena. Piatti con doppia filettatura e cornice con decorazione a motivi floreali, centrati da motivo romboidale a secco. Dorso con otivi floreali dorati nei compartimenti eseguiti con ferri puntinati. A. e tit. in oro. Taglio rubro. RIT-NA0120, NICOLINI XVI 04031 v.IT-BN0015, RAR.PREG. S. C. 117 A1 V.IT-NA0097, BONAZZI 08.E. 020Provenienza: Doria, Gino. IT-NA0079 F.DORIA 7. 218Possessore: Caracciolo, Eustachio <teatino>. ex librisIT-NA0079 S. GIACOMO 56-2 0004Possessore: Costo, Tommaso <ca. 1560- ca. 1613>. Tomaso Costo sul front.IT-NA0079 S. GIACOMO 56-2 0004Possessore: *Museo Nazionale di San Martino <Napoli>. Timbro sul front.IT-NA0079 S. GIACOMO 56-2 0004De bello Neapolitano.BVEE010964CFIV05928030097Historia della guerra di Napoli di Gio. Gioviano Pontano, la quale abbraccia i fatti di Ferdinando d'Aragona ...BVEE016396Regno di Napoli. 1266-1815StoriaSec. 15.FIRNAPC019075INapoliTO0L002386Pontano, Giovanni GiovianoCFIV059280070437066Mauro, Giacomo <sec. 16.>BVEV037464Doria, GinoNAPP000563320IT-NA0079 F.DORIA 7. 218Caracciolo, Eustachio <teatino>NAPP000415390IT-NA0079 S. GIACOMO 56-2 0004Costo, Tommaso <ca. 1560- ca. 1613>NAPP000416390IT-NA0079 S. GIACOMO 56-2 0004Cacchi, GiuseppeBVEV017194650Museo Nazionale di San Martino <Napoli>NAPP001350390IT-NA0079 S. GIACOMO 56-2 0004Pontano, Giovanni <Giovanni Gioviano>CFIV059281Pontano, Giovanni GiovianoPontanus, Johannes JovianusCFIV317025Pontano, Giovanni GiovianoPontanus, Ioannes IovianusMILV162041Pontano, Giovanni GiovianoPontano, GiovianoMILV186270Pontano, Giovanni GiovianoCacchio, GioseppeMUSV011651Cacchi, GiuseppeITIT-NA007919991012IT-SA0060IT-NA0079IT-NA0070IT-NA0120IT-BN0015IT-NA0097Biblioteca Nazionale Vittorio Emanuele IIINA0079Shttp://books.google.com/books?vid=IBNN:BN000523664BVEE016395BVEM001420In ovale figurato api che volano intorno a delle fiamme. Motto: Deficientibus deficiunt. Z106Sul front. Biblioteca dell'Archivio di Stato di Salerno 27BILOTTI Antiq. A 1 8 27FB 0000000085 B Z 2010032420100324Biblioteca Nazionale Vittorio Emanuele III BNF.DORIA 7. 218 BN 0009639445 B 1 v. - ex libris Gino DoriaC 1975010219750102ex libris Gino DoriaEx libris1 v. BNS. GIACOMO56-2 0004 BNA010014569585 C 1 v. - Mutilo in fine delle p. [9- 10]. - Sul front. timbro del Museo di S. Martino - Napoli- Bibiloteca e due note mss. ex libris Eustachij Caracciolj ; Tomaso CostoC 20080311200803111 v.1 v. BNV.F. 54 C 0035 BN 0003125665 B 1 v. - Sul front. timbro RB e nota ms: Coll. Neap. Catal. inscript.C 20100611201006111 v.1 esemplare BNRACC.VILL.B 0104 BN 0005236645G B 1 esemplareC 2000071020000710Biblioteca Universitaria1 esemplare BURARI 0157 BUSI 0000178005 B 1 esemplareZ 20090213200902131 v.1 esemplare BUZ.B. 0414 BUSI 0000181155 B 1 esemplare. - Altro esempl.: RARI 0157Z 2009092420090924Istituto italiano per gli studi storici1 v.1 v. CRNICOLINI XVI 0403 CR 0000475775 B 1 v. Legatura in pergamena. Piatti con doppia filettatura e cornice con decorazione a motivi floreali, centrati da motivo romboidale a secco. Dorso con otivi floreali dorati nei compartimenti eseguiti con ferri puntinati. A. e tit. in oro. Taglio rubro. RZ 2007071620070716Biblioteca Provinciale Antonio Mellusi1 v. PBRAR.PREG. S. C. 117 A PB 0000162175 B 1 v.Z 2017021720170217Società napoletana di storia patria1 V.1 V. SPBONAZZI 08.E. 020 SP 0001235425 B 1 V.Z 2004020920040209Biblioteca Nazionale Vittorio Emanuele III1BN 000523664http://books.google.com/books?vid=IBNN:BN000523664 BNRACC.VILL.B 0104 27 BN BU CR PB SPDe bello Neapolitano30097UNISANNIO05693nam 22007455 450 99646626100331620200630021211.03-540-48385-310.1007/3-540-57899-4(CKB)1000000000234099(SSID)ssj0000323614(PQKBManifestationID)11247884(PQKBTitleCode)TC0000323614(PQKBWorkID)10300455(PQKB)10957344(DE-He213)978-3-540-48385-4(PPN)155193481(EXLCZ)99100000000023409920121227d1994 u| 0engurnn|008mamaatxtccrGraph-Theoretic Concepts in Computer Science[electronic resource] 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings /edited by Jan van Leeuwen1st ed. 1994.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1994.1 online resource (XI, 437 p.) Lecture Notes in Computer Science,0302-9743 ;790Bibliographic Level Mode of Issuance: Monograph3-540-57899-4 Near-optimal dominating sets in dense random graphs in polynomial expected time -- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality -- Hierarchically specified unit disk graphs -- Bounded tree-width and LOGCFL -- On reduction algorithms for graphs with small treewidth -- Algorithms and complexity of sandwich problems in graphs (extended abstract) -- On-line graph algorithms for incremental compilation -- Average case analysis of fully dynamic connectivity for directed graphs -- Fully dynamic maintenance of vertex cover -- Dynamic algorithms for graphs with treewidth 2 -- Short disjoint cycles in graphs with degree constraints -- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs -- Towards a solution of the Holyer's problem -- Graphs, hypergraphs and hashing -- Coloring k-colorable graphs in constant expected parallel time -- Deciding 3-colourability in less than O(1.415n) steps -- A rainbow about T-colorings for complete graphs -- Approximating the chromatic polynomial of a graph -- Asteroidal triple-free graphs -- The parallel complexity of elimination ordering procedures -- Dually chordal graphs -- The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions -- Regular marked Petri nets -- The asynchronous committee meeting problem -- Gossiping in vertex-disjoint paths mode in interconnection networks -- The folded Petersen network: A new versatile multiprocessor interconnection topology -- Fast load balancing in Cayley graphs and in circuits -- Concurrent flows and packet routing in Cayley graphs (Preliminary version) -- On multi-label linear interval routing schemes -- An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages -- Linear layouts of generalized hypercubes -- Graph ear decompositions and graph embeddings -- Improved bounds for the crossing numbers on surfaces of genus g -- Two algorithms for finding rectangular duals of planar graphs -- A more compact visibility representation.This volume contains the proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '93, held near Utrecht, The Netherlands, in 1993. The papers are grouped into parts on: hard problems on classes of graphs, structural graph theory, dynamic graph algorithms, structure-oriented graph algorithms, graph coloring, AT-free and chordal graphs, circuits and nets, graphs and interconnection networks, routing and shortest paths, and graph embedding and layout. The 35 revised papers were chosen from 92 submissions after a careful refereeing process.Lecture Notes in Computer Science,0302-9743 ;790ComputersDiscrete mathematicsApplication softwareAlgorithmsCombinatoricsComputer logicTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Discrete Mathematicshttps://scigraph.springernature.com/ontologies/product-market-codes/M29000Computer Applicationshttps://scigraph.springernature.com/ontologies/product-market-codes/I23001Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XComputers.Discrete mathematics.Application software.Algorithms.Combinatorics.Computer logic.Theory of Computation.Discrete Mathematics.Computer Applications.Algorithm Analysis and Problem Complexity.Combinatorics.Logics and Meanings of Programs.004/.01/5115Leeuwen Jan vanedthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Graph-Theoretic Concepts in Computer Science(19th :1993 :Utrecht, Netherlands)BOOK996466261003316Graph-Theoretic Concepts in Computer Science772292UNISA