LEADER 03706nam  22007335  450 
001 996211265403316
005 20230330061858.0
010   $a3-319-13524-4
024 7 $a10.1007/978-3-319-13524-3
035   $a(CKB)3710000000325023
035   $a(SSID)ssj0001408337
035   $a(PQKBManifestationID)11727569
035   $a(PQKBTitleCode)TC0001408337
035   $a(PQKBWorkID)11366810
035   $a(PQKB)10547234
035   $a(DE-He213)978-3-319-13524-3
035   $a(MiAaPQ)EBC6296882
035   $a(MiAaPQ)EBC5610438
035   $a(Au-PeEL)EBL5610438
035   $a(OCoLC)902703657
035   $a(PPN)183152271
035   $a(EXLCZ)993710000000325023
100   $a20141202d2014      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aParameterized and Exact Computation$b[electronic resource] $e9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers /$fedited by Marek Cygan, Pinar Heggernes
205   $a1st ed. 2014.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014.
215   $a1 online resource (IX, 343 p. 37 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8894
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-319-13523-6 
327   $aFixed-parameter tractability results -- Parameterized complexity theory -- Relationship between parameterized complexity and traditional complexity classifications.-Applications of parameterized and exact exponential-time computation.- Implementation issues of parameterized and exact exponential-time algorithms.
330   $aThis book constitutes the thoroughly refereed post-conference proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, in Wroclaw, Poland, in September 2014. The 27 revised full papers presented together with one invited paper were carefully reviewed and selected from 42 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results; parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact exponential-time computation; and implementation issues of parameterized and exact exponential-time algorithms.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8894
606   $aComputer science
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aComputer Science
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aMathematical Applications in Computer Science
615  0$aComputer science.
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615 14$aComputer Science.
615 24$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aMathematical Applications in Computer Science.
676   $a519.544
702   $aCygan$b Marek$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aHeggernes$b Pinar$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996211265403316
996   $aParameterized and Exact Computation$9772030
997   $aUNISA