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
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
de Berg, Mark; Jansen, Bart M. P.; Mukherjee, Debankur Independent-set reconfiguration thresholds of hereditary graph classes. (English) Zbl 1398.05155 Discrete Appl. Math. 250, 165-182 (2018). MSC: 05C69 05C75 PDFBibTeX XMLCite \textit{M. de Berg} et al., Discrete Appl. Math. 250, 165--182 (2018; Zbl 1398.05155) Full Text: DOI arXiv Link
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
Fellows, Michael R.; Jansen, Bart M. P. FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders. (English) Zbl 1347.68167 ACM Trans. Comput. Theory 6, No. 4, Article No. 16, 26 p. (2014). MSC: 68Q17 05C85 68Q25 PDFBibTeX XMLCite \textit{M. R. Fellows} and \textit{B. M. P. Jansen}, ACM Trans. Comput. Theory 6, No. 4, Article No. 16, 26 p. (2014; Zbl 1347.68167) Full Text: DOI
Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał Preprocessing subgraph and minor problems: when does a small vertex cover help? (English) Zbl 1277.68095 J. Comput. Syst. Sci. 80, No. 2, 468-495 (2014). MSC: 68Q25 05C85 05C70 05C15 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., J. Comput. Syst. Sci. 80, No. 2, 468--495 (2014; Zbl 1277.68095) Full Text: DOI arXiv
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan Kernel bounds for path and cycle problems. (English) Zbl 1407.68207 Theor. Comput. Sci. 511, 117-136 (2013). MSC: 68Q25 05C38 68Q17 68R10 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Theor. Comput. Sci. 511, 117--136 (2013; Zbl 1407.68207) Full Text: DOI