000 05106nam a22006495i 4500
001 978-3-031-27051-2
003 DE-He213
005 20240730175831.0
007 cr nn 008mamaa
008 230217s2023 sz | s |||| 0|eng d
020 _a9783031270512
_9978-3-031-27051-2
024 7 _a10.1007/978-3-031-27051-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aWALCOM: Algorithms and Computation
_h[electronic resource] :
_b17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings /
_cedited by Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta.
250 _a1st ed. 2023.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2023.
300 _aXIII, 398 p. 106 illus., 49 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13973
505 0 _aInvited 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 _aThis 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 _aComputer science.
_99832
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aAlgorithms.
_93390
650 0 _aComputer graphics.
_94088
650 0 _aApplication software.
_9117998
650 1 4 _aTheory of Computation.
_9117999
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aDesign and Analysis of Algorithms.
_931835
650 2 4 _aComputer Graphics.
_94088
650 2 4 _aComputer and Information Systems Applications.
_9118000
700 1 _aLin, Chun-Cheng.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9118001
700 1 _aLin, Bertrand M. T.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9118002
700 1 _aLiotta, Giuseppe.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9118003
710 2 _aSpringerLink (Online service)
_9118004
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031270505
776 0 8 _iPrinted edition:
_z9783031270529
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13973
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-27051-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90067
_d90067