Parameterized and Exact Computation

6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers

  • Dániel Marx
  • Peter Rossmanith
Conference proceedings IPEC 2011

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

Table of contents

  1. Front Matter
  2. Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk
    Pages 1-12
  3. Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen
    Pages 13-26
  4. Pinar Heggernes, Pim van ’t Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
    Pages 55-66
  5. Petr A. Golovach, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos
    Pages 67-79
  6. Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
    Pages 80-93
  7. Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
    Pages 145-158
  8. Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh
    Pages 159-168
  9. Jiong Guo, Iyad Kanj, Stefan Kratsch
    Pages 169-180
  10. René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller
    Pages 194-206
  11. Hajo Broersma, Petr A. Golovach, Viresh Patel
    Pages 207-218
  12. Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle
    Pages 219-231
  13. Michael Lampis
    Pages 232-245
  14. Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh
    Pages 246-258
  15. Back Matter

About these proceedings


This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, in Saarbrücken, Germany, in September 2011. The 21 revised full papers presented were carefully reviewed and selected from 40 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, 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.


constraint satisfaction kernelization planar graphs polynomial parameter transformation satisfiability

Editors and affiliations

  • Dániel Marx
    • 1
  • Peter Rossmanith
    • 2
  1. 1.MTA SZTAKIBudapestHungary
  2. 2.Lehrgebiet Theoretische InformatikRWTH AachenAachenGermany

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-28049-8
  • Online ISBN 978-3-642-28050-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site