Skip to main content
  • Conference proceedings
  • © 2010

Parameterized and Exact Computation

5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings

  • Unique visibility
  • State-of-the-art survey
  • Fast-track conference proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6478)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): IPEC: International Symposium on Parameterized and Exact Computation

Conference proceedings info: IPEC 2010.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (22 papers)

  1. Front Matter

  2. On the Kernelization Complexity of Colorful Motifs

    • Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip et al.
    Pages 14-25
  3. Partial Kernelization for Rank Aggregation: Theory and Experiments

    • Nadja Betzler, Robert Bredereck, Rolf Niedermeier
    Pages 26-37
  4. Enumerate and Measure: Improving Parameter Budget Management

    • Daniel Binkele-Raible, Henning Fernau
    Pages 38-49
  5. On the Exact Complexity of Evaluating Quantified k-CNF

    • Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
    Pages 50-59
  6. Cluster Editing: Kernelization Based on Edge Cuts

    • Yixin Cao, Jianer Chen
    Pages 60-71
  7. Computing the Deficiency of Housing Markets with Duplicate Houses

    • Katarína Cechlárová, Ildikó Schlotter
    Pages 72-83
  8. A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application

    • Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo
    Pages 84-94
  9. An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion

    • Marek Cygan, Marcin Pilipczuk, MichaÅ‚ Pilipczuk, Jakub Onufry Wojtaszczyk
    Pages 95-106
  10. Multivariate Complexity Analysis of Swap Bribery

    • Britta Dorn, Ildikó Schlotter
    Pages 107-122
  11. Parameterizing by the Number of Numbers

    • Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
    Pages 123-134
  12. Are There Any Good Digraph Width Measures?

    • Robert Ganian, Petr HlinÄ›ný, Joachim Kneis, Daniel Meister, Jan Obdržálek, Peter Rossmanith et al.
    Pages 135-146
  13. On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems

    • Sylvain Guillemot, Christophe Paul, Anthony Perez
    Pages 147-157
  14. Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

    • Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
    Pages 158-169
  15. On the Grundy Number of a Graph

    • Frédéric Havet, Leonardo Sampaio
    Pages 170-179

Other Volumes

  1. Parameterized and Exact Computation

Editors and Affiliations

  • The Institute of Mathematical Sciences, Chennai, India

    Venkatesh Raman, Saket Saurabh

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access