{"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":26,"n_cols":5,"rows_kept":26,"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]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465548503316"]
[null,null,"Titolo",null,"Algorithmic Aspects in Information and Management [[electronic resource] ] : 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009, Proceedings / / edited by Andrew Goldberg, Yunhong Zhou"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009"]
[null,null,"ISBN",null,"3-642-02158-1"]
[null,null,"Edizione",null,"[1st ed. 2009.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 327 p.)"]
[null,null,"Collana",null,"Information Systems and Applications, incl. Internet/Web, and HCI ; ; 5564"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Computer programming"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Data Structures"]
[{"$nulls":4},"Numeric Computing"]
[{"$nulls":4},"Mathematics of Computing"]
[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,"Algorithmic Challenge in Online Advertising -- Parallel Algorithms for Collaborative Filtering -- On the Approximability of Some Haplotyping Problems -- On Acyclicity of Games with Cycles -- Discrete online TSP -- On Approximating an Implicit Cover Problem in Biology -- Power Indices in Spanning Connectivity Games -- Efficiently Generating k-Best Solutions to Procurement Auctions -- Integer Polyhedra for Program Analysis -- Line Segment Facility Location in Weighted Subdivisions -- Algorithms for Placing Monitors in a Flow Network -- Three Results on Frequency Assignment in Linear Cellular Networks -- Link Distance and Shortest Path Problems in the Plane -- Orca Reduction and ContrAction Graph Clustering -- Equiseparability on Terminal Wiener Index -- Effective Tour Searching for TSP by Contraction of Pseudo Backbone "]
[{"$nulls":4},"Edges -- Optimal Auctions Capturing Constraints in Sponsored Search -- A Note on Estimating Hybrid Frequency Moment of Data Streams -- Two-Level Push-Relabel Algorithm for the Maximum Flow Problem -- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing -- Dynamic Position Auctions with Consumer Search -- Nonlinear Optimization over a Weighted Independence System -- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers -- Latency Constrained Aggregation in Chain Networks Admits a PTAS -- Cutting a Cake for Five People -- PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications -- On Job Scheduling with Preemption Penalties."]