WALCOM: Algorithms and Computation 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023, Proceedings /

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

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Korporativna značnica: SpringerLink (Online service)
Drugi avtorji: Lin, Chun-Cheng (Editor), Lin, Bertrand M. T. (Editor), Liotta, Giuseppe (Editor)
Format: Elektronski eKnjiga
Jezik:angleščina
Izdano: Cham : Springer Nature Switzerland : Imprint: Springer, 2023.
Izdaja:1st ed. 2023.
Serija:Lecture Notes in Computer Science, 13973
Teme:
Online dostop:https://doi.org/10.1007/978-3-031-27051-2
Oznake: Označite
Brez oznak, prvi označite!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-27051-2
003 DE-He213
005 20260810115325.0
007 cr nn 008mamaa
008 230217s2023 sz | o |||| 0|eng d
020 |a 9783031270512  |9 978-3-031-27051-2 
024 7 |a 10.1007/978-3-031-27051-2  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a WALCOM: Algorithms and Computation  |h [electronic resource] :  |b 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. 
250 |a 1st ed. 2023. 
264 1 |a Cham :  |b Springer Nature Switzerland :  |b Imprint: Springer,  |c 2023. 
300 |a 1 online resource (XIII, 398 p. 106 illus.).  |b 49 illus. in color. 
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 Lecture Notes in Computer Science,  |x 1611-3349 ;  |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. 
588 |a Print version record. 
650 0 |a Computer science. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Numerical analysis. 
650 0 |a Algorithms. 
650 0 |a Computer graphics. 
650 0 |a Application software. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Numerical Analysis. 
650 2 4 |a Design and Analysis of Algorithms. 
650 2 4 |a Computer Graphics. 
650 2 4 |a Computer and Information Systems Applications. 
700 1 |a Lin, Chun-Cheng.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Lin, Bertrand M. T.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Liotta, Giuseppe.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031270505 
776 0 8 |i Printed edition:  |z 9783031270529 
830 0 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 13973 
856 4 0 |u https://doi.org/10.1007/978-3-031-27051-2 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-SXPS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 
950 |a Springer Nature Proceedings Computer Science (SpringerNature-85344)