國立虎尾科技大學 |

WALCOM: Algorithms and Computation = 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	WALCOM: Algorithms and Computation/ edited by Petra Mutzel, Md. Saidur Rahman, Slamin.
其他題名:	16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings /
其他作者:	Mutzel, Petra.
面頁冊數:	XVIII, 424 p. 138 illus., 96 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer science. -
電子資源:	https://doi.org/10.1007/978-3-030-96731-4
ISBN:	9783030967314

WALCOM: Algorithms and Computation = 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings /
WALCOM: Algorithms and Computation16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings /[electronic resource] :edited by Petra Mutzel, Md. Saidur Rahman, Slamin. - 1st ed. 2022. - XVIII, 424 p. 138 illus., 96 illus. in color.online resource. - Theoretical Computer Science and General Issues,131742512-2029 ;. - Theoretical Computer Science and General Issues,12865.

Invited Talks -- Some Problems Related to the Space of Optimal Tree Reconciliations -- From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability -- Invitation to Combinatorial Reconfiguration -- Combinatorial Reconfiguration -- Reconfiguration of Regular Induced Subgraphs -- Traversability, Reconfiguration, and Reachability in the Gadget Framework -- 1-Complex $ s,t $ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids -- Graph Drawing and Visualization -- Aspect Ratio Universal Rectangular Layouts -- Morphing tree drawings in a small 3D grid -- StreamTable: An Area Proportional Visualization for Tables with Flowing Streams -- Vertex-to-Point Conflict-Free Chromatic Guarding is NP-hard -- The Polygon Burning Problem -- Reverse Shortest Path Problem in Weighted Unit-Disk Graphs -- Computational Complexity -- Happy Set Problem on Subclasses of Co-comparability Graphs -- Finding Geometric Representations of Apex Graphs is NP-Hard -- The Complexity of L(p,q)-Edge-Labelling -- Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets -- Online and Property Testing -- An Optimal Tester for k-Linear -- Machine Learning Advised Ski Rental Problem with a Discount -- Parameterized Complexity -- On the Harmless Set Problem Parameterized by Treewidth -- Isomorphism Testing for T -graphs in FPT -- Parameterized algorithms for Steiner Tree and Dominating Set: bounding the leafage by the vertex leafage -- Parameterized complexity of reconfiguration of atoms -- Parameterized Complexity of Immunization in the Threshold Model -- Parameterized Complexity of Minimum Membership Dominating Set -- Graph Algorithms -- Finding popular branchings in vertex-weighted digraphs -- Vertex-Weighted Graphs: Realizable and Unrealizable Domains -- Hypergraph Representation via Axis-Aligned Point-Subspace Cover -- Structural Parameterizations of Budgeted Graph Coloring -- Counting and Sampling Orientations on Chordal Graphs -- Minimum t-spanners on subcubic graphs -- Approximation Algorithms -- Approximating the Bundled Crossing Number -- Path Cover Problems with Length Cost -- On approximating shortest paths in weighted triangular tessellations.

This book constitutes the proceedings of the 16th International Conference on Algorithms and Computation, WALCOM 2022, which was held in Jember, Indonesia, during March 24-26, 2022. This proceedings volume contains 30 full papers which were carefully reviewed and selected from a total of 89 submissions and 3 invited papers. They cover diverse areas of algorithms and computation, such as approximation algorithms, computational complexity, computational geometry, graph algorithms, graph drawing and visualization, online algorithms, parameterized complexity and property testing.

ISBN: 9783030967314

Standard No.: 10.1007/978-3-030-96731-4doiSubjects--Topical Terms:

573171
Computer science.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

WALCOM: Algorithms and Computation = 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings /
LDR:04332nam a22004095i 4500 001 1090543
003 DE-He213
005 20220222181225.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783030967314 $9 978-3-030-96731-4
024 7 $a 10.1007/978-3-030-96731-4 $2 doi
035 $a 978-3-030-96731-4
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 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings / $c edited by Petra Mutzel, Md. Saidur Rahman, Slamin.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XVIII, 424 p. 138 illus., 96 illus. in color. $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 13174
505 0 $a Invited Talks -- Some Problems Related to the Space of Optimal Tree Reconciliations -- From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability -- Invitation to Combinatorial Reconfiguration -- Combinatorial Reconfiguration -- Reconfiguration of Regular Induced Subgraphs -- Traversability, Reconfiguration, and Reachability in the Gadget Framework -- 1-Complex $ s,t $ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids -- Graph Drawing and Visualization -- Aspect Ratio Universal Rectangular Layouts -- Morphing tree drawings in a small 3D grid -- StreamTable: An Area Proportional Visualization for Tables with Flowing Streams -- Vertex-to-Point Conflict-Free Chromatic Guarding is NP-hard -- The Polygon Burning Problem -- Reverse Shortest Path Problem in Weighted Unit-Disk Graphs -- Computational Complexity -- Happy Set Problem on Subclasses of Co-comparability Graphs -- Finding Geometric Representations of Apex Graphs is NP-Hard -- The Complexity of L(p,q)-Edge-Labelling -- Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets -- Online and Property Testing -- An Optimal Tester for k-Linear -- Machine Learning Advised Ski Rental Problem with a Discount -- Parameterized Complexity -- On the Harmless Set Problem Parameterized by Treewidth -- Isomorphism Testing for T -graphs in FPT -- Parameterized algorithms for Steiner Tree and Dominating Set: bounding the leafage by the vertex leafage -- Parameterized complexity of reconfiguration of atoms -- Parameterized Complexity of Immunization in the Threshold Model -- Parameterized Complexity of Minimum Membership Dominating Set -- Graph Algorithms -- Finding popular branchings in vertex-weighted digraphs -- Vertex-Weighted Graphs: Realizable and Unrealizable Domains -- Hypergraph Representation via Axis-Aligned Point-Subspace Cover -- Structural Parameterizations of Budgeted Graph Coloring -- Counting and Sampling Orientations on Chordal Graphs -- Minimum t-spanners on subcubic graphs -- Approximation Algorithms -- Approximating the Bundled Crossing Number -- Path Cover Problems with Length Cost -- On approximating shortest paths in weighted triangular tessellations.
520 $a This book constitutes the proceedings of the 16th International Conference on Algorithms and Computation, WALCOM 2022, which was held in Jember, Indonesia, during March 24-26, 2022. This proceedings volume contains 30 full papers which were carefully reviewed and selected from a total of 89 submissions and 3 invited papers. They cover diverse areas of algorithms and computation, such as approximation algorithms, computational complexity, computational geometry, graph algorithms, graph drawing and visualization, online algorithms, parameterized complexity and property testing.
650 0 $a Computer science. $3 573171
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Information theory. $3 595305
650 0 $a Computer graphics. $3 561602
650 0 $a Computer engineering. $3 569006
650 0 $a Computer networks . $3 1365720
650 1 4 $a Theory of Computation. $3 669322
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Computer Graphics. $3 669895
650 2 4 $a Computer Engineering and Networks. $3 1365733
700 1 $a Mutzel, Petra. $e editor. $1 https://orcid.org/0000-0001-7621-971X $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1397975
700 1 $a Rahman, Md. Saidur. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 678734
700 1 $a Slamin. $e editor. $1 https://orcid.org/0000-0002-1280-8037 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1397976
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030967307
776 0 8 $i Printed edition: $z 9783030967321
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-96731-4
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)