東華大學圖書館 |

WALCOM = algorithms and computation : 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 - March 2, 2025 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	WALCOM/ edited by Shin-ichi Nakano, Mingyu Xiao.
其他題名:	algorithms and computation : 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 - March 2, 2025 : proceedings /
其他題名:	WALCOM 2025
其他作者:	Nakano, Shin-ichi.
團體作者:	WALCOM (Workshop)
出版者:	Singapore :Springer Nature Singapore : : 2025.,
面頁冊數:	xxi, 426 p. :ill. (some col.), digital ;24 cm.
內容註:	Parameterized Voter Relevance in Facility Location Games with Tree Shaped Invitation Graphs -- Proportionally dense subgraphs parameterized hardness and efficiently solvable cases -- Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons -- On the approximability of graph visibility problems -- Algorithms for the Collaborative Delivery Problem with Monitored Constraints -- A Piecewise Approach for the Analysis of Exact Algorithms -- Parameterized Complexity of (d,r) Domination via Modular Decomposition -- Multipacking and broadcast domination on cactus graphs and its impact on hyperbolic graphs -- Evaluating Monotone Circuits on Surfaces -- Ranking and Unranking of the Planar Embeddings of a Planar Graph -- Optimal Uniform Shortest Path Sampling -- An Efficient Implementation of Cosine Distance on Minimal Absent Word Sets using Suffix Automata -- Popularity on the 3D-Euclidean Stable Roommates -- Independent Set Reconfiguration Under Bounded Hop Token Jumping -- Approximation algorithms for non-sequential star packing problems -- Reconfiguration Using Generalized Token Jumping -- Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree Problems -- Min Sum Disjoint Paths on Subclasses of Chordal Graphs -- Maximize the Rightmost Digit Gray Codes for Restricted Growth Strings -- NP Completeness and Physical Zero Knowledge Proofs for Zeiger -- Abelian and stochastic sandpile models on complete bipartite graphs -- Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules -- A Unified Model of Congestion Games with Priorities Two Sided Markets with Ties, Finite and Non Affine Delay Functions, and Pure Nash Equilibria -- Dag like unit refutations in UTVPI Constraint Systems -- Online Contention Resolution Schemes for Size stochastic Knapsacks -- The Connected k Vertex One Center Problem on Graphs.
Contained By:	Springer Nature eBook
標題:	Computer algorithms - Congresses. -
電子資源:	https://doi.org/10.1007/978-981-96-2845-2
ISBN:	9789819628452

WALCOM = algorithms and computation : 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 - March 2, 2025 : proceedings /
WALCOMalgorithms and computation : 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 - March 2, 2025 : proceedings /[electronic resource] :WALCOM 2025edited by Shin-ichi Nakano, Mingyu Xiao. - Singapore :Springer Nature Singapore :2025. - xxi, 426 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,154111611-3349 ;. - Lecture notes in computer science ;15411..

Parameterized Voter Relevance in Facility Location Games with Tree Shaped Invitation Graphs -- Proportionally dense subgraphs parameterized hardness and efficiently solvable cases -- Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons -- On the approximability of graph visibility problems -- Algorithms for the Collaborative Delivery Problem with Monitored Constraints -- A Piecewise Approach for the Analysis of Exact Algorithms -- Parameterized Complexity of (d,r) Domination via Modular Decomposition -- Multipacking and broadcast domination on cactus graphs and its impact on hyperbolic graphs -- Evaluating Monotone Circuits on Surfaces -- Ranking and Unranking of the Planar Embeddings of a Planar Graph -- Optimal Uniform Shortest Path Sampling -- An Efficient Implementation of Cosine Distance on Minimal Absent Word Sets using Suffix Automata -- Popularity on the 3D-Euclidean Stable Roommates -- Independent Set Reconfiguration Under Bounded Hop Token Jumping -- Approximation algorithms for non-sequential star packing problems -- Reconfiguration Using Generalized Token Jumping -- Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree Problems -- Min Sum Disjoint Paths on Subclasses of Chordal Graphs -- Maximize the Rightmost Digit Gray Codes for Restricted Growth Strings -- NP Completeness and Physical Zero Knowledge Proofs for Zeiger -- Abelian and stochastic sandpile models on complete bipartite graphs -- Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules -- A Unified Model of Congestion Games with Priorities Two Sided Markets with Ties, Finite and Non Affine Delay Functions, and Pure Nash Equilibria -- Dag like unit refutations in UTVPI Constraint Systems -- Online Contention Resolution Schemes for Size stochastic Knapsacks -- The Connected k Vertex One Center Problem on Graphs.

This book LNCS 15411 constitutes the refereed proceedings of the 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, held in Chengdu, China, during February 28 - March 2, 2025. The 26 full papers were carefully reviewed and selected from 68 submissions. WALCOM 2025 covered a wide range of topics, including approximation algorithms, algorithmic graph theory and combinatorics, algorithmic and combinatorial aspects of logic, combinatorial algorithms, combinatorial optimization, combinatorial reconfiguration, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms and complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.

ISBN: 9789819628452

Standard No.: 10.1007/978-981-96-2845-2doiSubjects--Topical Terms:

576357
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

WALCOM = algorithms and computation : 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 - March 2, 2025 : proceedings /
LDR:04020nmm a2200349 a 4500 001 2408732
003 DE-He213
005 20250221115244.0
006 m d
007 cr nn 008maaau
008 260204s2025 si s 0 eng d
020 $a 9789819628452 $q (electronic bk.)
020 $a 9789819628445 $q (paper)
024 7 $a 10.1007/978-981-96-2845-2 $2 doi
035 $a 978-981-96-2845-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 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W156 2025
111 2 $a WALCOM (Workshop) $n (19th : $d 2025 : $c Chengdu, China) $3 3781478
245 1 0 $a WALCOM $h [electronic resource] : $b algorithms and computation : 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 - March 2, 2025 : proceedings / $c edited by Shin-ichi Nakano, Mingyu Xiao.
246 3 $a WALCOM 2025
260 $a Singapore : $b Springer Nature Singapore : $b Imprint: Springer, $c 2025.
300 $a xxi, 426 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 15411
505 0 $a Parameterized Voter Relevance in Facility Location Games with Tree Shaped Invitation Graphs -- Proportionally dense subgraphs parameterized hardness and efficiently solvable cases -- Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons -- On the approximability of graph visibility problems -- Algorithms for the Collaborative Delivery Problem with Monitored Constraints -- A Piecewise Approach for the Analysis of Exact Algorithms -- Parameterized Complexity of (d,r) Domination via Modular Decomposition -- Multipacking and broadcast domination on cactus graphs and its impact on hyperbolic graphs -- Evaluating Monotone Circuits on Surfaces -- Ranking and Unranking of the Planar Embeddings of a Planar Graph -- Optimal Uniform Shortest Path Sampling -- An Efficient Implementation of Cosine Distance on Minimal Absent Word Sets using Suffix Automata -- Popularity on the 3D-Euclidean Stable Roommates -- Independent Set Reconfiguration Under Bounded Hop Token Jumping -- Approximation algorithms for non-sequential star packing problems -- Reconfiguration Using Generalized Token Jumping -- Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree Problems -- Min Sum Disjoint Paths on Subclasses of Chordal Graphs -- Maximize the Rightmost Digit Gray Codes for Restricted Growth Strings -- NP Completeness and Physical Zero Knowledge Proofs for Zeiger -- Abelian and stochastic sandpile models on complete bipartite graphs -- Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules -- A Unified Model of Congestion Games with Priorities Two Sided Markets with Ties, Finite and Non Affine Delay Functions, and Pure Nash Equilibria -- Dag like unit refutations in UTVPI Constraint Systems -- Online Contention Resolution Schemes for Size stochastic Knapsacks -- The Connected k Vertex One Center Problem on Graphs.
520 $a This book LNCS 15411 constitutes the refereed proceedings of the 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, held in Chengdu, China, during February 28 - March 2, 2025. The 26 full papers were carefully reviewed and selected from 68 submissions. WALCOM 2025 covered a wide range of topics, including approximation algorithms, algorithmic graph theory and combinatorics, algorithmic and combinatorial aspects of logic, combinatorial algorithms, combinatorial optimization, combinatorial reconfiguration, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms and complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.
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 Application in Administrative Data Processing. $3 3594379
700 1 $a Nakano, Shin-ichi. $3 901032
700 1 $a Xiao, Mingyu. $3 3409713
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 15411. $3 3781479
856 4 0 $u https://doi.org/10.1007/978-981-96-2845-2
950 $a Computer Science (SpringerNature-11645)