東華大學圖書館 |

WALCOM = algorithms and computation : 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	WALCOM/ edited by Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta.
其他題名:	algorithms and computation : 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings /
其他題名:	WALCOM 2023
其他作者:	Lin, Chun-Cheng.
團體作者:	WALCOM (Workshop)
出版者:	Cham :Springer Nature Switzerland : : 2023.,
面頁冊數:	xiii, 398 p. :ill. (some col.), digital ;24 cm.
內容註:	Invited Talks -- Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult -- The Family of Fan-planar Graphs -- Computational Geometry -- Minimum Ply Covering of Points with Unit Squares -- Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms -- Flipping Plane Spanning Paths -- Away from Each Other -- Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree -- Reflective Guarding a Gallery -- Improved and Generalized Algorithms for Burning a Planar Point Set -- On the Longest Flip Sequence to Untangle Segments in the Plane -- String Algorithm -- Inferring Strings from Position Heaps in Linear Time -- Internal Longest Palindrome Queries in Optimal Time -- Finding the Cyclic Covers of a String -- Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs -- Optimization -- Better Hardness Results for the Minimum Spanning Tree Congestion Problem -- Energy Efficient Sorting, Selection and Searching -- Reconfiguration of Vertex-disjoint Shortest Paths on Graphs -- k-Transmitter Watchman Routes -- Graph Algorithm -- Splitting Plane Graphs to Outerplanarity -- Certifying Induced Subgraphs in Large Graphs -- Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs -- On the Complexity of Distance-d Independent Set Reconfiguration -- On Star-multi-interval Pairwise Compatibility Graphs -- Parameterized Complexity of Optimizing List Vertex-Coloring through Reconfiguration -- Parameterized Complexity of Path Set Packing -- Approximation Algorithm -- Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput -- Recognizing When a Preference System Is Close to Admitting a Master List -- Groups Burning: Analyzing Spreading Processes in Community-based Networks -- Roman k-domination:Hardness, Approximation and Parameterized Results -- Parameterized Complexity -- On the Parameterized Complexity of Compact Set Packing -- Structural Parameterization of Cluster Deletion -- Parity Permutation Pattern Matching.
Contained By:	Springer Nature eBook
標題:	Computer algorithms - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-031-27051-2
ISBN:	9783031270512

WALCOM = algorithms and computation : 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings /
WALCOMalgorithms and computation : 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings /[electronic resource] :WALCOM 2023edited by Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta. - Cham :Springer Nature Switzerland :2023. - xiii, 398 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,139730302-9743 ;. - Lecture notes in computer science ;13973..

Invited Talks -- Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult -- The Family of Fan-planar Graphs -- Computational Geometry -- Minimum Ply Covering of Points with Unit Squares -- Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms -- Flipping Plane Spanning Paths -- Away from Each Other -- Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree -- Reflective Guarding a Gallery -- Improved and Generalized Algorithms for Burning a Planar Point Set -- On the Longest Flip Sequence to Untangle Segments in the Plane -- String Algorithm -- Inferring Strings from Position Heaps in Linear Time -- Internal Longest Palindrome Queries in Optimal Time -- Finding the Cyclic Covers of a String -- Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs -- Optimization -- Better Hardness Results for the Minimum Spanning Tree Congestion Problem -- Energy Efficient Sorting, Selection and Searching -- Reconfiguration of Vertex-disjoint Shortest Paths on Graphs -- k-Transmitter Watchman Routes -- Graph Algorithm -- Splitting Plane Graphs to Outerplanarity -- Certifying Induced Subgraphs in Large Graphs -- Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs -- On the Complexity of Distance-d Independent Set Reconfiguration -- On Star-multi-interval Pairwise Compatibility Graphs -- Parameterized Complexity of Optimizing List Vertex-Coloring through Reconfiguration -- Parameterized Complexity of Path Set Packing -- Approximation Algorithm -- Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput -- Recognizing When a Preference System Is Close to Admitting a Master List -- Groups Burning: Analyzing Spreading Processes in Community-based Networks -- Roman k-domination:Hardness, Approximation and Parameterized Results -- Parameterized Complexity -- On the Parameterized Complexity of Compact Set Packing -- Structural Parameterization of Cluster Deletion -- Parity Permutation Pattern Matching.

This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.

ISBN: 9783031270512

Standard No.: 10.1007/978-3-031-27051-2doiSubjects--Topical Terms:

576357
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

WALCOM = algorithms and computation : 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings /
LDR:03696nmm a2200349 a 4500 001 2340923
003 DE-He213
005 20240319235521.0
006 m d
007 cr nn 008maaau
008 240813s2023 sz s 0 eng d
020 $a 9783031270512 $q (electronic bk.)
020 $a 9783031270505 $q (paper)
024 7 $a 10.1007/978-3-031-27051-2 $2 doi
035 $a 978-3-031-27051-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacshf
072 7 $a UYA $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W156 2023
111 2 $a WALCOM (Workshop) $n (17th : $d 2023 : $c Hsinchu, Taiwan) $3 3678354
245 1 0 $a WALCOM $h [electronic resource] : $b algorithms and computation : 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings / $c edited by Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta.
246 3 $a WALCOM 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a xiii, 398 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13973
505 0 $a Invited Talks -- Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult -- The Family of Fan-planar Graphs -- Computational Geometry -- Minimum Ply Covering of Points with Unit Squares -- Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms -- Flipping Plane Spanning Paths -- Away from Each Other -- Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree -- Reflective Guarding a Gallery -- Improved and Generalized Algorithms for Burning a Planar Point Set -- On the Longest Flip Sequence to Untangle Segments in the Plane -- String Algorithm -- Inferring Strings from Position Heaps in Linear Time -- Internal Longest Palindrome Queries in Optimal Time -- Finding the Cyclic Covers of a String -- Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs -- Optimization -- Better Hardness Results for the Minimum Spanning Tree Congestion Problem -- Energy Efficient Sorting, Selection and Searching -- Reconfiguration of Vertex-disjoint Shortest Paths on Graphs -- k-Transmitter Watchman Routes -- Graph Algorithm -- Splitting Plane Graphs to Outerplanarity -- Certifying Induced Subgraphs in Large Graphs -- Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs -- On the Complexity of Distance-d Independent Set Reconfiguration -- On Star-multi-interval Pairwise Compatibility Graphs -- Parameterized Complexity of Optimizing List Vertex-Coloring through Reconfiguration -- Parameterized Complexity of Path Set Packing -- Approximation Algorithm -- Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput -- Recognizing When a Preference System Is Close to Admitting a Master List -- Groups Burning: Analyzing Spreading Processes in Community-based Networks -- Roman k-domination:Hardness, Approximation and Parameterized Results -- Parameterized Complexity -- On the Parameterized Complexity of Compact Set Packing -- Structural Parameterization of Cluster Deletion -- Parity Permutation Pattern Matching.
520 $a This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.
650 0 $a Computer algorithms $x Congresses. $3 576357
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Numerical Analysis. $3 892626
650 2 4 $a Design and Analysis of Algorithms. $3 3538532
650 2 4 $a Computer Graphics. $3 892532
650 2 4 $a Computer and Information Systems Applications. $3 3538505
700 1 $a Lin, Chun-Cheng. $3 3460979
700 1 $a Lin, Bertrand M. T. $3 3678355
700 1 $a Liotta, Giuseppe. $3 3678356
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13973. $3 3678357
856 4 0 $u https://doi.org/10.1007/978-3-031-27051-2
950 $a Computer Science (SpringerNature-11645)