Parameterized and Exact Computation

4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers

  • Jianer Chen
  • Fedor V. Fomin
Conference proceedings IWPEC 2009

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

Table of contents

  1. Front Matter
  2. Sebastian Böcker, Falk Hüffner, Anke Truss, Magnus Wahlström
    Pages 38-49
  3. Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx
    Pages 50-60
  4. B. -M. Bui-Xuan, J. A. Telle, M. Vatshelle
    Pages 61-74
  5. Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
    Pages 75-85
  6. Jean Daligault, Stéphan Thomassé
    Pages 86-97
  7. Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad Kanj, Frances Rosamond, Ondřej Suchý
    Pages 122-133
  8. Rok Erman, Łukasz Kowalik, Matjaž Krnc, Tomasz Waleń
    Pages 134-148
  9. Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
    Pages 149-160
  10. Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible et al.
    Pages 161-172
  11. Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
    Pages 173-184
  12. Robert Ganian, Petr Hliněný, Joachim Kneis, Alexander Langer, Jan Obdržálek, Peter Rossmanith
    Pages 185-197
  13. Panos Giannopoulos, Christian Knauer, Günter Rote
    Pages 198-209
  14. Petr A. Golovach, Dimitrios M. Thilikos
    Pages 210-221
  15. Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
    Pages 234-245
  16. Mikko Koivisto
    Pages 258-263
  17. Stefan Kratsch, Magnus Wahlström
    Pages 264-275
  18. Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
    Pages 276-287
  19. Daniel Lokshtanov, Saket Saurabh
    Pages 288-299
  20. Karol Suchan, Yngve Villanger
    Pages 324-335
  21. Back Matter

About these proceedings


algorithmics algorithms classification complexity computational graph theory discrete mathematic exponential time graph algorithms maximum spanning tree optimization parametrized algorithms parametrized complexity satisfiability sparse graphs vertex cover

Editors and affiliations

  • Jianer Chen
    • 1
  • Fedor V. Fomin
    • 2
  1. 1.Department of Computer Science and EngineeringTexas A&M UniversityTexasUSA
  2. 2.Institutt for informatikkUniversitetet i BergenBergenNorway

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-11268-3
  • Online ISBN 978-3-642-11269-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site