國立高雄大學圖資館 |

Language: English

Back

WALCOMalgorithms and computation : 1...

(1998 :)

WALCOMalgorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	WALCOMedited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy.
Reminder of title:	algorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings /
remainder title:	WALCOM 2021
other author:	Uehara, Ryuhei.
corporate name:
Published:	Cham :Springer International Publishing :2021.
Description:	xv, 334 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Computer algorithmsCongresses.
Online resource:	https://doi.org/10.1007/978-3-030-68211-8
ISBN:	9783030682118$q(electronic bk.)

WALCOMalgorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings /
WALCOMalgorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings /[electronic resource] :WALCOM 2021edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy. - Cham :Springer International Publishing :2021. - xv, 334 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,126350302-9743 ;. - Lecture notes in computer science ;4891..

This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverse areas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, 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: 9783030682118$q(electronic bk.)

Standard No.: 10.1007/978-3-030-68211-8doiSubjects--Topical Terms:

380777
Computer algorithms
--Congresses.

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

Dewey Class. No.: 005.1

WALCOMalgorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings /
LDR:02194nmm a2200349 a 4500 001 616043
003 DE-He213
005 20220223041155.0
006 m d
007 cr nn 008maaau
008 220831s2021 sz s 0 eng d
020 $a 9783030682118$q(electronic bk.)
020 $a 9783030682101$q(paper)
024 7 $a 10.1007/978-3-030-68211-8 $2 doi
035 $a 978-3-030-68211-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b W35 2021
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 2021
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a WALCOM $h [electronic resource] : $b algorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings / $c edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy.
246 3 $a WALCOM 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xv, 334 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12635
490 1 $a Theoretical computer science and general issues
520 $a This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverse areas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, 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 Data Structures and Information Theory. $3 825714
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Computer Graphics. $3 274515
650 2 4 $a Computer and Information Systems Applications. $3 913125
700 1 $a Uehara, Ryuhei. $3 339412
700 1 $a Hong, Seok-Hee. $3 276265
700 1 $a Nandy, Subhas C. $3 914944
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
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-68211-8
950 $a Computer Science (SpringerNature-11645)