{"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":39,"n_cols":5,"rows_kept":39,"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],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[10,2,10,3],[10,4,10,5],[11,2,11,3],[11,4,11,5],[12,2,12,3],[13,2,13,3],[15,2,15,3],[16,2,16,3],[17,2,17,3],[18,2,18,3],[19,2,19,3],[32,2,32,3],[33,2,33,3],[36,2,36,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNIORUON00031838"]
[null,null,"Autore",null,"BELDICEANU, Nicoara"]
[null,null,"Titolo",null,"Les actes des premieres sultans conservés dans les manuscrits turcs de la Bibliothèque a Paris / Nicoara Beldiceanu.  - Paris : Mouton et Co., 1960-64"]
[null,null,"Pubbl/distr/stampa",null,"2 v. ; tav. ; 24 cm"]
[null,null,"Descrizione fisica",null,"vol. I : Actes de Mehmed II et de Bayezid II du MS. fonds turcs ancien 39 vol.II : Ecole Pratique des Hautes Etudes, VIe Section"]
[null,null,"Classificazione",null,"OTT IV A"]
[null,null,"Soggetti",null,"Impero Ottomano - Storia - Sec. 15-17 - Documenti"]
[null,null,"Lingua di pubblicazione",null,"Francese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNINA9910616372103321"]
[null,null,"Titolo",null,"Graph-Theoretic Concepts in Computer Science : 48th International Workshop, WG 2022, Tübingen, Germany, June 22–24, 2022, Revised Selected Papers / / edited by Michael A. Bekos, Michael Kaufmann"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022"]
[null,null,"ISBN",null,"9783031159145"]
[{"$nulls":4},"3031159144"]
[null,null,"Edizione",null,"[1st ed. 2022.]"]
[null,null,"Descrizione fisica",null,"1 online resource (469 pages)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 1611-3349 ; ; 13453"]
[null,null,"Disciplina",null,"929.605"]
[null,null,"Soggetti",null,"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Data Structures and Information Theory"]
[{"$nulls":4},"Design and Analysis of Algorithms"]
[{"$nulls":4},"Computer Graphics"]
[{"$nulls":4},"Numerical Analysis"]
[{"$nulls":4},"Symbolic and Algebraic Manipulation"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Design and analysis of sequential, parallel, randomized, parameterized algorithms. Distributed graph and network algorithms -- Structural graph theory with algorithmic or complexity applications -- Computational complexity of graph and network problems -- Graph grammars, graph rewriting systems and graph modeling -- Graph drawing and layouts -- Computational geometry -- Computational biology -- Graph mining -- Random graphs and models of the web and scale-free networks."]
[null,null,null,"Sommario/riassunto","This LNCS 13453 constitutes the thoroughly refereed proceedings of the 48th International Workshop on Graph-Theoretic Concepts in "]
[{"$nulls":4},"Computer Science, WG 2022.The 32 full papers presented in this volume were carefully reviewed and selected from a total of 96 submissions. The WG 2022 workshop aims to merge theory and practice by demonstrating how concepts from Graph Theory can be applied to various areas in Computer Science, or by extracting new graph theoretic problems from applications."]