Parameterized and Exact Computation [electronic resource] : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers / edited by Dániel Marx, Peter Rossmanith.

Contributor(s):

Series: Lecture Notes in Computer Science ; 7112Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012Description: VIII, 273 p. 28 illus. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783642280504

Subject(s):

Genre/Form:

Electronic books.

Additional physical formats: Printed edition:: No titleDDC classification:

005.1 23

LOC classification:

QA76.9.A43

Online resources:

Click here to access online

In: Springer eBooksSummary: 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.

Item type:

eBooks

Average rating: 0.0 (0 votes)

Holdings ( 0 )
Title notes ( 1 )

No physical items for this record

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.

Back to results