LEADER 04887nam 22007815 450 001 9910483444703321 005 20240708153550.0 010 $a3-030-75242-9 024 7 $a10.1007/978-3-030-75242-2 035 $a(CKB)4100000011918707 035 $a(DE-He213)978-3-030-75242-2 035 $a(MiAaPQ)EBC6606009 035 $a(Au-PeEL)EBL6606009 035 $a(OCoLC)1250081915 035 $a(PPN)255881428 035 $a(EXLCZ)994100000011918707 100 $a20210504d2021 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Complexity $e12th International Conference, CIAC 2021, Virtual Event, May 10?12, 2021, Proceedings /$fedited by Tiziana Calamoneri, Federico Corò 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (XI, 410 p. 33 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12701 311 $a3-030-75241-0 320 $aIncludes bibliographical references and index. 327 $aAbundant Extensions -- Three Problems on Well-Partitioned Chordal Graphs -- Distributed Distance-r Covering Problems on Sparse High-Girth Graphs -- Reconfiguration of Connected Graph Partitions via Recombination -- Algorithms for Energy Conservation in Heterogeneous Data Centers -- On Vertex-Weighted Graph Realizations -- On the Role of 3's for the 1-2-3 Conjecture -- Upper Tail Analysis of Bucket Sort and Random Tries -- Throughput Scheduling with Equal Additive Laxity -- Fragile Complexity of Adaptive Algorithms -- FPT and Kernelization Algorithms for the Induced Tree Problem -- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs -- Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation -- A Multistage View on 2-Satisfiability -- The Weisfeiler-Leman Algorithm and Recognition of Graph Properties -- The Parameterized Suffix Tray -- Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity -- Covering a Set of Line Segments with a Few Squares -- Circumventing Connectivity for Kernelization -- Online and Approximate Network Construction from Bounded Connectivity Constraints -- Globally Rigid Augmentation of Minimally Rigid Graphs in \(R^2\) -- Extending Partial Representations of Rectangular Duals with Given Contact Orientations -- Can Local Optimality be Used for Efficient Data Reduction -- Colouring Graphs of Bounded Diameter in the Absence of Small Cycles -- Online Two-Dimensional Vector Packing with Advice -- Temporal Matching on Geometric Graph Data. 330 $aThis book constitutes the refereed conference proceedings of the 12th International Conference on Algorithms and Complexity, CIAC 2019, held as a virtual event, in May 2021. The 28 full papers presented together with one invited lecture and 2 two abstracts of invited lectures were carefully reviewed and selected from 78 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity. Due to the Corona pandemic the conference was held virtually. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12701 606 $aAlgorithms 606 $aComputer graphics 606 $aComputer science?Mathematics 606 $aComputer systems 606 $aArtificial intelligence 606 $aDesign and Analysis of Algorithms 606 $aComputer Graphics 606 $aSymbolic and Algebraic Manipulation 606 $aComputer System Implementation 606 $aArtificial Intelligence 606 $aAlgorismes$2thub 606 $aComplexitat computacional$2thub 608 $aCongressos$2thub 608 $aLlibres electrònics$2thub 615 0$aAlgorithms. 615 0$aComputer graphics. 615 0$aComputer science?Mathematics. 615 0$aComputer systems. 615 0$aArtificial intelligence. 615 14$aDesign and Analysis of Algorithms. 615 24$aComputer Graphics. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aComputer System Implementation. 615 24$aArtificial Intelligence. 615 7$aAlgorismes 615 7$aComplexitat computacional 676 $a511.8 702 $aCalamoneri$b Tiziana 702 $aCoro?$b Federico 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483444703321 996 $aAlgorithms and Complexity$93241163 997 $aUNINA