Publisher
The Operations Research Society of Japan
Subject
Management Science and Operations Research,General Decision Sciences
Reference13 articles.
1. [1] F.N. Abu-Khzam, M.R. Fellows, M.A. Langston, and W.H. Suters: Crown structures for vertex cover kernelization. Theory of Computing Systems, 41(3) (2007), 411–430.
2. [2] K. Casel, T.Friedrich, D. Issac, A. Niklanovits, and Z. Zeif: Balanced crown decomposition for connectivity constraints. In P. Mutzel, R. Pagh, and G. Herman (eds): Proceedings of the 29th Annual European Symposium on Algorithms, LIPIcs 204 (Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Wadern, 2021), 26:1–26:15.
3. [3] J. Chen, I.A. Kanj, and W. Jia: Vertex cover: Further observations and further improvements. Journal of Algorithms, 41(2) (2001), 280–301.
4. [4] B. Chor, M. Fellows, and D. W. Juedes: Linear kernels in linear time, or how to save k colors in O(n2)) steps. In J. Hromkovic, M. Nagl, and B. Westfechtel (eds): Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 3353 (Springer, Berlin, Heidelberg, 2004), 257–269.
5. [5] M. Cygan, F.V. Fomin, L. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh: Parameterized Algorithms (Springer, Cham, 2015).