{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":3,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":52,"n_cols":5,"rows_kept":52,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[19,2,19,3],[20,2,20,3],[23,2,23,3],[26,2,26,3],[26,4,26,5],[27,2,27,3],[27,4,27,5],[28,2,28,3],[28,4,28,5],[29,2,29,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[41,2,41,3],[41,4,41,5],[42,2,42,3],[42,4,42,5],[43,2,43,3],[44,2,44,3],[45,2,45,3],[46,2,46,3],[47,2,47,3],[49,2,49,3],[50,2,50,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466261003316"]
[null,null,"Titolo",null,"Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings / / edited by Jan van Leeuwen"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994"]
[null,null,"ISBN",null,"3-540-48385-3"]
[null,null,"Edizione",null,"[1st ed. 1994.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XI, 437 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 790"]
[null,null,"Disciplina",null,"004/.01/5115"]
[null,null,"Soggetti",null,"Computers"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Application software"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Combinatorics"]
[{"$nulls":4},"Computer logic"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Discrete Mathematics"]
[{"$nulls":4},"Computer Applications"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"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-"]
[{"$nulls":4},"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."]
[null,null,null,"Sommario/riassunto","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."]
[null,"2.","Record Nr.",null,"UNISA996393939203316"]
[null,null,"Autore",null,"Gother John <d. 1704.>"]
[null,null,"Titolo",null,"Transubstantiation defended and prov'd from Scripture [[electronic resource] ] : in answer to the first part of a treatise intitled, A discourse against transubstantiation"]
[null,null,"Pubbl/distr/stampa",null,"London, : Printed by Henry Hills ..., 1687"]
[null,null,"Descrizione fisica",null,"[24], 64, [2] p"]
[null,null,"Soggetti",null,"Transubstantiation"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","In reply to a pamphlet by John Tillotson, Archbishop of Canterbury."]
[{"$nulls":4},"Attributed to John Gother. Cf. BM."]
[{"$nulls":4},"Errata: p. [23]."]
[{"$nulls":4},"Reproduction of original in Newberry Library."]
[{"$nulls":4},"Marginal notes."]
[null,null,null,"Sommario/riassunto","eebo-0101"]
[null,"3.","Record Nr.",null,"UNIORUON00259510"]
[null,null,"Titolo",null,"Ermeneutica e pensiero tragico : studi in onore di Sergio Givone / a cura di Claudio Ciancio,...[et al.]"]
[null,null,"Pubbl/distr/stampa",null,"Genova, : Il Melangolo, 2004"]
[null,null,"ISBN",null,"88-7018-531-1"]
[null,null,"Descrizione fisica",null,"216 p. ; 21 cm."]
[null,null,"Disciplina",null,"149.94"]
[null,null,"Soggetti",null,"Ermeneutica"]
[{"$nulls":4},"Filosofia - Dizionari tedeschi"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]