Parameterized and exact computation : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014, revised selected papers / Marek Cygan, Pinar Heggernes (eds.).

Unlimited

Authorized users

Can lend chapters, not whole ebooks

Parameterized and exact computation : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014, revised selected papers / Marek Cygan, Pinar Heggernes (eds.).

9783319135243 (electronic bk.)
3319135244 (electronic bk.)
3319135236 (print)
9783319135236 (print)
9783319135236

Cham : Springer, 2014.

English

1 online resource (ix, 343 pages) : illustrations.

10.1007/978-3-319-13524-3 doi

QA276.8

004

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.

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.

Includes bibliographical references and index.

Access limited to authorized users.

text file PDF

Lecture notes in computer science ; 8894.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.

Print version: 9783319135236

Online Resources > Ebooks
All Resources