LEADER 03862nam  22006855  450 
001 996466006503316
005 20240621195156.0
010   $a1-280-39059-X
010   $a9786613568519
010   $a3-642-17493-0
024 7 $a10.1007/978-3-642-17493-3
035   $a(CKB)2670000000064708
035   $a(SSID)ssj0000476519
035   $a(PQKBManifestationID)11284241
035   $a(PQKBTitleCode)TC0000476519
035   $a(PQKBWorkID)10480245
035   $a(PQKB)10305176
035   $a(DE-He213)978-3-642-17493-3
035   $a(MiAaPQ)EBC3066240
035   $a(PPN)149893655
035   $a(EXLCZ)992670000000064708
100   $a20101203d2010      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aParameterized and Exact Computation $e5th International  Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings /$fedited by Venkatesh Raman, Saket Saurabh
205   $a1st ed. 2010.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010.
215   $a1 online resource (X, 239 p. 18 illus.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6478
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-17492-2 
327   $aThe Complexity of Satisfaction on Sparse Graphs -- Protrusions in Graphs and Their Applications -- Parameterized Complexity Results in Symmetry Breaking -- On the Kernelization Complexity of Colorful Motifs -- Partial Kernelization for Rank Aggregation: Theory and Experiments -- Enumerate and Measure: Improving Parameter Budget Management -- On the Exact Complexity of Evaluating Quantified k-CNF -- Cluster Editing: Kernelization Based on Edge Cuts -- Computing the Deficiency of Housing Markets with Duplicate Houses -- A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application -- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion -- Multivariate Complexity Analysis of Swap Bribery -- Parameterizing by the Number of Numbers -- Are There Any Good Digraph Width Measures? -- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems -- Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming -- On the Grundy Number of a Graph -- Exponential Time Complexity of Weighted Counting of Independent Sets -- The Exponential Time Complexity of Computing the Probability That a Graph Is Connected -- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting -- Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier -- Proper Interval Vertex Deletion.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6478
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aComputer science
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aTheory of Computation
606   $aSymbolic and Algebraic Manipulation
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aComputer science.
615 14$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aTheory of Computation.
615 24$aSymbolic and Algebraic Manipulation.
676   $a511.352
702   $aRaman$b V$g(Venkatesh),$f1962-$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aSaurabh$b Saket$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aIPEC (Symposium)
906   $aBOOK
912   $a996466006503316
996   $aParameterized and Exact Computation$9772030
997   $aUNISA