Parameterized and Exact Computation

8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers

  • Gregory Gutin
  • Stefan Szeider

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

Table of contents

  1. Front Matter
  2. Russell Impagliazzo, Ramamohan Paturi
    Pages 1-3
  3. Rémy Belmonte, Petr A. Golovach, Pim van ’t Hof, Daniël Paulusma
    Pages 16-27
  4. Bernhard Bliem, Reinhard Pichler, Stefan Woltran
    Pages 28-40
  5. Hans L. Bodlaender, Paul Bonsma, Daniel Lokshtanov
    Pages 41-53
  6. Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
    Pages 54-65
  7. Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Émeric Tourniaire
    Pages 66-77
  8. Jarosław Błasiok, M. Kamiński
    Pages 78-83
  9. Leizhen Cai, Yufei Cai
    Pages 84-96
  10. Leizhen Cai, Chengwei Guo
    Pages 97-109
  11. Rajesh Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz
    Pages 110-122
  12. Fedor V. Fomin, Archontia C. Giannopoulou, Michał Pilipczuk
    Pages 137-149
  13. Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
    Pages 150-162
  14. Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
    Pages 163-176
  15. Sylvain Guillemot, Dániel Marx
    Pages 177-188
  16. Olawale Hassan, Iyad Kanj, Daniel Lokshtanov, Ljubomir Perković
    Pages 189-201
  17. Danny Hermelin, Stefan Kratsch, Karolina Sołtys, Magnus Wahlström, Xi Wu
    Pages 202-215
  18. Bart M. P. Jansen
    Pages 216-229

About these proceedings


This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, in Sophia Antipolis, France, in September 2013.
The 29 revised full papers presented were carefully reviewed and selected from 58 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms.


approximation meta-theorems dynamic programming exact algorithms parametrized complexity representative sets

Editors and affiliations

  • Gregory Gutin
    • 1
  • Stefan Szeider
    • 2
  1. 1.Royal Holloway, University of LondonEghamUK
  2. 2.Institute of Information SystemsVienna University of TechnologyViennaAustria

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2013
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-03897-1
  • Online ISBN 978-3-319-03898-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Energy, Utilities & Environment