{"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":37,"n_cols":5,"rows_kept":37,"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],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[10,2,10,3],[11,2,11,3],[14,2,14,3],[14,4,14,5],[15,2,15,3],[15,4,15,5],[16,2,16,3],[17,2,17,3],[18,2,18,3],[19,2,19,3],[20,2,20,3],[21,2,21,3],[22,2,22,3],[30,2,30,3],[31,2,31,3],[34,2,34,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISALENTO991000552029707536"]
[null,null,"Autore",null,"Unamuno, Miguel : de"]
[null,null,"Titolo",null,"Vita di Don Chisciotte e di Sancio / Miguel de Unamuno"]
[null,null,"Pubbl/distr/stampa",null,"Milano : Rizzoli, 1961"]
[null,null,"Titolo uniforme",null,"Vida de Don Quijote y Sancho segun Miguel de Cervantes Saavedra, explicada y comentada por Miguel de Unamuno 4210404"]
[null,null,"Descrizione fisica",null,"373 p. ; 16 cm"]
[null,null,"Collana",null,"BUR ; 1675/1678"]
[null,null,"Disciplina",null,"863.3"]
[null,null,"Soggetti",null,"Cervantes Saavedra, Miguel : de . Don Quijote"]
[{"$nulls":4},"Cervantes Saavedra, Miguel : de . Don Quijote"]
[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","Trad. A. Gasparetti"]
[null,"2.","Record Nr.",null,"UNINA9910506402103321"]
[null,null,"Titolo",null,"Computing and Combinatorics : 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021, Proceedings / / edited by Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021"]
[null,null,"ISBN",null,"3-030-89543-2"]
[null,null,"Edizione",null,"[1st ed. 2021.]"]
[null,null,"Descrizione fisica",null,"1 online resource (699 pages)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 13025"]
[null,null,"Disciplina",null,"003.56"]
[null,null,"Soggetti",null,"Computer science"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Data Structures and Information Theory"]
[{"$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,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Algorithms -- Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs -- All-to-All Broadcast in Dragonfly Networks -- An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences -- On Singleton Congestion Games with Resilience Against Collusion -- A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph -- Approximation Algorithms -- General Max-Min Fair Allocation -- On the approximation hardness of geodetic set and its variants -- Approximate Distance Oracles with Improved Stretch for Sparse Graphs -- Hardness and Approximation Results of Roman \\{3\\}-Domination in Graphs -- Approximation algorithms for priority Steiner tree problems -- Sublinear-Space Approximation Algorithms for Max r-SAT -- A Further Improvement on Approximating TTP-2 -- Automata -- Sequence graphs realizations and ambiguity in language models -- Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k "]
[{"$nulls":4},"Storage Automata -- Ideal Separation and General Theorems for Constrained Synchronization and their Application to Small Constraint Automata -- Most Pseudo-copy Languages Are Not Context-free -- Computational Geometry -- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set -- Deterministic metric 1-median selection with a 1 - o(1) fraction of points ignored -- The Coverage problem by Aligned Disks -- Consistent Simplification of Polyline Tree Bundles -- Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs -- Minimum Color Spanning Circle in Imprecise Setup -- Fault Tolerant Computing and Fault Diagnosis -- Reliability Evaluation of Subsystem Based on Exchanged Hypercube -- Fault diagnosability of regular networks under the Hybrid PMC model -- A Study for Conditional Diagnosability of Pancake Graphs -- A new measure for locally t-diagnosable under PMC model -- Graph Algorithms -- Colouring graphs with no induced six-vertex path or diamond -- Constructing Tri-CISTs in Shu e-Cubes -- Reconfiguring Directed Trees in a Digraph -- Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework -- Embedding Three Edge-disjoint Hamiltonian Cycles into Locally Twisted Cubes -- On the Probe Problem for (r,l)-Well-Coveredness -- Distinguishing graphs via cycles -- Graph Theory and Applications -- The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs -- The Concentration of the Maximum Degree in the Duplication-Divergence Models -- Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs -- The Weakly Dimension-balanced Pancyclicity on Toroidal Mesh Graph Tm,n when Both m and n Are Odd -- Hypercontractivity via Tensor Calculus -- Network and Algorithms -- RespectingLower Bounds in Uniform Lower and Upper Bounded Facility Location Problem -- Finding Cheapest Deadline Paths -- Approximate the Lower-Bounded Connected Facility Location Problem -- Mechanism Design for Facility Location with Fractional Preferences and Minimum Distance -- Online Algorithm and Streaming Algorithms -- On the Hardness of Opinion Dynamics Optimization with L1-Budget on Varying Susceptibility to Persuasion -- Symmetric Norm Estimation and Regression on Sliding Windows -- Single-Pass Streaming Algorithms to Partition Graphs into Few Forests -- The Secretary Problem with Reservation Costs -- Online Ride-Hitching in UAV Travelling -- Parameterized Complexity and Algorithms Disconnected Matchings -- On the d-Claw Vertex Deletion Problem -- Constrained Hitting Set Problem with Intervals -- Exact algorithms for maximum weighted independent set on sparse graphs -- Recreational Games -- Two Standard Decks of Playing Cards are Sufficient for a ZKP for Sudoku.-Token Shifting on Graphs -- Computational Complexity of Jumping Block Puzzles -- A Card-minimal Three-Input AND Protocol Using Two Shuffles -- Spy game: FPT-algorithm and results on graph products -- ."]
[null,null,null,"Sommario/riassunto","This book constitutes the proceedings of the 27th International Conference on Computing and Combinatorics, COCOON 2021, held in Tainan, Taiwan, in October 2021. Due to the COVID-19 pandemic, COCOON 2021 was organized as a hybrid conference. The 56 papers presented in this volume were carefully reviewed and selected from 131 submissions. The papers are divided into the following topical sub-headings: algorithms, approximation algorithms, automata, computational geometry, fault tolerant computing and fault diagnosis, graph algorithms, graph theory and applications, network and algorithms, online algorithm and stream algorithms, parameterized complexity and algorithms, and recreational games."]