Parameterized and Exact Computation

Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings

  • Editors
  • Martin Grohe
  • Rolf Niedermeier
Conference proceedings IWPEC 2008

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

Table of contents

  1. Front Matter
  2. Stephan Kreutzer
    Pages 10-12
  3. Omid Amini, Ignasi Sau, Saket Saurabh
    Pages 13-29
  4. Yonatan Aumann, Yair Dombb
    Pages 30-42
  5. Sebastian Böcker, Quang Bao Anh Bui, Anke Truss
    Pages 43-54
  6. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
    Pages 55-65
  7. Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
    Pages 66-77
  8. Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
    Pages 78-90
  9. Khaled Elbassioni, Matthias Hagen, Imran Rauf
    Pages 91-102
  10. Michael Fellows, Danny Hermelin, Moritz Müller, Frances Rosamond
    Pages 103-114
  11. Daniel Lokshtanov
    Pages 141-147
  12. Moritz Müller
    Pages 148-159
  13. Hans L. Bodlaender, Eelko Penninkx
    Pages 160-171
  14. Allan Scott, Ulrike Stege
    Pages 172-189
  15. Patrick Traxler
    Pages 190-201
  16. Johan M. M. van Rooij, Hans L. Bodlaender
    Pages 214-225
  17. Back Matter

About these proceedings


This book constitutes the refereed proceedings of the Third International Workshop on Parameterized and Exact Computation, IWPEC 2008, held in Victoria, Canada, in May 2008 - co-located with the 40th ACM Symposium on Theory of Computing, STOC 2008.

The 17 revised full papers presented together with 3 invited lectures were carefully reviewed and selected from 32 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized computation, implementation and experiments, high-performance computing and fixed-parameter tractability.


Erfüllbarkeitsproblem der Aussagenlogik algorithm algorithmics algorithms algorithms design approximation combinatorial optimization complexity complexity theory computational complexity computational discrete mathematics computational graph theory edge dominating set evolutionary tree exact computation

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-540-79722-7
  • Online ISBN 978-3-540-79723-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
IT & Software
Consumer Packaged Goods