{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"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":28,"n_cols":5,"rows_kept":28,"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]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465940203316"]
[null,null,"Titolo",null,"Graph Drawing [[electronic resource] ] : 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008, Revised Papers / / edited by Ioannis G. Tollis, Maurizio Patrignani"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009"]
[null,null,"ISBN",null,"3-642-00219-6"]
[null,null,"Edizione",null,"[1st ed. 2009.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIV, 460 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5417"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Application software"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Artificial intelligence—Data processing"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Computer and Information Systems Applications"]
[{"$nulls":4},"Theory of Computation"]
[{"$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 -- Networks in Biology – From Identification, Analysis to Interpretation -- Graph Drawing for Security Visualization -- Papers -- Succinct Greedy Graph Drawing in the Hyperbolic Plane -- An Algorithm to Construct Greedy Drawings of Triangulations -- Crossing and Weighted Crossing Number of Near-Planar Graphs -- Cubic Graphs Have Bounded Slope Parameter -- Unimaximal Sequences of Pairs in Rectangle Visibility Drawing -- Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights -- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing -- Rapid Multipole Graph Drawing on the GPU -- Clustered Planarity: Clusters with Few Outgoing Edges -- Computing Maximum C-Planar Subgraphs -- Clustered Planarity: Embedded Clustered Graphs with Two-"]
[{"$nulls":4},"Component Clusters -- Visual Analysis of One-to-Many Matched Graphs -- Topological Morphing of Planar Graphs -- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges -- Graph Simultaneous Embedding Tool, GraphSET -- Hamiltonian Alternating Paths on Bicolored Double-Chains -- The Binary Stress Model for Graph Drawing -- Efficient Node Overlap Removal Using a Proximity Stress Model -- An Experimental Study on Distance-Based Graph Drawing -- Topology Preserving Constrained Graph Layout -- Embeddability Problems for Upward Planar Digraphs -- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs -- On the Hardness of Orthogonal-Order Preserving Graph Drawing -- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints -- Placing Text Boxes on Graphs -- Removing Node Overlaps Using Multi-sphere Scheme -- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing -- Connected Rectilinear Graphs on Point Sets -- 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces -- Drawing (Complete) Binary Tanglegrams -- Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem -- Cyclic Leveling of Directed Graphs -- Constrained Point-Set Embeddability of Planar Graphs -- Tree Drawings on the Hexagonal Grid -- Isometric Diamond Subgraphs -- Non-convex Representations of Graphs -- Subdivision Drawings of Hypergraphs -- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three -- Dunnart: A Constraint-Based Network Diagram Authoring Tool -- Posters -- Approximating the Crossing Number of Apex Graphs -- Policy-Aware Visualization of Internet Dynamics -- Enhancing Visualizations of Business Processes -- A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs -- Visualizing the Results of Metabolic Pathway Queries -- Visual Specification of Layout -- Spine Crossing Minimization in Upward Topological Book Embeddings -- ILOG Elixir -- DAGmap View -- Brain Network Analyzer -- Graph Drawing Contest -- Graph Drawing Contest Report."]
[null,null,null,"Sommario/riassunto","This book constitutes the proceedings of the 16th International Symposium on Graph Drawing, GD 2008, held in Heraklion, Crete, Greece, during September 21-24, 2008. The 31 long papers and 8 short papers presented together with 10 posters and two invited papers were carefully reviewed and selected from 83 submissions. The volume also includes a report on the Graph Drawing Contest which was held during the conference. An important aspect of the conference is bridging the gap between theoretical advances and implemented solutions of geometric representation of graphs and networks. It is motivated by those applications where it is crucial to visualize structural information as graphs."]