On Structural Parameterizations of the Matching Cut Problem, Proc. of the 11th International Conference on Combinatorial Optimization and Applications (COCOA), volume 10628 of LNCS, pp.475-482, 2017. ,
Internal partitions of regular graphs, Journal of Graph Theory, vol.83, issue.1, pp.5-18, 2016. ,
On problems without polynomial kernels, Journal of Computer and System Sciences, vol.75, issue.8, pp.423-434, 2009. ,
Cross-Composition: A New Technique for Kernelization Lower Bounds, Proc. of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS), vol.9, pp.165-176, 2011. ,
The complexity of the matching-cut problem for planar graphs and other graph classes, Journal of Graph Theory, vol.62, issue.2, pp.109-126, 2009. ,
A fast branching algorithm for cluster vertex deletion. Theory of Computing Systems, vol.58, pp.357-376, 2016. ,
Recognizing decomposable graphs, Journal of Graph Theory, vol.8, issue.1, pp.51-53, 1984. ,
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and computation, vol.85, pp.12-75, 1990. ,
URL : https://hal.archives-ouvertes.fr/hal-00353765
, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms, 2015.
, , 2009.
, Graph Theory, vol.173, 2010.
Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013. ,
Kernelization: Theory of Parameterized Preprocessing, 2019. ,
Infeasibility of instance compression and succinct PCPs for NP, Journal of Computer and System Sciences, vol.77, issue.1, pp.91-106, 2011. ,
On primitive graphs and optimal vertex assignments, Annals of the New York academy of sciences, vol.175, issue.1, pp.170-186, 1970. ,
On the complexity of k-SAT, Journal of Computer and System Sciences, vol.62, issue.2, pp.367-375, 2001. ,
On decomposition of triangle-free graphs under degree constraints, Journal of Graph Theory, vol.27, issue.1, pp.7-9, 1998. ,
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms, Proc. of the 13th International Symposium on Parameterized and Exact Computation (IPEC), volume 115 of LIPIcs, vol.19, pp.1-19, 2018. ,
Algorithms solving the matching cut problem, Theoretical Computer Science, vol.609, pp.328-335, 2016. ,
On the Complexity of Matching Cut in Graphs of Fixed Diameter, Proc. of the 27th International Symposium on Algorithms and Computation (ISAAC), vol.64, 2016. ,
On stable cutsets in line graphs, Theoretical Computer Science, vol.301, issue.1-3, pp.463-475, 2003. ,
Decomposing C4-free graphs under degree constraints, Journal of Graph Theory, vol.90, issue.1, pp.13-23, 2019. ,
Treewidth Reduction for Constrained Separation and Bipartization Problems, Proc. of the 27th International Symposium on Theoretical Aspects of Computer Science, (STACS), volume 5 of LIPIcs, pp.561-572, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00455767
Matching cutsets in graphs, Journal of Graph Theory, vol.13, issue.5, pp.527-536, 1989. ,
The complexity of the matching-cut problem, Proc. of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.2204, pp.284-295, 2001. ,