國立虎尾科技大學 |

Algorithms and Complexity = 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithms and Complexity/ edited by Tiziana Calamoneri, Federico Corò.
其他題名:	12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings /
其他作者:	Calamoneri, Tiziana.
面頁冊數:	XI, 410 p. 33 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-030-75242-2
ISBN:	9783030752422

Algorithms and Complexity = 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings /
Algorithms and Complexity12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings /[electronic resource] :edited by Tiziana Calamoneri, Federico Corò. - 1st ed. 2021. - XI, 410 p. 33 illus.online resource. - Theoretical Computer Science and General Issues,127012512-2029 ;. - Theoretical Computer Science and General Issues,12865.

Abundant 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.

This 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.

ISBN: 9783030752422

Standard No.: 10.1007/978-3-030-75242-2doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA9.58

Dewey Class. No.: 005.13

Algorithms and Complexity = 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings /
LDR:03767nam a22004095i 4500 001 1059274
003 DE-He213
005 20220222232152.0
007 cr nn 008mamaa
008 220414s2021 sz | s |||| 0|eng d
020 $a 9783030752422 $9 978-3-030-75242-2
024 7 $a 10.1007/978-3-030-75242-2 $2 doi
035 $a 978-3-030-75242-2
050 4 $a QA9.58
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.13 $2 23
245 1 0 $a Algorithms and Complexity $h [electronic resource] : $b 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings / $c edited by Tiziana Calamoneri, Federico Corò.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XI, 410 p. 33 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12701
505 0 $a Abundant 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 $a This 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 $a Algorithms. $3 527865
650 0 $a Computer graphics. $3 561602
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computer systems. $3 559862
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Design and Analysis of Algorithms. $3 1365721
650 2 4 $a Computer Graphics. $3 669895
650 2 4 $a Symbolic and Algebraic Manipulation. $3 669944
650 2 4 $a Computer System Implementation. $3 669803
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Calamoneri, Tiziana. $e editor. $1 https://orcid.org/0000-0002-4099-1836 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1358599
700 1 $a Corò, Federico. $e editor. $1 https://orcid.org/0000-0002-7321-3467 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1358600
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030752415
776 0 8 $i Printed edition: $z 9783030752439
830 0 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12865 $3 1365719
856 4 0 $u https://doi.org/10.1007/978-3-030-75242-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)