The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems. It describes state of the art in kernelization, subexponential algorithms, and parameterized complexity of graph modification. The main focus is on edge modification problems, where the task is to change some adjacencies in a graph to satisfy some required properties. To facilitate further research, we list many open problems in the area.

中文翻译：

---

参数化算法综述和边缘修改的复杂性

该调查全面概述了图修改问题的参数化算法的发展领域。它描述了内核化、次指数算法和图修改的参数化复杂性方面的最新技术。主要关注边修改问题，其中的任务是更改图中的某些邻接关系以满足某些所需的属性。为了便于进一步研究，我们列出了该领域的许多未解决问题。