Parameterized and exact computation : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014 : revised selected papers
Author(s)
Bibliographic Information
Parameterized and exact computation : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014 : revised selected papers
(Lecture notes in computer science, 8894 . LNCS sublibrary ; SL 1 . Theoretical computer science and general issues)
Springer, c2014
Available at 1 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references and index
Description and Table of Contents
Description
This book constitutes the thoroughly refereed post-conference proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, in Wroclaw, Poland, in September 2014. The 27 revised full papers presented together with one invited paper were carefully reviewed and selected from 42 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 exponential-time computation; and implementation issues of parameterized and exact exponential-time algorithms.
Table of Contents
Fixed-parameter tractability results.- Parameterized complexity theory.- Relationship between parameterized complexity and traditional complexity classifications.-Applications of parameterized and exact exponential-time computation.- Implementation issues of parameterized and exact exponential-time algorithms.
by "Nielsen BookData"