{"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":25,"n_cols":5,"rows_kept":25,"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],[18,2,18,3],[19,2,19,3],[22,2,22,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465577603316"]
[null,null,"Titolo",null,"Graph Drawing [[electronic resource] ] : Symposium on Graph Drawing, GD'95; Passau, Germany, September 20-22, 1995. Proceedings / / edited by Franz Brandenburg"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996"]
[null,null,"ISBN",null,"3-540-49351-4"]
[null,null,"Edizione",null,"[1st ed. 1996.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIV, 534 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 1027"]
[null,null,"Disciplina",null,"511/.5"]
[null,null,"Soggetti",null,"Geometry"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Combinatorics"]
[{"$nulls":4},"Software engineering"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Computer-aided engineering"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Computer Graphics"]
[{"$nulls":4},"Computer-Aided Engineering (CAD, CAE) and Design"]
[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,"Nota di contenuto",null,"Quasi-planar graphs have a linear number of edges -- Universal 3-Dimensional visibility representations for graphs -- KGB a customizable graph browser -- Adocs: a drawing system for generic combinatorial structures -- New lower bounds for orthogonal graph drawings -- The effect of graph layout on inference from social network data -- Drawing nice projections of objects in space -- Optimal algorithms to embed trees in a point set -- An experimental comparison of force-directed and randomized graph drawing algorithms -- On the complexity of recognizing intersection and touching graphs of disks -- Fast interactive 3-D graph visualization -- GD-Workbench: A system for prototyping and testing graph drawing algorithms -- CABRI-Graph: A tool for research and teaching in graph theory -- Graph folding: Extending detail and context viewing into a tool for subgraph comparisons -- Upward numbering testing for triconnected graphs -- On a visibility representation of graphs -- 3D graph drawing with "]
[{"$nulls":4},"simulated annealing -- The botanical beauty of random binary trees -- The strength of weak proximity (extended abstract) -- COMAIDE: Information visualization using cooperative 3D diagram layout -- Vertex splitting and tension-free layout -- Drawing stressed planar graphs in three dimensions -- Graph-Drawing contest report -- New results on a visibility representation of graphs in 3D -- Generalized fisheye views of graphs -- Drawing high degree graphs with low bend numbers -- The drawing of configurations -- Upward drawings on planes and spheres -- Grid embedding of 4-connected plane graphs -- Recognizing leveled-planar dags in linear time -- Contact graphs of curves -- On representations of some thickness-two graphs -- Drawing force-directed graphs using Optigraph -- Exact and heuristic algorithms for 2-layer straightline crossing minimization -- Constraint-based spring-model algorithm for graph layout -- Layout algorithms of graph-like diagrams for GRADE windows graphic editors -- Grid intersection and box intersection graphs on surfaces -- How to draw outerplanar minimum weight triangulations -- Portable graph layout and editing -- A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs -- Incremental layout in DynaDAG -- Issues in interactive orthogonal graph drawing (preliminary version) -- Automatic drawing of compound digraphs for a real-time power system simulator -- Validating graph drawing aesthetics -- A fast heuristic for hierarchical Manhattan layout -- CLaX — A visualized compiler -- Crossing numbers of meshes -- Directed graphs drawing by Clan-based decomposition -- TOSCANA management system for conceptual data -- Graph layout adjustment strategies -- A generic compound graph visualizer/manipulator: D-ABDUCTOR -- Generating customized layouts -- GOVE Grammar-Oriented Visualisation Environment -- Swan: A data structure visualization system."]
[null,null,null,"Sommario/riassunto","This book constitutes the refereed proceedings of the international Symposium on Graph Drawing, GD '95, held in Passau, Germany, in September 1995. The 40 full papers and 12 system demonstrations were selected from a total of 88 submissions and include, in their revised versions presented here, the improvements suggested during the meeting. This book also contains a report on the graph-drawing contest held in conjunction with GD '95. Graph drawing is concerned with the problem of visualizing structural information, particularly by constructing geometric representations of abstract graphs and networks. The importance of this area for industrial applications is testified by the large number of people with industrial affiliations, submitting papers and participating in the meeting."]