{"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":29,"n_cols":5,"rows_kept":29,"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],[9,2,9,3],[10,2,10,3],[21,2,21,3],[22,2,22,3],[27,2,27,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465507703316"]
[null,null,"Titolo",null,"Discrete Geometry, Combinatorics and Graph Theory [[electronic resource] ] : 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers / / edited by Jin Akiyama, William Y.C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007"]
[null,null,"ISBN",null,"1-280-93576-6"]
[{"$nulls":4},"9786610935765"]
[{"$nulls":4},"3-540-70666-6"]
[null,null,"Edizione",null,"[1st ed. 2007.]"]
[null,null,"Descrizione fisica",null,"1 online resource (297 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4381"]
[null,null,"Disciplina",null,"516/.13"]
[null,null,"Soggetti",null,"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Artificial intelligence—Data processing"]
[{"$nulls":4},"Convex geometry"]
[{"$nulls":4},"Discrete geometry"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Computer Graphics"]
[{"$nulls":4},"Data Science"]
[{"$nulls":4},"Convex and Discrete Geometry"]
[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","\"Papers of the China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory (CJCDGCGT 2005)\"--Pref."]
[{"$nulls":4},"Conference name varies widely."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Infinite Series of Generalized Gosper Space Filling Curves -- Contractible Edges in a k-Connected Graph -- An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs -- On the Choice Numbers of Some Complete Multipartite Graphs -- On Convex Quadrangulations of Point Sets on the Plane -- Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs -- Impossibility of Transformation of Vertex Labeled Simple Graphs "]
[{"$nulls":4},"Preserving the Cut-Size Order -- A Neighborhood Condition for Graphs to Have [a, b]-Factors III -- General Balanced Subdivision of Two Sets of Points in the Plane -- Coverage Problem of Wireless Sensor Networks -- Some Topics on Edge-Coloring -- Hamiltonicity of Complements of Total Graphs -- Isolated Toughness and Existence of f-Factors -- A Note on the Integrity of Middle Graphs -- Indecomposable Coverings -- The Decycling Number of Cubic Planar Graphs -- Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs -- Rotational Steiner Ratio Problem Under Uniform Orientation Metrics -- Two Classes of Simple MCD Graphs -- Core Stability of Flow Games -- The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs -- Three Classes of Bipartite Integral Graphs -- Reconfirmation of Two Results on Disjoint Empty Convex Polygons -- The Binding Number of a Digraph -- The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph -- Fractional Vertex Arboricity of Graphs -- Fitting Triangles into Rectangles -- Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs -- On the Upper Chromatic Numbers of Mixed Interval Hypertrees -- Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs."]