{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":36,"n_cols":5,"rows_kept":36,"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],[20,2,20,3],[21,2,21,3],[25,2,25,3],[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],[34,2,34,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465863803316"]
[null,null,"Titolo",null,"Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers / / edited by Dieter Kratsch"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005"]
[null,null,"ISBN",null,"3-540-31468-7"]
[null,null,"Edizione",null,"[1st ed. 2005.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIV, 478 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 3787"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computer science"]
[{"$nulls":4},"Computer simulation"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Artificial intelligence—Data processing"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Computer Modelling"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Numerical Analysis"]
[{"$nulls":4},"Data Science"]
[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,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Lectures -- Hypertree Decompositions: Structure, Algorithms, and Applications -- Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey -- Regular Papers -- Domination Search on Graphs with Low Dominating-Target-Number -- Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs -- Approximating Rank-Width and Clique-Width Quickly -- Computing the Tutte Polynomial on Graphs of Bounded Clique-Width -- Minimizing NLC-Width is NP-Complete -- Channel Assignment and Improper Choosability of Graphs -- Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time -- Roman Domination over Some Graph Classes -- Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph "]
[{"$nulls":4},"Homomorphisms -- Network Discovery and Verification -- Complete Graph Drawings Up to Triangle Mutations -- Collective Tree 1-Spanners for Interval Graphs -- On Stable Cutsets in Claw-Free Graphs and Planar Graphs -- Induced Subgraphs of Bounded Degree and Bounded Treewidth -- Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time -- Ultimate Generalizations of LexBFS and LEX M -- Adding an Edge in a Cograph -- The Computational Complexity of Delay Management -- Acyclic Choosability of Graphs with Small Maximum Degree -- Generating Colored Trees -- Optimal Hypergraph Tree-Realization -- Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints -- On the Fixed-Parameter Enumerability of Cluster Editing -- Locally Consistent Constraint Satisfaction Problems with Binary Constraints -- On Randomized Broadcasting in Star Graphs -- Finding Disjoint Paths on Directed Acyclic Graphs -- Approximation Algorithms for the Bi-criteria Weighted max-cut Problem -- Approximation Algorithms for the Weighted Independent Set Problem -- Approximation Algorithms for Unit Disk Graphs -- Computation of Chromatic Polynomials Using Triangulations and Clique Trees -- Computing Branchwidth Via Efficient Triangulations and Blocks -- Algorithms Based on the Treewidth of Sparse Graphs -- Extending the Tractability Border for Closest Leaf Powers -- Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model -- Algebraic Operations on PQ Trees and Modular Decomposition Trees -- Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs -- Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny -- Recognizing HHDS-Free Graphs."]
[null,"2.","Record Nr.",null,"UNIORUON00063535"]
[null,null,"Titolo",null,"Beitrage zum japanische und auslandischen Bank und Finanzrecht / herausgegeben von Koresuke Yamauchi"]
[null,null,"Pubbl/distr/stampa",null,"Tokyo, : Chuo Daigaku Shuppanbu, 1987"]
[null,null,"Descrizione fisica",null,"VII, 233 p. ; 22 cm"]
[null,null,"Classificazione",null,"GIA XII"]
[null,null,"Soggetti",null,"Economia - Giappone"]
[null,null,"Lingua di pubblicazione",null,"Tedesco"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]