Parameterized and Exact Computation: 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings: 6478 - Brossura

Brossura

ISBN 10: 3642174922 ISBN 13: 9783642174926

Casa editrice: Springer-Nature New York Inc, 2010

Riassunto

TheInternationalSymposiumonParameterizedandExactComputation(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.

Su questo libro

Contenuti

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.

Dettagli dell'edizione

• Editore: Springer-Nature New York Inc
• Data di pubblicazione: 2010
• Lingua: Inglese
• ISBN 10: 3642174922
• ISBN 13: 9783642174926
• Rilegatura: Copertina flessibile
• Numero di pagine: 238
• Redattore: Raman Venkatesh, Saurabh Saket
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania