國立高雄大學圖資館 |

WALCOMalgorithms and computation : 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	WALCOMedited by Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen.
Reminder of title:	algorithms and computation : 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024 : proceedings /
remainder title:	WALCOM 2024
other author:	Uehara, Ryuhei.
corporate name:
Published:	Singapore :Springer Nature Singapore :2024.
Description:	xiii, 438 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Computer algorithmsCongresses.
Online resource:	https://doi.org/10.1007/978-981-97-0566-5
ISBN:	9789819705665$q(electronic bk.)

WALCOMalgorithms and computation : 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024 : proceedings /
WALCOMalgorithms and computation : 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024 : proceedings /[electronic resource] :WALCOM 2024edited by Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen. - Singapore :Springer Nature Singapore :2024. - xiii, 438 p. :ill., digital ;24 cm. - Lecture notes in computer science,145490302-9743 ;. - Lecture notes in computer science ;4891..

Recent Research Activities on Algorithmic Foundations for Social Advancement -- Reasons to Fall (More) in Love with Combinatorial Reconfiguration -- Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle -- Quantum Graph Drawing -- Simultaneous Drawing of Layered Trees -- Fully Dynamic Algorithms for Euclidean Steiner Tree -- The Parameterized Complexity of Terminal Monitoring Set -- Generating cyclic 2-Gray codes for Fibonacci q-decreasing words -- On the Hardness of Gray Code Problems for Combinatorial Objects -- On MAX-SAT with Cardinality Constraint -- Minimizing Corners in Colored Rectilinear Grids -- On Layered Area-Proportional Rectangle Contact Representations -- Short Flip Sequences to Untangle Segments in the Plane -- Improved Approximation Algorithms for Cycle and Path Packings -- Exact and Approximate Hierarchical Hub Labeling -- Reconfiguration of Multisets with Applications to Bin Packing -- The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules -- Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis -- A bisection approach to subcubic maximum induced matching -- Stable and Dynamic Minimum Cuts -- Black Hole Search in Dynamic Cactus Graph -- Recognition and Isomorphism of Proper H-graphs for unicyclic H in FPT-time -- Canonization of a random circulant graph by counting walks -- Counting Vanishing Matrix-Vector Products -- Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs -- (t,s)-completely Independent Spanning Trees -- Orientable Burning Number of Graphs -- Dichotomies for Tree Minor Containment with Structural Parameters -- Structural Parameterizations of Vertex Integrity -- On the Complexity of List H-Packing for Sparse Graph Classes.

This book constitutes the refereed proceedings of the 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, held in Kanazawa, Japan, during March 18-20, 2024. The 28 full papers presented in this book, together with two extended abstracts of invited talks, were carefully reviewed and selected from 80 submissions. They cover diverse areas of algorithms and computation, that is, approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, combinatorial reconfiguration, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.

ISBN: 9789819705665$q(electronic bk.)

Standard No.: 10.1007/978-981-97-0566-5doiSubjects--Topical Terms:

380777
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

WALCOMalgorithms and computation : 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024 : proceedings /
LDR:03977nmm a2200349 a 4500 001 662897
003 DE-He213
005 20240228121732.0
006 m d
007 cr nn 008maaau
008 241203s2024 si s 0 eng d
020 $a 9789819705665$q(electronic bk.)
020 $a 9789819705658$q(paper)
024 7 $a 10.1007/978-981-97-0566-5 $2 doi
035 $a 978-981-97-0566-5
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 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W156 2024
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a WALCOM $h [electronic resource] : $b algorithms and computation : 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024 : proceedings / $c edited by Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen.
246 3 $a WALCOM 2024
260 $a Singapore : $b Springer Nature Singapore : $b Imprint: Springer, $c 2024.
300 $a xiii, 438 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 14549
505 0 $a Recent Research Activities on Algorithmic Foundations for Social Advancement -- Reasons to Fall (More) in Love with Combinatorial Reconfiguration -- Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle -- Quantum Graph Drawing -- Simultaneous Drawing of Layered Trees -- Fully Dynamic Algorithms for Euclidean Steiner Tree -- The Parameterized Complexity of Terminal Monitoring Set -- Generating cyclic 2-Gray codes for Fibonacci q-decreasing words -- On the Hardness of Gray Code Problems for Combinatorial Objects -- On MAX-SAT with Cardinality Constraint -- Minimizing Corners in Colored Rectilinear Grids -- On Layered Area-Proportional Rectangle Contact Representations -- Short Flip Sequences to Untangle Segments in the Plane -- Improved Approximation Algorithms for Cycle and Path Packings -- Exact and Approximate Hierarchical Hub Labeling -- Reconfiguration of Multisets with Applications to Bin Packing -- The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules -- Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis -- A bisection approach to subcubic maximum induced matching -- Stable and Dynamic Minimum Cuts -- Black Hole Search in Dynamic Cactus Graph -- Recognition and Isomorphism of Proper H-graphs for unicyclic H in FPT-time -- Canonization of a random circulant graph by counting walks -- Counting Vanishing Matrix-Vector Products -- Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs -- (t,s)-completely Independent Spanning Trees -- Orientable Burning Number of Graphs -- Dichotomies for Tree Minor Containment with Structural Parameters -- Structural Parameterizations of Vertex Integrity -- On the Complexity of List H-Packing for Sparse Graph Classes.
520 $a This book constitutes the refereed proceedings of the 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, held in Kanazawa, Japan, during March 18-20, 2024. The 28 full papers presented in this book, together with two extended abstracts of invited talks, were carefully reviewed and selected from 80 submissions. They cover diverse areas of algorithms and computation, that is, approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, combinatorial reconfiguration, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.
650 0 $a Computer algorithms $v Congresses. $3 380777
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Numerical Analysis. $3 275681
650 2 4 $a Design and Analysis of Algorithms. $3 913142
650 2 4 $a Computer Graphics. $3 274515
650 2 4 $a Computer Application in Administrative Data Processing. $3 914917
700 1 $a Uehara, Ryuhei. $3 339412
700 1 $a Yamanaka, Katsuhisa. $3 975119
700 1 $a Yen, Hsu-Chun. $3 569005
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u https://doi.org/10.1007/978-981-97-0566-5
950 $a Computer Science (SpringerNature-11645)