Parameterized and Exact Computation

7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings

  • Dimitrios M. Thilikos
  • Gerhard J. Woeginger
Conference proceedings IPEC 2012

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

Table of contents

  1. Front Matter
  2. Andreas Björklund
    Pages 1-1
  3. Marcin Pilipczuk, Michał Pilipczuk
    Pages 3-12
  4. Yijia Chen, Kord Eickmeyer, Jörg Flum
    Pages 13-24
  5. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
    Pages 25-36
  6. Ivan Bliznets, Alexander Golovnev
    Pages 37-48
  7. Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis
    Pages 49-60
  8. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
    Pages 85-96
  9. Fedor V. Fomin, Bart M. P. Jansen, Michał Pilipczuk
    Pages 97-108
  10. Chiranjit Chakraborty, Rahul Santhanam
    Pages 120-134
  11. Abhijin Adiga, Jasine Babu, L. Sunil Chandran
    Pages 135-146
  12. Petteri Kaski, Mikko Koivisto, Jesper Nederlof
    Pages 147-158
  13. Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
    Pages 159-170
  14. Markus Bläser, Radu Curticapean
    Pages 171-181
  15. Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
    Pages 182-193
  16. James Abello, Pavel Klavík, Jan Kratochvíl, Tomáš Vyskočil
    Pages 194-205

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, in Ljubljana, Slovenia, in September 2012. The 21 revised full papers presented together with 2 keynote talks were carefully reviewed and selected from 37 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.

Keywords

approximation algorithms graphs parametrized problems proof complexity vertex set problems

Editors and affiliations

  • Dimitrios M. Thilikos
    • 1
  • Gerhard J. Woeginger
    • 2
  1. 1.Department of MathematicsNational and Kapodistrian University of AthensAthensGreece
  2. 2.Department of Mathematics and Computer ScienceEindhoven University of TechnologyEindhovenThe Netherlands

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-33293-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-33292-0
  • Online ISBN 978-3-642-33293-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Telecommunications
Energy, Utilities & Environment
Biotechnology