Clustering with Partial Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics
Rotation distance is fixed-parameter tractable
Information Processing Letters
Clustering with partial information
Theoretical Computer Science
An improved kernel size for rotation distance in binary trees
Information Processing Letters
A 2k Kernel for the cluster editing problem
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A 2k kernel for the cluster editing problem
Journal of Computer and System Sciences
Kernels for global constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Kernelization --- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
A linear kernel for the complementary maximal strip recovery problem
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
A more effective linear kernelization for Cluster Editing
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |
One of the main objectives of the talk is to survey the history of the practical algorithmic strategy of preprocessing (also called data-reduction and kernelization) since the beginnings of computer science, and to overview what theoretical computer science has been able to say about it.