{"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":29,"n_cols":5,"rows_kept":29,"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],[20,2,20,3],[21,2,21,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910146568503321"]
[null,null,"Titolo",null,"Algorithms - ESA 2008 : 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, Proceedings / / edited by Kurt Mehlhorn"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008"]
[null,null,"ISBN",null,"3-540-87744-4"]
[null,null,"Edizione",null,"[1st ed. 2008.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XVII, 844 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5193"]
[null,null,"Disciplina",null,"511.8"]
[null,null,"Soggetti",null,"Computer programming"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Numerical Analysis"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[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","\"EATCS\"--Cover."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Lectures -- Flexible Path Planning Using Corridor Maps -- A Bridging Model for Multi-core Computing -- Contributed Papers -- Robust Kinetic Convex Hulls in 3D -- On Dominance Reporting in 3D -- Stabbing Convex Polygons with a Segment or a Polygon -- An Efficient Algorithm for 2D Euclidean 2-Center with Outliers -- A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry -- Cache-Oblivious Red-Blue Line Segment Intersection -- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains -- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces -- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem -- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs -- Straight Skeletons of Three-"]
[{"$nulls":4},"Dimensional Polyhedra -- Randomized Competitive Analysis for Two-Server Problems -- Decompositions and Boundary Coverings of Non-convex Fat Polyhedra -- Approximating Multi-criteria Max-TSP -- An Integer Programming Algorithm for Routing Optimization in IP Networks -- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling -- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree -- Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors -- A Practical Quicksort Algorithm for Graphics Processors -- Bloomier Filters: A Second Look -- Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy -- A New Approach to Exact Crossing Minimization -- A Characterization of 2-Player Mechanisms for Scheduling -- A Local-Search 2-Approximation for 2-Correlation-Clustering -- The Alcuin Number of a Graph -- Time-Dependent SHARC-Routing -- Detecting Regular Visit Patterns -- Improved Approximation Algorithms for Relay Placement.-Selfish Bin Packing -- Improved Randomized Results for That Interval Selection Problem -- Succinct Representations of Arbitrary Graphs -- Edge Coloring and Decompositions of Weighted Graphs -- The Complexity of Sorting with Networks of Stacks and Queues -- Faster Steiner Tree Computation in Polynomial-Space -- Fitting a Step Function to a Point Set -- Faster Swap Edge Computation in Minimum Diameter Spanning Trees -- The Partial Augment–Relabel Algorithm for the Maximum Flow Problem -- An Optimal Dynamic Spanner for Doubling Metric Spaces -- RFQ: Redemptive Fair Queuing -- Range Medians -- Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves -- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison -- On the Complexity of Optimal Hotlink Assignment -- Oblivious Randomized Direct Search for Real-Parameter Optimization -- Path Minima in Incremental Unrooted Trees -- Improved Competitive Performance Bounds for CIOQ Switches -- Two-Stage Robust Network Design with Exponential Scenarios -- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection -- More Robust Hashing: Cuckoo Hashing with a Stash -- Better and Simpler Approximation Algorithms for the Stable Marriage Problem -- Edit Distances and Factorisations of Even Permutations -- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count -- Facility Location in Dynamic Geometric Data Streams -- The Effects of Local Randomness in the Adversarial Queueing Model -- Parallel Imaging Problem -- An Online Algorithm for Finding the Longest Previous Factors -- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions -- Improved BDD Algorithms for the Simulation of Quantum Circuits -- Mobile Route Planning -- How Reliable Are Practical Point-in-PolygonStrategies? -- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach -- Approximability of Average Completion Time Scheduling on Unrelated Machines -- Relative Convex Hulls in Semi-dynamic Subdivisions -- An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms -- On the Size of the 3D Visibility Skeleton: Experimental Results -- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions -- Deterministic Sampling Algorithms for Network Design."]
[null,null,null,"Sommario/riassunto","This book constitutes the refereed proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008. The 67 revised full papers presented together with 2 invited lectures were carefully reviewed and selected: 51 papers "]
[{"$nulls":4},"out of 147 submissions for the design and analysis track and 16 out of 53 submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields. Special focus is given to mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics and network optimization."]