Kernelization: Theory of Parameterized Preprocessing

Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav

ISBN 10: 1107057760 / ISBN 13: 9781107057760

Edité par Cambridge University Press, 2019

A propos de cet article

A firm and square hardback with sharp corners and strong joints, just showing a few very minor cosmetic rubs. Hence a non-text page has a 'damaged' stamp. Despite such this book is actually in nearly new condition and appears unread. Thus the contents are crisp, fresh and tight; no pen-marks. Now offered for sale at a very sensible price.

N° de réf. du vendeur 208971

Détails bibliographiques

• Titre: Kernelization: Theory of Parameterized Preprocessing
• Éditeur: Cambridge University Press
• Date de parution: 2019
• Langue: anglais
• ISBN à 10 chiffres: 1107057760
• ISBN à 13 chiffres: 9781107057760
• Reliure: Hardcover
• Édition: First Edition.
• État de l'article: Like New

A propos de ce titre

Synopsis

A complete introduction to recent advances in preprocessing analysis, or kernelization, with extensive examples using a single data set.

À propos des auteurs

Fedor V. Fomin is Professor of Computer Science at the Universitetet i Bergen, Norway. He is known for his work in algorithms and graph theory. He has co-authored two books, Exact Exponential Algorithms (2010) and Parameterized Algorithms (2015), and received the EATCS Nerode prizes in 2015 and 2017 for his work on bidimensionality and Measure and Conquer.

Daniel Lokshtanov is Professor of Informatics at the Universitetet i Bergen, Norway. His main research interests are in graph algorithms, parameterized algorithms, and complexity. He is a co-author of Parameterized Algorithms (2015) and is a recipient of the Meltzer prize, the Bergen Research Foundation young researcher grant, and an ERC starting grant on parameterized algorithms.

Saket Saurabh is Professor of Theoretical Computer Science at the Institute of Mathematical Sciences, Chennai, and Professor of Computer Science at the Universitetet i Bergen, Norway. He has made important contributions to every aspect of parametrized complexity and kernelization, especially to general purpose results in kernelization and applications of extremal combinatorics in designing parameterized algorithms. He is a co-author of Parameterized Algorithms (2015).

Meirav Zehavi is Assistant Professor of Computer Science at Ben-Gurion University. Her research interests lie primarily in the field of parameterized complexity. In her Ph.D. studies, she received three best student paper awards.