Ergebnisse für: Fixed-Parameter Tractability
Hier findest Du Bücher, die sich mit Fixed-Parameter Tractability beschäftigen.
This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching bas...
This book constitutes the proceedings of the 25th International Symposium on Fundamentals of Computation Theory, FCT 2025, held in Wrocław, Poland, during September 15–17, 2025.
The 32 full papers included in this volume were carefully reviewed and selected from 50 submissions. They present the f...
This book constitutes the revised selected papers of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2017, held in Eindhoven, The Netherlands, in June 2017.The 31 full papers presented in this volume were carefully reviewed and selected from 71 submissions. They c...
This book constitutes the proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, FCT 2021, held in Athens, Greece, in September 2021. The 30 full papers included in this volume were carefully reviewed and selected from 94 submissions. In addition, the book contains 2 ...
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 sele...
This book constitutes the proceedings of the 25th International Symposium on Fundamentals of Computation Theory, FCT 2025, held in Wrocław, Poland, during September 15–17, 2025.
The 32 full papers included in this volume were carefully reviewed and selected from 50 submissions. They present the f...
This book constitutes the proceedings of the 10th International Workshop on Frontiers in Algorithmics, FAW 2016, held in Qingdao, China, in June/July 2016.      
The 25 full papers presented in this volume were carefully reviewed and selected from 54 submissions. They deal with algor...
Parameterized Complexity in the Polynomial Hierarchy was co-recipient of the E.W. Beth Dissertation Prize 2017 for outstanding dissertations in the fields of logic, language, and information. This work extends the theory of parameterized complexity to higher levels of the Polynomial Hierarchy (PH). ...
Parameterized Complexity in the Polynomial Hierarchy was co-recipient of the E.W. Beth Dissertation Prize 2017 for outstanding dissertations in the fields of logic, language, and information. This work extends the theory of parameterized complexity to higher levels of the Polynomial Hierarchy (PH). ...