{"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":51,"n_cols":5,"rows_kept":51,"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],[33,2,33,3],[34,2,34,3],[41,2,41,3],[41,4,41,5],[42,2,42,3],[42,4,42,5],[43,2,43,3],[43,4,43,5],[44,2,44,3],[45,2,45,3],[46,2,46,3],[47,2,47,3],[48,2,48,3],[49,2,49,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465640103316"]
[null,null,"Titolo",null,"Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings / / edited by Gunther Schmidt, Rudolf Berghammer"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992"]
[null,null,"ISBN",null,"3-540-46735-1"]
[null,null,"Edizione",null,"[1st ed. 1992.]"]
[null,null,"Descrizione fisica",null,"1 online resource (VIII, 256 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 570"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computer science—Mathematics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Combinatorics"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Logic design"]
[{"$nulls":4},"Mathematics of Computing"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Computation by Abstract Devices"]
[{"$nulls":4},"Data Structures"]
[{"$nulls":4},"Logic Design"]
[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,"Approximating treewidth, pathwidth, and minimum elimination tree height -- Monadic second-order evaluations on tree-decomposable graphs -- Optimal embedding of complete binary trees into lines and grids -- Graph rewriting systems and their application to network reliability analysis -- Nondeterministic control structures for graph rewriting systems -- A language for generic graph-transformations -- Attributed elementary programmed graph grammars -- The complexity of approximating the class Steiner tree problem -- On complexity of some chain and antichain partition problems -- Tight bounds for the rectangular art gallery problem -- Voronoi diagrams of moving points in the plane -- Using maximal independent sets to solve problems in parallel -- Fast parallel algorithms for coloring random graphs -- "]
[{"$nulls":4},"Optimal vertex ordering of a graph and its application to symmetry detection -- Edge separators for graphs of bounded genus with applications -- Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing -- A generalized encryption scheme based on random graphs -- Dynamic algorithms for shortest paths in planar graphs -- Complete problems for logspace involving lexicographic first paths in graphs -- A new upper bound on the complexity of the all pairs shortest path problem -- On the crossing number of the hypercube and the cube connected cycles -- Logic arrays for interval indicator functions -- On the broadcast time of the butterfly network -- On disjoint cycles -- Short disjoint cycles in cubic bridgeless graphs."]
[null,null,null,"Sommario/riassunto","This volume contains contributions to the 17th International workshop on Graph-Theoretic Concepts in Computer Science (WG '91) held in Southern Bavaria in June 1991. These annual workshops are designed to bring together researchers using graph-theoretic methods to discuss new developments relating to or emerging from a diversity of application fields. The topics covered in this volume include: tree-related problems, graph grammarsand rewriting, complexity, computational geometry, parallel algorithms, vertex orderings, path-oriented algorithms, applications to VLSI, and disjoint cycle problems."]
[null,"2.","Record Nr.",null,"UNISA996390686203316"]
[null,null,"Autore",null,"Bunyan John <1628-1688.>"]
[null,null,"Titolo",null,"The Jerusalem-sinner saved: or, Good news for the vilest of men [[electronic resource] ] : being a help for despairing souls: shewing that Jesus Christ would have mercy in the first place offered to the biggest sinners. The third edition. In which is added, An answer to those grand objections that lie in the way of them that would believe: for the confort of those that fear they have sinned against the Holy Ghost. By John Bunyan of Bedford"]
[null,null,"Pubbl/distr/stampa",null,"London, : printed for John Gwillim, near Sun-Yard in Bishopsgate-Street, 1697"]
[null,null,"Descrizione fisica",null,"[12], 167, [1] p"]
[null,null,"Soggetti",null,"Sin"]
[{"$nulls":4},"Salvation"]
[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","At foot of title page: Price bound 1 s."]
[{"$nulls":4},"Running title reads: Good news for the vilest of men."]
[{"$nulls":4},"Originally published in 1688 as: Good news for the vilest of men."]
[{"$nulls":4},"Reproduction of the original in the British Library."]
[null,null,null,"Sommario/riassunto","eebo-0018"]
[null,"3.","Record Nr.",null,"UNISALENTO991000290189707536"]
[null,null,"Autore",null,"Arnaldi, Francesco"]
[null,null,"Titolo",null,"Tacito / Francesco Arnaldi"]
[null,null,"Pubbl/distr/stampa",null,"Napoli : G. Macchiaroli, 1973"]
[null,null,"Descrizione fisica",null,"125 p. ; 24 cm."]
[null,null,"Collana",null,"Memorie dell'Accademia di archeologia, lettere e belle arti di Napoli ; 6"]
[null,null,"Soggetti",null,"Tacito, Publio Cornelio"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]