{"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":42,"n_cols":5,"rows_kept":42,"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],[9,2,9,3],[11,2,11,3],[12,2,12,3],[15,2,15,3],[15,4,15,5],[16,2,16,3],[16,4,16,5],[17,2,17,3],[18,2,18,3],[19,2,19,3],[20,2,20,3],[21,2,21,3],[22,2,22,3],[23,2,23,3],[34,2,34,3],[35,2,35,3],[38,2,38,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA990001068420203316"]
[null,null,"Titolo",null,"Veio, Cerveteri, Vulci : città d'Etruria a confronto : Roma, Museo Nazionale Etrusco di Villa Giulia, Villa Poniatowski, 1 ottobre-30 dicembre 2001 : catalogo della Mostra / a cura di Anna Maria Moretti Sgubini"]
[null,null,"Pubbl/distr/stampa",null,"Roma, : L'Erma di Bretschneider, 2001"]
[null,null,"ISBN",null,"88-8265-174-6"]
[null,null,"Descrizione fisica",null,"XIX, carte di tav., 275 p. : ill. ; 31 cm"]
[null,null,"Disciplina",null,"937.5"]
[null,null,"Soggetti",null,"Archeologia - Veio"]
[{"$nulls":4},"Archeologia - Cerveteri"]
[{"$nulls":4},"Archeologia - Vulci"]
[null,null,"Collocazione",null,"XI.1.B. 157(X B 447)"]
[{"$nulls":4},"I MO ROM 15"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","In testa al frontespizio: Soprintendenza archeologica per l'Etruria meridionale"]
[null,"2.","Record Nr.",null,"UNINA9910513691603321"]
[null,null,"Titolo",null,"Combinatorial Optimization and Applications : 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings / / edited by Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021"]
[null,null,"ISBN",null,"3-030-92681-8"]
[null,null,"Edizione",null,"[1st ed. 2021.]"]
[null,null,"Descrizione fisica",null,"1 online resource (726 pages)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 13135"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computer science"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Data Structures and Information Theory"]
[{"$nulls":4},"Mathematics of Computing"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$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","Includes index."]
[null,null,"Nota di contenuto",null,"Routing among Convex Polygonal Obstacles in the Plane -- Target Coverage with Minimized Number of Camera Sensors -- Two-Stage Submodular Maximization under Curvature -- An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem -- The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision Making -- Which Option is a Better Way to Improve Transfer Learning Performance ? -- On Maximizing the Difference between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint -- On Various Open-End Bin Packing Game -- A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions -- Approximation Algorithms for Two "]
[{"$nulls":4},"Parallel Dedicated Machine Scheduling with Conflict Constraints -- Computing the One-Visibility Cop-Win Strategies for Trees -- Complexity and Approximation Results on the Shared Transportation Problem -- The complexity of finding optimal subgraphs to represent spatial correlation -- New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem -- Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems -- Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds -- Two-Stage Stochastic Max-Weight Independent Set Problems -- Routing and Scheduling Problems with Two Agents on a Line-Shaped Network -- The Price of Anarchy of Generic Valid Utility Systems -- Single Machine Scheduling with Rejection and Generalized Parameters -- Approximation Algorithm and Hardness Results for Defensive Domination in Graphs -- An Improved Physical ZKP for Nonogram -- Finding All Leftmost Separators of Size $\\leq k$ -- Maximize the Probability of Union-Influenced in Social Networks -- A Novel Algorithm for Max Sat Calling MOCE to Order -- The Smallest Number of Vertices in a 2-Arc-Strong Digraph without Pair of Arc-Disjoint in- and out-Branchings -- Generalized Self-Profit Maximization in Attribute Networks -- Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-Hierarchy Classes -- Maximization of Monotone Non-Submodular Functions with a Knapsack Constraint over the Integer Lattice -- Sublinear-time Reductions for Big Data Computing -- Capacitated Partial Inverse Maximum Spanning Tree under the Weighted $l_{\\infty}$-Norm -- Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems -- Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs -- Streaming Submodular Maximization under Differential Privacy Noise -- Online Bottleneck Semi-Matching -- Optimal Due Date Assignment without Restriction and Convex Resource Allocation in Group Technology Scheduling -- Constrained Stable Marriage with Free edges or Few Blocking Pairs -- Backgammon is Hard -- Two-Facility Location Games with a Minimum Distance Requirement on a Circle -- Open Shop Scheduling Problem with a Non-Resumable Flexible Maintenance Period -- Parallel Algorithm For Minimum Partial Dominating Set In Unit Disk Graph -- An Improved Approximation Algorithm for Squared Metric k-Facility Location -- Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number -- The Fractional k-Truncated Metric Dimension of Graphs -- On Structural Parameterizations of the Offensive Alliance Problem -- On the k-colored Rainbow Sets in Fixed Dimensions -- Cycle-Connected Mixed Graphs and Related Problems -- Directed width parameters on semicomplete digraphs -- Improved Parameterized Approximation for Balanced k-Median -- A LP-Based Approximation Algorithm for Generalized Traveling Salesperson Path Problem -- Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs -- Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers -- Delay-Constrained Minimum Shortest Path Trees and Related Problems -- On the Feedback Number of 3-Uniform Linear Extremal Hypergraph -- A Multi-Pass Streaming Algorithm for Regularized Submodular Maximization."]
[null,null,null,"Sommario/riassunto","This book constitutes the refereed proceedings of the 15th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2021, which took place in Tianjin, China, during December 17-19, 2021. The 55 papers presented in this volume were carefully reviewed and selected from 122 submissions. They deal with combinatorial optimization and its applications in general, focusing on "]
[{"$nulls":4},"algorithms design, theoretical and experimental analysis, and applied research of general algorithmic interest."]