{"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":40,"n_cols":5,"rows_kept":40,"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],[19,2,19,3],[20,2,20,3],[24,2,24,3],[26,2,26,3],[26,4,26,5],[27,2,27,3],[27,4,27,5],[28,2,28,3],[29,2,29,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[36,2,36,3],[37,2,37,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465379903316"]
[null,null,"Titolo",null,"Algorithm Theory – SWAT 2008 [[electronic resource] ] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / / edited by Joachim Gudmundsson"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008"]
[null,null,"ISBN",null,"3-540-69903-1"]
[null,null,"Edizione",null,"[1st ed. 2008.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIII, 438 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5124"]
[null,null,"Disciplina",null,"005.73"]
[null,null,"Soggetti",null,"Artificial intelligence—Data processing"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Data Science"]
[{"$nulls":4},"Discrete Mathematics"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Computer Graphics"]
[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 Lectures -- A Survey of Results for Deletion Channels and Related Synchronization Channels -- Nash Bargaining Via Flexible Budget Markets -- Contributed Papers -- Simplified Planar Coresets for Data Streams -- Uniquely Represented Data Structures for Computational Geometry -- I/O Efficient Dynamic Data Structures for Longest Prefix Queries -- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear -- Vision-Based Pursuit-Evasion in a Grid -- Angle Optimization in Target Tracking -- Improved Bounds for Wireless Localization -- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem -- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint -- The Maximum Energy-Constrained Dynamic Flow Problem -- Bounded Unpopularity Matchings -- Data Structures with Local Update Operations -- On the Redundancy of Succinct Data "]
[{"$nulls":4},"Structures -- Confluently Persistent Tries for Efficient Version Control -- A Uniform Approach Towards Succinct Representation of Trees -- An Algorithm for L(2,1)-Labeling of Trees -- Batch Coloring Flat Graphs and Thin -- Approximating the Interval Constrained Coloring Problem -- A Path Cover Technique for LCAs in Dags -- Boundary Labeling with Octilinear Leaders -- Distributed Disaster Disclosure -- Reoptimization of Steiner Trees -- On the Locality of Extracting a 2-Manifold in  -- On Metric Clustering to Minimize the Sum of Radii -- On Covering Problems of Rado -- Packing Rectangles into 2OPT Bins Using Rotations -- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees -- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs -- On a Special Co-cycle Basis of Graphs -- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs -- Spanners of Additively Weighted Point Sets -- The Kinetic Facility Location Problem -- Computing the Greedy Spanner in Near-Quadratic Time -- Parameterized Computational Complexity of Dodgson and Young Elections -- Online Compression Caching -- On Trade-Offs in External-Memory Diameter-Approximation."]
[null,"2.","Record Nr.",null,"UNISALENTO991004142089707536"]
[null,null,"Titolo",null,"Energy management and conservation handbook / edited by Frank Kreith, D. Yogi Goswami"]
[null,null,"Pubbl/distr/stampa",null,"Boca Raton : CRC Press, c2008"]
[null,null,"ISBN",null,"9781420044294"]
[{"$nulls":4},"142004429X"]
[null,null,"Descrizione fisica",null,"1 v. (various pagings) : ill., map ; 26 cm"]
[null,null,"Collana",null,"Mechanical engineering series (Boca Raton, Fla.)"]
[null,null,"Disciplina",null,"621.042"]
[null,null,"Soggetti",null,"Power resources - Handbooks, manuals, etc"]
[{"$nulls":4},"Energy conservation - Handbooks, manuals, etc"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index"]