Final Report Summary - PREPROCESSING (RIGOROUS THEORY OF PREPROCESSING)
Within this project we have obtained several breakthroughs in the study of kernelization. The highlights of our work are
- novel kernelization techniques allowing to show kernelization techniques for a wide class of problems;
- new algorithmic tools for analyzing preprocessing algorithms on sparse graphs;
- discovery of strong connection between kernelization, subexponential parameterized algorithms and approximation algorithms;
- developing of new algorithmic techniques for solving parameterized problems on directed graphs (tournaments and directed planar graphs)