03862nam 22006855 450 99646600650331620240621195156.01-280-39059-X97866135685193-642-17493-010.1007/978-3-642-17493-3(CKB)2670000000064708(SSID)ssj0000476519(PQKBManifestationID)11284241(PQKBTitleCode)TC0000476519(PQKBWorkID)10480245(PQKB)10305176(DE-He213)978-3-642-17493-3(MiAaPQ)EBC3066240(PPN)149893655(EXLCZ)99267000000006470820101203d2010 u| 0engurnn#008mamaatxtccrParameterized and Exact Computation 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings /edited by Venkatesh Raman, Saket Saurabh1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (X, 239 p. 18 illus.)Theoretical Computer Science and General Issues,2512-2029 ;6478Bibliographic Level Mode of Issuance: Monograph3-642-17492-2 The 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.Theoretical Computer Science and General Issues,2512-2029 ;6478AlgorithmsComputer science—MathematicsDiscrete mathematicsComputer scienceAlgorithmsDiscrete Mathematics in Computer ScienceTheory of ComputationSymbolic and Algebraic ManipulationAlgorithms.Computer science—Mathematics.Discrete mathematics.Computer science.Algorithms.Discrete Mathematics in Computer Science.Theory of Computation.Symbolic and Algebraic Manipulation.511.352Raman V(Venkatesh),1962-edthttp://id.loc.gov/vocabulary/relators/edtSaurabh Saketedthttp://id.loc.gov/vocabulary/relators/edtIPEC (Symposium)BOOK996466006503316Parameterized and Exact Computation772030UNISA