Parameterized and Exact Computation 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers /
Parameterized and Exact Computation 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers / [electronic resource] :
edited by Dániel Marx, Peter Rossmanith.
- 1st ed. 2012.
- VIII, 273 p. 28 illus. online resource.
- Theoretical Computer Science and General Issues, 7112 2512-2029 ; .
- Theoretical Computer Science and General Issues, 7112 .
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.
9783642280504
10.1007/978-3-642-28050-4 doi
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Computer science.
Algorithms.
Discrete Mathematics in Computer Science.
Theory of Computation.
Symbolic and Algebraic Manipulation.
QA76.9.A43
518.1
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.
9783642280504
10.1007/978-3-642-28050-4 doi
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Computer science.
Algorithms.
Discrete Mathematics in Computer Science.
Theory of Computation.
Symbolic and Algebraic Manipulation.
QA76.9.A43
518.1