Author:
Aravind N.R.,Saxena Roopam
Subject
General Computer Science,Theoretical Computer Science
Reference39 articles.
1. On structural parameterizations of the matching cut problem;Aravind,2017
2. Cross-composition: a new technique for kernelization lower bounds;Bodlaender,2011
3. Kernel bounds for disjoint cycles and disjoint paths;Bodlaender;Theor. Comput. Sci.,2011
4. The complexity of the matching-cut problem for planar graphs and other graph classes;Bonsma;J. Graph Theory,2009
5. A fast branching algorithm for cluster vertex deletion;Boral;Theory Comput. Syst.,2016