A 5<i>k</i>-vertex kernel for 3-path vertex cover.
Theor. Comput. Sci., May, 2023
A simple and improved parameterized algorithm for bicluster editing.
Inf. Process. Lett., 2022
Parameterized algorithms and kernels for almost induced matching.
Theor. Comput. Sci., 2020
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems.
Theor. Comput. Sci., 2017
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover.
Proceedings of the Theory and Applications of Models of Computation, 2017
Almost Induced Matching: Linear Kernels and Parameterized Algorithms.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016
An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015