{"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":33,"n_cols":5,"rows_kept":33,"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],[7,2,7,3],[7,4,7,5],[8,2,8,3],[8,4,8,5],[9,2,9,3],[10,2,10,3],[13,2,13,3],[14,2,14,3],[15,2,15,3],[16,2,16,3],[17,2,17,3],[25,2,25,3],[26,2,26,3],[30,2,30,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISALENTO991003632379707536"]
[null,null,"Autore",null,"Seneca, Lucius Annaeus"]
[null,null,"Titolo",null,"Octavia praetexta / cum prolegomenis annotatione critica notis exegeticis edidit I. Vürtheim"]
[null,null,"Descrizione fisica",null,"75 p. ; 23 cm"]
[null,null,"Lingua di pubblicazione",null,"Latino"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNINA9910767528703321"]
[null,null,"Titolo",null,"Graph Drawing : 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006, Revised Papers / / edited by Michael Kaufmann, Dorothea Wagner"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007"]
[null,null,"ISBN",null,"1-280-86451-6"]
[{"$nulls":4},"9786610864515"]
[{"$nulls":4},"3-540-70904-5"]
[null,null,"Edizione",null,"[1st ed. 2007.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIV, 454 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4372"]
[null,null,"Disciplina",null,"006.6"]
[null,null,"Soggetti",null,"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Artificial intelligence - Data processing"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Computer Graphics"]
[{"$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 Talks -- The Number of Triangulations on Planar Point Sets -- The Algorithmic Beauty of Digital Nature -- Papers -- Integrating Edge Routing into Force-Directed Layout -- Multipole-Based Force Approximation Revisited – A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree -- SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding -- Eigensolver Methods for Progressive Multidimensional Scaling of Large Data -- Angle and Distance Constraints on Tree Drawings -- Schematisation of Tree Drawings -- Trees with Convex Faces and Optimal Angles -- Three-Dimensional Drawings of Bounded Degree Trees -- Simultaneous Graph Embedding with Bends and Circular Arcs -- Embedding Graphs Simultaneously with Fixed Edges -- Drawing Cubic Graphs with at Most Five Slopes -- Planarity Testing and Optimal Edge Insertion with Embedding Constraints -- Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs -- Planar Decompositions "]
[{"$nulls":4},"and the Crossing Number of Graphs with an Excluded Minor -- On the Crossing Number of Almost Planar Graphs -- On the Decay of Crossing Numbers -- How Important Is the “Mental Map”? – An Empirical Investigation of a Dynamic Graph Layout Algorithm -- Computing Geometric Minimum-Dilation Graphs Is NP-Hard -- Chordal Graphs as Intersection Graphs of Pseudosegments -- Parameterized st-Orientations of Graphs: Algorithms and Experiments -- Straight-Line Drawing of Quadrangulations -- Visualizing Large and Clustered Networks -- Partitioned Drawings -- Path Simplification for Metro Map Layout -- Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps -- Upright-Quad Drawing of st-Planar Learning Spaces -- Choosing Colors for Geometric Graphs Via Color Space Embeddings -- Morphing Planar Graphs in SphericalSpace -- k-Colored Point-Set Embeddability of Outerplanar Graphs -- Thickness of Bar 1-Visibility Graphs -- A New Approximation Algorithm for Bend Minimization in the Kandinsky Model -- Radial Drawings of Graphs: Geometric Constraints and Trade-Offs -- Characterization of Unlabeled Level Planar Trees -- Drawing Bipartite Graphs on Two Curves -- Improved Circular Layouts -- Controllable and Progressive Edge Clustering for Large Networks -- Biclique Edge Cover Graphs and Confluent Drawings -- Schnyder Woods and Orthogonal Surfaces -- Partitions of Graphs into Trees -- Posters -- The Website for Graph Visualization Software References (GVSR) -- Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings -- Corrections -- Fast Node Overlap Removal—Correction -- Graph Drawing Contest -- Graph-Drawing Contest Report."]
[null,null,null,"Sommario/riassunto","This book constitutes the thoroughly refereed post-proceedings of the 14th International Symposium on Graph Drawing, GD 2006, held in Karlsruhe, Germany in September 2006. The 33 revised full papers and 5 revised short papers presented together with 2 invited talks, 1 system demo, 2 poster papers and a report on the graph drawing contest were carefully selected during two rounds of reviewing and improvement from 91 submissions. All current aspects in graph drawing are addressed ranging from foundational and methodological issues to applications for various classes of graphs in a variety of fields."]