Parameterized and Exact Computation
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Parameterized and Exact Computation: 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings(6478 Lecture Notes in Computer Science)
Parameterized and Exact Computation: 5th International  Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings(6478 Lecture Notes in Computer Science)

Parameterized and Exact Computation: 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings(6478 Lecture Notes in Computer Science)

|
     0     
5
4
3
2
1




International Edition


About the Book

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.

Table of Contents:
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.


Best Sellers


Product Details
  • ISBN-13: 9783642174926
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Language: English
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • ISBN-10: 3642174922
  • Publisher Date: 22 Nov 2010
  • Binding: Paperback
  • No of Pages: 239
  • Series Title: 6478 Lecture Notes in Computer Science
  • Sub Title: 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Parameterized and Exact Computation: 5th International  Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings(6478 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Parameterized and Exact Computation: 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings(6478 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Parameterized and Exact Computation: 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings(6478 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!