國立高雄大學圖資館 |

Language: English

Back

WALCOMalgorithms and computation : 1...

(1998 :)

WALCOMalgorithms and computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 - April 2, 2020 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	WALCOMedited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung.
Reminder of title:	algorithms and computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 - April 2, 2020 : proceedings /
remainder title:	WALCOM 2020
other author:	Rahman, M. Sohel.
corporate name:
Published:	Cham :Springer International Publishing :2020.
Description:	xiii, 350 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Computer algorithmsCongresses.
Online resource:	https://doi.org/10.1007/978-3-030-39881-1
ISBN:	9783030398811$q(electronic bk.)

WALCOMalgorithms and computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 - April 2, 2020 : proceedings /
WALCOMalgorithms and computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 - April 2, 2020 : proceedings /[electronic resource] :WALCOM 2020edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung. - Cham :Springer International Publishing :2020. - xiii, 350 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,120490302-9743 ;. - Lecture notes in computer science ;4891..

Drawing Planar Graphs -- Space Efficient Separator Algorithms for Planar Graphs -- Recent progresses in the combinatorial and algorithmic study of phylogenetic networks -- Optimum Algorithm for the Mutual Visibility Problem -- Routing in Histograms -- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Micro uidic Chips -- Shortest Covers of All Cyclic Shifts of a String -- Packing Trees into 1-planar Graphs -- Angle Covers: Algorithms and Complexity -- Fast Multiple Pattern Cartesian Tree Matching -- Generalized Dictionary Matching under Substring Consistent Equivalence Relations -- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons -- Maximum Bipartite Subgraph of Geometric Intersection Graphs -- The Stub Resolution of 1-planar Graphs -- Dispersion of Mobile Robots on Grids -- Packing and Covering with Segments -- Implicit Enumeration of Topological-Minor-Embeddings and Ist Application to Planar Subgraph Enumeration -- Partitioning a graph into complementary subgraphs -- On the Maximum Edge-Pair Embedding Bipartite Matching -- Packing Arc-Disjoint Cycles in Bipartite Tournaments -- Matching random colored points with rectangles -- Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams -- Approximability of the Independent Fedback Vertex Set Problem for Bipartite Graphs -- Efficient Enumeration of Non-isomorphic Ptolemaic Graphs -- Faster Privacy-Preserving Computation of Edit Distance with Moves -- Parameterized Algorithms for the Happy Set Problem -- An Experimental Study of a 1-planarity Testing and Embedding Algorithm -- Trichotomy for the recon guration problem of integer linear systems -- Train Scheduling: Hardness and Algorithms.

This book constitutes the refereed proceedings of the 14th International Conference on Algorithms and Computation, WALCOM 2020, held in Singapore in March/April 2020. The 23 full and 4 short papers presented were carefully reviewed and selected from 66 submissions. The papers focus on algorithmic graph theory and combinatorics, computational biology, computational geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, network optimization.

ISBN: 9783030398811$q(electronic bk.)

Standard No.: 10.1007/978-3-030-39881-1doiSubjects--Topical Terms:

380777
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43 / W35 2020

Dewey Class. No.: 005.1

WALCOMalgorithms and computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 - April 2, 2020 : proceedings /
LDR:03532nmm a2200361 a 4500 001 573432
003 DE-He213
005 20200127083139.0
006 m d
007 cr nn 008maaau
008 200928s2020 sz s 0 eng d
020 $a 9783030398811$q(electronic bk.)
020 $a 9783030398804$q(paper)
024 7 $a 10.1007/978-3-030-39881-1 $2 doi
035 $a 978-3-030-39881-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b W35 2020
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W156 2020
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a WALCOM $h [electronic resource] : $b algorithms and computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 - April 2, 2020 : proceedings / $c edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung.
246 3 $a WALCOM 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xiii, 350 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12049
490 1 $a Theoretical computer science and general issues
505 0 $a Drawing Planar Graphs -- Space Efficient Separator Algorithms for Planar Graphs -- Recent progresses in the combinatorial and algorithmic study of phylogenetic networks -- Optimum Algorithm for the Mutual Visibility Problem -- Routing in Histograms -- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Micro uidic Chips -- Shortest Covers of All Cyclic Shifts of a String -- Packing Trees into 1-planar Graphs -- Angle Covers: Algorithms and Complexity -- Fast Multiple Pattern Cartesian Tree Matching -- Generalized Dictionary Matching under Substring Consistent Equivalence Relations -- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons -- Maximum Bipartite Subgraph of Geometric Intersection Graphs -- The Stub Resolution of 1-planar Graphs -- Dispersion of Mobile Robots on Grids -- Packing and Covering with Segments -- Implicit Enumeration of Topological-Minor-Embeddings and Ist Application to Planar Subgraph Enumeration -- Partitioning a graph into complementary subgraphs -- On the Maximum Edge-Pair Embedding Bipartite Matching -- Packing Arc-Disjoint Cycles in Bipartite Tournaments -- Matching random colored points with rectangles -- Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams -- Approximability of the Independent Fedback Vertex Set Problem for Bipartite Graphs -- Efficient Enumeration of Non-isomorphic Ptolemaic Graphs -- Faster Privacy-Preserving Computation of Edit Distance with Moves -- Parameterized Algorithms for the Happy Set Problem -- An Experimental Study of a 1-planarity Testing and Embedding Algorithm -- Trichotomy for the recon guration problem of integer linear systems -- Train Scheduling: Hardness and Algorithms.
520 $a This book constitutes the refereed proceedings of the 14th International Conference on Algorithms and Computation, WALCOM 2020, held in Singapore in March/April 2020. The 23 full and 4 short papers presented were carefully reviewed and selected from 66 submissions. The papers focus on algorithmic graph theory and combinatorics, computational biology, computational geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, network optimization.
650 0 $a Computer algorithms $v Congresses. $3 380777
650 0 $a Algorithms. $3 184661
650 0 $a Data structures (Computer science) $3 183917
650 0 $a Computer science $x Mathematics. $3 181991
650 0 $a Artificial intelligence. $3 194058
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Mathematics of Computing. $3 273710
650 2 4 $a Artificial Intelligence. $3 212515
700 1 $a Rahman, M. Sohel. $3 714088
700 1 $a Sadakane, Kunihiko. $e author. $3 678403
700 1 $a Sung, Wing-Kin. $3 806289
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-39881-1
950 $a Computer Science (Springer-11645)