Gima, Tatsuya; Otachi, Yota Extended MSO model checking via small vertex integrity. (English) Zbl 07785278 Algorithmica 86, No. 1, 147-170 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{T. Gima} and \textit{Y. Otachi}, Algorithmica 86, No. 1, 147--170 (2024; Zbl 07785278) Full Text: DOI arXiv
Jaffke, Lars; Jansen, Bart M. P. Fine-grained parameterized complexity analysis of graph coloring problems. (English) Zbl 07640726 Discrete Appl. Math. 327, 33-46 (2023). MSC: 68Qxx 05Cxx 90Cxx PDFBibTeX XMLCite \textit{L. Jaffke} and \textit{B. M. P. Jansen}, Discrete Appl. Math. 327, 33--46 (2023; Zbl 07640726) Full Text: DOI
Luo, Weidong On some FPT problems without polynomial Turing compressions. (English) Zbl 07467480 Theor. Comput. Sci. 905, 87-98 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{W. Luo}, Theor. Comput. Sci. 905, 87--98 (2022; Zbl 07467480) Full Text: DOI
Hols, Eva-Maria C.; Kratsch, Stefan; Pieterse, Astrid Approximate Turing kernelization for problems parameterized by treewidth. (English) Zbl 07651199 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 60, 23 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{E.-M. C. Hols} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 60, 23 p. (2020; Zbl 07651199) Full Text: DOI arXiv
Bodlaender, Hans L.; Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Okamoto, Yoshio; Otachi, Yota; van der Zanden, Tom C. Subgraph isomorphism on graph classes that exclude a substructure. (English) Zbl 1492.68102 Algorithmica 82, No. 12, 3566-3587 (2020). MSC: 68R10 05C60 05C83 68Q27 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Algorithmica 82, No. 12, 3566--3587 (2020; Zbl 1492.68102) Full Text: DOI arXiv
Gutin, Gregory; Ramanujan, M. S.; Reidl, Felix; Wahlström, Magnus Alternative parameterizations of Metric Dimension. (English) Zbl 1436.68146 Theor. Comput. Sci. 806, 133-143 (2020). MSC: 68Q27 05C12 68R10 68W20 PDFBibTeX XMLCite \textit{G. Gutin} et al., Theor. Comput. Sci. 806, 133--143 (2020; Zbl 1436.68146) Full Text: DOI arXiv
Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin Turing kernelization for finding long paths in graph classes excluding a topological minor. (English) Zbl 1430.68219 Algorithmica 81, No. 10, 3936-3967 (2019). MSC: 68R10 05C83 68Q27 PDFBibTeX XMLCite \textit{B. M. P. Jansen} et al., Algorithmica 81, No. 10, 3936--3967 (2019; Zbl 1430.68219) Full Text: DOI arXiv
Jansen, Bart M. P.; Pilipczuk, Marcin; Wrochna, Marcin Turing kernelization for finding long paths in graphs excluding a topological minor. (English) Zbl 1443.68133 Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 23, 13 p. (2018). MSC: 68R10 05C38 05C83 68Q27 PDFBibTeX XMLCite \textit{B. M. P. Jansen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 23, 13 p. (2018; Zbl 1443.68133) Full Text: DOI
López-Ortiz, Alejandro; Perez, Cynthia B.; Romero, Jazmín Arbitrary overlap constraints in graph packing problems. (English) Zbl 1390.05190 Int. J. Found. Comput. Sci. 29, No. 1, 101-122 (2018). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{A. López-Ortiz} et al., Int. J. Found. Comput. Sci. 29, No. 1, 101--122 (2018; Zbl 1390.05190) Full Text: DOI arXiv
Guruswami, Venkatesan; Lee, Euiwoong Inapproximability of \(H\)-transversal/packing. (English) Zbl 1371.68099 SIAM J. Discrete Math. 31, No. 3, 1552-1571 (2017). MSC: 68Q17 05C70 68W25 PDFBibTeX XMLCite \textit{V. Guruswami} and \textit{E. Lee}, SIAM J. Discrete Math. 31, No. 3, 1552--1571 (2017; Zbl 1371.68099) Full Text: DOI
Jansen, Bart M. P. Turing kernelization for finding long paths and cycles in restricted graph classes. (English) Zbl 1356.68099 J. Comput. Syst. Sci. 85, 18-37 (2017). MSC: 68Q25 05C38 PDFBibTeX XMLCite \textit{B. M. P. Jansen}, J. Comput. Syst. Sci. 85, 18--37 (2017; Zbl 1356.68099) Full Text: DOI arXiv
Kiyomi, Masashi; Otachi, Yota Finding a chain graph in a bipartite permutation graph. (English) Zbl 1358.05283 Inf. Process. Lett. 116, No. 9, 569-573 (2016). MSC: 05C85 05C60 PDFBibTeX XMLCite \textit{M. Kiyomi} and \textit{Y. Otachi}, Inf. Process. Lett. 116, No. 9, 569--573 (2016; Zbl 1358.05283) Full Text: DOI
Konagaya, Matsuo; Otachi, Yota; Uehara, Ryuhei Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs. (English) Zbl 1326.05095 Discrete Appl. Math. 199, 37-45 (2016). MSC: 05C60 05C17 05C85 68Q17 PDFBibTeX XMLCite \textit{M. Konagaya} et al., Discrete Appl. Math. 199, 37--45 (2016; Zbl 1326.05095) Full Text: DOI
Fernau, Henning; López-Ortiz, Alejandro; Romero, Jazmín Using parametric transformations toward polynomial kernels for packing problems allowing overlaps. (English) Zbl 1347.68353 ACM Trans. Comput. Theory 7, No. 3, Article No. 13, 29 p. (2015). MSC: 68W05 05C70 68Q17 PDFBibTeX XMLCite \textit{H. Fernau} et al., ACM Trans. Comput. Theory 7, No. 3, Article No. 13, 29 p. (2015; Zbl 1347.68353) Full Text: DOI
Fernau, Henning; López-Ortiz, Alejandro; Romero, Jazmín Kernelization algorithms for packing problems allowing overlaps. (English) Zbl 1460.68074 Jain, Rahul (ed.) et al., Theory and applications of models of computation. 12th annual conference, TAMC 2015, Singapore, May 18–20, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9076, 415-427 (2015). MSC: 68R10 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{H. Fernau} et al., Lect. Notes Comput. Sci. 9076, 415--427 (2015; Zbl 1460.68074) Full Text: DOI arXiv