{"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],[6,2,6,3],[7,2,7,3],[8,2,8,3],[10,2,10,3],[11,2,11,3],[16,2,16,3],[24,2,24,3],[24,4,24,5],[25,2,25,3],[25,4,25,5],[26,2,26,3],[26,4,26,5],[27,2,27,3],[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,"UNINA9910454074203321"]
[null,null,"Titolo",null,"Graph algorithms and applications I [[electronic resource] /] / editors, Roberto Tamassia, Ioannis G. Tollis"]
[null,null,"Pubbl/distr/stampa",null,"River Edge, N.J., : World Scientific, c2002"]
[null,null,"ISBN",null,"1-281-92976-X"]
[{"$nulls":4},"9786611929763"]
[{"$nulls":4},"981-277-763-6"]
[null,null,"Descrizione fisica",null,"1 online resource (439 p.)"]
[null,null,"Disciplina",null,"511/.5"]
[null,null,"Soggetti",null,"Graph algorithms"]
[{"$nulls":4},"Electronic books."]
[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","Issues for 2006- cataloged as a serial in LC."]
[{"$nulls":4},"\"Contains volumes 1-3 of the Journal of graph algorithms and applications (JGAA)\"--Pref."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"Contents               ; Volume 1:1-3 (1997)                          ; 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms                                                                                                ; 1 Introduction                     ; 2 Branch and Cut for One Sided Crossing Minimization                                                           ; 3 One Sided Crossing Minimization                                        ; 4 Two Sided Crossing Minimization                                        ; 5 Conclusions"]
[{"$nulls":4},"References                 Optimal Algorithms to Embed Trees in a Point Set                                                       ; 1 Introduction                     ; 2 Hull Trees                   ; 3 Embedding a Rooted Tree with the Root on the Convex Hull                                                                 ; 4 Embedding a Rooted Tree                                ; 5 Finding Degree-constrained Embeddings                                              ; 6 Lower Bounds                     ; References"]
[{"$nulls":4},"Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction Max Cut and Coloring                                                                                                                       1 Introduction                     ; 2 Preliminaries                      ; 3 Simple Local Search                            ; 4 Modified Local Search                              ; 5 Applications to Induced Subgraph Problems and Graph Coloring                                                                     ; References"]
[{"$nulls":4},"Volume 2:1-8 (1998)                          Algorithms for Cluster Busting in Anchored Graph Drawing                                                               ; 1 Introduction                     ; 2 Related Work                     ; 3 Measuring "]
[{"$nulls":4},"Similarity and Distribution                                              ; 4 The Layout Algorithms                              ; 5 Results                ; 6 Conclusions and Future Work                                    ; References"]
[{"$nulls":4},"A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs                                                                                   1 Introduction                     ; 2 Preliminaries                      ; 3 Broadcasting Algorithm                               ; 4 Conclusion                   ; References                 ; A Visibility Representation for Graphs in Three Dimensions                                                                 ; 1 Introduction                     ; 2 An Upper Bound                       ; 3 A Lower Bound"]
[{"$nulls":4},"4 Additional Results"]
[null,null,null,"Sommario/riassunto","This book contains volumes 1-3 of the <i>Journal of Graph Algorithms and Applications</i> <i>(JGAA)</i>. Topics of interest include design and analysis of graph algorithms, experiences with graph algorithms, and applications of graph algorithms. <i>JGAA</i> is supported by distinguished advisory and editorial boards, has high scientific standards, and takes advantage of current electronic document technology. The electronic version of <i>JGAA</i> is available on the Web at http://www.cs.brown.edu/publications/jgaa/. <br><i>Contents:</i><ul><li><i><i>Volume 1:</i></i><ul><li>2-Layer Straightli"]
[null,"2.","Record Nr.",null,"UNINA9910156445703321"]
[null,null,"Autore",null,"Cooper Duff, Viscount Norwich, <1890-1954, >"]
[null,null,"Titolo",null,"Operation heartbreak / / a story by Duff Cooper"]
[null,null,"Pubbl/distr/stampa",null,"[Place of publication not identified] : , : Pickle Partners Publishing, , 2016"]
[{"$nulls":4},"©1950"]
[null,null,"ISBN",null,"1-78720-089-2"]
[null,null,"Descrizione fisica",null,"1 online resource (132 pages)"]
[null,null,"Disciplina",null,"823.914"]
[null,null,"Soggetti",null,"World War, 1939-1945 - Secret service - Great Britain"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]