{"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":46,"n_cols":5,"rows_kept":46,"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],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,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],[17,4,17,5],[18,2,18,3],[19,2,19,3],[21,2,21,3],[22,2,22,3],[23,2,23,3],[24,2,24,3],[26,2,26,3],[40,2,40,3],[41,2,41,3],[43,2,43,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996472067103316"]
[null,null,"Titolo",null,"Information literacy in a post-truth era : 7th European Conference on Information Literacy, ECIL 2021, virtual event, September 20-23, 2021, revised selected papers / / Serap Kurbanoğlu [and four others], editors"]
[null,null,"Pubbl/distr/stampa",null,"Cham, Switzerland : , : Springer Nature Switzerland AG, , [2022]"]
[{"$nulls":4},"©2022"]
[null,null,"ISBN",null,"3-030-99885-1"]
[null,null,"Descrizione fisica",null,"1 online resource (746 pages)"]
[null,null,"Collana",null,"Communications in computer and information science ; ; 1533"]
[null,null,"Disciplina",null,"028.7071"]
[null,null,"Soggetti",null,"Data mining"]
[{"$nulls":4},"Information literacy"]
[{"$nulls":4},"Education - Data processing"]
[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,"2.","Record Nr.",null,"UNINA9910736011703321"]
[null,null,"Autore",null,"Morin Pat"]
[null,null,"Titolo",null,"Algorithms and Data Structures : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023"]
[null,null,"ISBN",null,"9783031389061"]
[{"$nulls":4},"3031389069"]
[null,null,"Edizione",null,"[1st ed. 2023.]"]
[null,null,"Descrizione fisica",null,"1 online resource (732 pages)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 1611-3349 ; ; 14079"]
[null,null,"Disciplina",null,"005.73"]
[{"$nulls":4},"003.54"]
[null,null,"Soggetti",null,"Data structures (Computer science)"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer engineering"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Data Structures and Information Theory"]
[{"$nulls":4},"Design and Analysis of Algorithms"]
[{"$nulls":4},"Computer Engineering and Networks"]
[{"$nulls":4},"Symbolic and Algebraic Manipulation"]
[{"$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,"Nota di contenuto",null,"Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum "]
[{"$nulls":4},"Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs."]
[null,null,null,"Sommario/riassunto","This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Data Structures, WADS 2023, held during July 31-August 2, 2023. The 47 regular papers, presented in this book, were carefully reviewed and selected from a total of 92 submissions. They present original research on the theory, design and application of algorithms and data structures."]