000 04634nam a22006015i 4500
001 978-3-030-75242-2
003 DE-He213
005 20240730175718.0
007 cr nn 008mamaa
008 210504s2021 sz | s |||| 0|eng d
020 _a9783030752422
_9978-3-030-75242-2
024 7 _a10.1007/978-3-030-75242-2
_2doi
050 4 _aQA9.58
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.13
_223
245 1 0 _aAlgorithms and Complexity
_h[electronic resource] :
_b12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings /
_cedited by Tiziana Calamoneri, Federico Corò.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXI, 410 p. 33 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12701
505 0 _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.
520 _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.
650 0 _aAlgorithms.
_93390
650 0 _aComputer graphics.
_94088
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aComputer systems.
_9117632
650 0 _aArtificial intelligence.
_93407
650 1 4 _aDesign and Analysis of Algorithms.
_931835
650 2 4 _aComputer Graphics.
_94088
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
650 2 4 _aComputer System Implementation.
_938514
650 2 4 _aArtificial Intelligence.
_93407
700 1 _aCalamoneri, Tiziana.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9117633
700 1 _aCorò, Federico.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9117634
710 2 _aSpringerLink (Online service)
_9117635
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030752415
776 0 8 _iPrinted edition:
_z9783030752439
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12701
_9117636
856 4 0 _uhttps://doi.org/10.1007/978-3-030-75242-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90027
_d90027