LEADER 05606nam 22007575 450 001 9910484011103321 005 20251226195535.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(BIP)32543367 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 08$a3-642-17492-2 320 $aIncludes bibliographical references and index. 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. 330 $aTheInternationalSymposiumonParameterizedandExactComputation(IPEC, formerly IWPEC) is an international symposium series that covers research in all aspects of parameterized and exact algorithms and complexity. Started in 2004 as a biennial workshop, it became an annual event from 2008. The four previous meetings of the IPEC/IWPEC series were held in Bergen, Norway(2004),Zu ¨rich,Switzerland(2006),Victoria,Canada(2008)andCop- hagen, Denmark (2009). On recommendations of the Steering Committee, from this year, the word 'symposium' replaces the word 'workshop' in the name, and it gets a new abbreviation IPEC (rhyming with the old one IWPEC). IPEC 2010 was the ?fth symposium in the series, held in Chennai, India, during December 13-15, 2010. The symposium was co-located with the 30th Foundations of Software Technology and Theoretical Computer Science conf- ence (FSTTCS 2010), a premier theory conference in India. At IPEC 2010, we had three plenary speakers: Anuj Dawar (University of Cambridge, UK), Fedor V. Fomin (University of Bergen, Norway) and Toby Walsh (NICTA and University of New South Wales, Australia). The abstracts accompanyingtheirtalksareincludedintheseproceedings.Wethankthespe- ers for accepting our invitation and for their abstracts. Inresponseto the callforpapers,32papersweresubmitted. Eachsubmission was reviewed by at least four reviewers. The reviewers were either Program Committee members or invited external reviewers. The Program Committee held electronic meetings using the EasyChair system, went through extensive discussions,andselected19ofthesubmissionsforpresentationatthesymposium and inclusion in this LNCS volume. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6478 606 $aAlgorithms 606 $aComputer science$xMathematics 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$xMathematics. 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 701 $aChen$b Jianer$01750514 701 $aFomin$b Fedor V$01750515 712 12$aIPEC (Symposium) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484011103321 996 $aParameterized and exact computation$94185159 997 $aUNINA