LEADER 00887nmm0-22003371i-450- 001 990007904200403321 005 20050324153512.0 010 $a88-8207-104-9 035 $a000790420 035 $aFED01000790420 035 $a(Aleph)000790420FED01 035 $a000790420 100 $a20040709d2003----km-y0itay50------ba 101 0 $aita 102 $aIT 200 1 $aTutela ambientale$fa cura di Paola Oreto 210 $aPalermo$cGrafill$d2003 215 $a182 p.$d24 cm$e1 cd-rom 225 1 $a<>normativa con CD-ROM$v9 610 0 $aTutela ambientale 676 $a344.44046 702 1$aOreto,$bPaola 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990007904200403321 952 $aI G 358$b39751$fFSPBC 952 $aURB.LE B 2103$b13368$fFARBC 959 $aFSPBC 959 $aFARBC 996 $aTutela ambientale$9643918 997 $aUNINA LEADER 02988nam 22006735 450 001 996418321503316 005 20230329172653.0 010 $a3-030-59901-9 024 7 $a10.1007/978-3-030-59901-0 035 $a(CKB)4100000011469522 035 $a(MiAaPQ)EBC6355964 035 $a(DE-He213)978-3-030-59901-0 035 $a(PPN)255087470 035 $a(EXLCZ)994100000011469522 100 $a20200922d2020 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFrontiers in Algorithmics$b[electronic resource] $e14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings /$fedited by Minming Li 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (IX, 145 p. 51 illus., 2 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12340 311 $a3-030-59900-0 330 $aThis book constitutes the proceedings of the 14th International Workshop on Frontiers in Algorithmics, FAW 2020, held in Haikou, China, in May 2020. The conference was held virtually due to the COVID-19 pandemic. The 12 full papers presented in this volume were carefully reviewed and selected from 15 submissions. The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The papers detail graph theory, scheduling and algorithm and complexity. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12340 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer engineering 606 $aComputer networks 606 $aDiscrete Mathematics in Computer Science 606 $aTheory of Computation 606 $aData Structures and Information Theory 606 $aComputer Engineering and Networks 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aComputer engineering. 615 0$aComputer networks. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aTheory of Computation. 615 24$aData Structures and Information Theory. 615 24$aComputer Engineering and Networks. 676 $a005.1 702 $aLi$b Minming 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996418321503316 996 $aFrontiers in algorithmics$958649 997 $aUNISA