{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":3,"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":71,"n_cols":5,"rows_kept":71,"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],[32,2,32,3],[33,2,33,3],[36,2,36,3],[36,4,36,5],[37,2,37,3],[37,4,37,5],[38,2,38,3],[39,2,39,3],[40,2,40,3],[41,2,41,3],[42,2,42,3],[43,2,43,3],[44,2,44,3],[52,2,52,3],[53,2,53,3],[57,2,57,3],[59,2,59,3],[59,4,59,5],[60,2,60,3],[60,4,60,5],[61,2,61,3],[61,4,61,5],[62,2,62,3],[63,2,63,3],[64,2,64,3],[65,2,65,3],[66,2,66,3],[67,2,67,3],[68,2,68,3],[69,2,69,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996212312603316"]
[null,null,"Titolo",null,"Legal information management : journal of the British and Irish Association of Law Librarians"]
[null,null,"Pubbl/distr/stampa",null,"[London], : [Sweet & Maxwell Ltd.]"]
[null,null,"ISSN",null,"1741-2021"]
[null,null,"Descrizione fisica",null,"1 online resource"]
[null,null,"Disciplina",null,"349.42"]
[null,null,"Soggetti",null,"Law - Great Britain"]
[{"$nulls":4},"Law - Ireland"]
[{"$nulls":4},"Law libraries - Great Britain"]
[{"$nulls":4},"Law libraries - Ireland"]
[{"$nulls":4},"Legal research - Great Britain"]
[{"$nulls":4},"Legal research - Ireland"]
[{"$nulls":4},"Legal research"]
[{"$nulls":4},"Droit - Bibliothèques"]
[{"$nulls":4},"Droit - Recherche documentaire"]
[{"$nulls":4},"Droit - Grande-Bretagne"]
[{"$nulls":4},"Droit - Bibliothèques - Grande-Bretagne"]
[{"$nulls":4},"Droit - Bibliothèques - Irlande"]
[{"$nulls":4},"Droit - Recherche documentaire - Grande-Bretagne"]
[{"$nulls":4},"Droit - Recherche documentaire - Irlande"]
[{"$nulls":4},"Law"]
[{"$nulls":4},"Law libraries"]
[{"$nulls":4},"Juridische bibliotheken"]
[{"$nulls":4},"Informatiemanagement"]
[{"$nulls":4},"Rechtswetenschap"]
[{"$nulls":4},"Rechtsbronnen"]
[{"$nulls":4},"Informatiebronnen"]
[{"$nulls":4},"Periodicals."]
[{"$nulls":4},"Great Britain"]
[{"$nulls":4},"Ireland"]
[{"$nulls":4},"4.240"]
[{"$nulls":4},"4.270"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Periodico"]
[null,null,null,"Note generali","Published: Cambridge, UK: Cambridge University Press, <2004-2020>"]
[null,"2.","Record Nr.",null,"UNISA996466061103316"]
[null,null,"Titolo",null,"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006, Proceedings / / edited by Josep Diaz, Klaus Jansen, José D.P. Rolim, Uri Zwick"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006"]
[null,null,"ISBN",null,"3-540-38045-0"]
[null,null,"Edizione",null,"[1st ed. 2006.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 522 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4110"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Software engineering"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Numerical Analysis"]
[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 -- On Nontrivial Approximation of CSPs -- Analysis of Algorithms on the Cores of Random Graphs -- Contributed Talks of APPROX -- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs -- Approximating Precedence-Constrained Single Machine Scheduling by Coloring -- Minimizing Setup and Beam-On Times in Radiation Therapy -- On the Value of Preemption in Scheduling -- An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs -- Tight Results on Minimum Entropy Set Cover -- A Tight Lower Bound for the Steiner Point Removal Problem on Trees -- Single-Source Stochastic Routing -- An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem -- Online Algorithms to Minimize Resource Reallocations and Network Communication -- Weighted Sum "]
[{"$nulls":4},"Coloring in Batch Scheduling of Conflicting Jobs -- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time -- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times -- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees -- Improved Algorithms for Data Migration -- Approximation Algorithms for Graph Homomorphism Problems -- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem -- Hardness of Preemptive Finite Capacity Dial-a-Ride -- Minimum Vehicle Routing with a Common Deadline -- Stochastic Combinatorial Optimization with Controllable Risk Aversion Level -- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems -- Better Approximations for the Minimum Common Integer Partition Problem -- Contributed Talks of RANDOM -- On Pseudorandom Generators with Linear Stretch in NC0 -- A Fast Random Sampling Algorithm for Sparsifying Matrices -- The Effect of Boundary Conditions on Mixing Rates of Markov Chains -- Adaptive Sampling and Fast Low-Rank Matrix Approximation -- Robust Local Testability of Tensor Products of LDPC Codes -- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods -- Dobrushin Conditions and Systematic Scan -- Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems -- Robust Mixing -- Approximating Average Parameters of Graphs -- Local Decoding and Testing for Homomorphisms -- Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy -- Randomness-Efficient Sampling Within NC 1 -- Monotone Circuits for the Majority Function -- Space Complexity vs. Query Complexity -- Consistency of Local Density Matrices Is QMA-Complete -- On Bounded Distance Decoding for General Lattices -- Threshold Functions for Asymmetric Ramsey Properties Involving Cliques -- Distance Approximation in Bounded-Degree and General Sparse Graphs -- Fractional Matching Via Balls-and-Bins -- A Randomized Solver for Linear Systems with Exponential Convergence -- Maintaining External Memory Efficient Hash Tables."]
[null,"3.","Record Nr.",null,"UNISALENTO991003646009707536"]
[null,null,"Autore",null,"Perrucca, Angela"]
[null,null,"Titolo",null,"Peace education : contexts and values / editors James Calleja, Angela Perucca"]
[null,null,"Pubbl/distr/stampa",null,"Lecce : Edizioni Pensa MultiMedia, 1999"]
[null,null,"ISBN",null,"8882320898"]
[null,null,"Descrizione fisica",null,"436 p. ; 24 cm."]
[null,null,"Collana",null,"Intercultura ; 5"]
[null,null,"Disciplina",null,"241.642"]
[null,null,"Soggetti",null,"Pace - Aspetti educativi"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]